Crate tree_multiset

This crate provides the TreeMultiSet data structure, which is an implementation of a multi-set using a BTree (BTreeMap) in Rust.

Examples

use tree_multi_set::TreeMultiSet;

let mut set = TreeMultiSet::new();

// Inserting elements
set.insert(1);
set.insert(2);
set.insert(2);

// Counting occurrences
assert_eq!(set.count(&1), 1);
assert_eq!(set.count(&2), 2);

// Removing elements
set.remove_one(&2);
assert_eq!(set.count(&2), 1);

// Iterating over elements
for elem in set.iter() {
    println!("{}", elem);
}

The TreeMultiSet allows for efficient insertion, removal, and counting of elements, making it suitable for scenarios where elements need to be stored along with their counts.

Structs

TreeMultiSet

A data structure representing a multi-set implemented using a BTreeMap.