#map

btreemultimap

A multimap implementation with range support

2 releases

Uses old Rust 2015

0.1.1 Mar 22, 2023
0.1.0 May 5, 2021

#114 in #map

Download history 301/week @ 2024-06-14 358/week @ 2024-06-21 279/week @ 2024-06-28 197/week @ 2024-07-05 465/week @ 2024-07-12 409/week @ 2024-07-19 313/week @ 2024-07-26 477/week @ 2024-08-02 403/week @ 2024-08-09 469/week @ 2024-08-16 491/week @ 2024-08-23 400/week @ 2024-08-30 475/week @ 2024-09-06 215/week @ 2024-09-13 566/week @ 2024-09-20 331/week @ 2024-09-27

1,621 downloads per month
Used in 8 crates (2 directly)

MIT/Apache

55KB
1K SLoC

Multimap implementation for Rust

This is a sorted multimap implementation with range support for Rust. Implemented as a thin wrapper around std::collections::BTreeMap.

Example

extern crate multimap;

use btreemultimap::BTreeMultiMap;

fn main () {
    let mut map = BTreeMultiMap::new();
    map.insert(3, "a");
    map.insert(5, "b");
    map.insert(5, "c");
    map.insert(8, "c");
    map.insert(9, "d");

    assert_eq!(map[3], "a");
    assert_eq!(map.get(5), Some(&"b"));
    assert_eq!(map.get_vec(5), Some(&vec!["b", "c"]));

    for (&key, &value) in map.range((Included(&4), Included(&8))) {
        println!("{}: {}", key, value);
    }
    
    let mut iter = map.range(4..=8);
    assert_eq!(Some((&5, &"b")), iter.next());
    assert_eq!(Some((&5, &"c")), iter.next());
    assert_eq!(Some((&8, &"c")), iter.next());
    assert_eq!(None, iter.next());
}

License

Licensed under either of

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~165KB