What

TreeMultiSet is an implementation of a multiset that allows duplicate elements. This data structure maintains a sorted state as elements are added, and supports iterators and range queries, offering more flexibility in operations.

Iterator

Iterator Support: Easily iterate through elements using the provided iterator.

Range Query Support: Utilize the range method to iterate over elements within a specific range, allowing extraction of elements within a defined range.

Example

ABC241 D - Sequence Query: https://atcoder.jp/contests/abc241/submissions/49645890

ABC212 D - Querying Multiset: https://atcoder.jp/contests/abc212/submissions/49645865

lib.rs:

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.