#multiset #bag #set #hash-set

hashbag

An unordered multiset implementation using a hash bag

13 releases

0.1.12 Feb 17, 2024
0.1.11 Mar 5, 2023
0.1.10 Jan 14, 2023
0.1.9 Jul 2, 2022
0.1.2 Feb 7, 2020

#83 in Data structures

Download history 5651/week @ 2024-08-02 5871/week @ 2024-08-09 4376/week @ 2024-08-16 4572/week @ 2024-08-23 4421/week @ 2024-08-30 4787/week @ 2024-09-06 3659/week @ 2024-09-13 4707/week @ 2024-09-20 5284/week @ 2024-09-27 7680/week @ 2024-10-04 8739/week @ 2024-10-11 8517/week @ 2024-10-18 9829/week @ 2024-10-25 9747/week @ 2024-11-01 11226/week @ 2024-11-08 9884/week @ 2024-11-15

42,042 downloads per month
Used in 72 crates (9 directly)

MIT/Apache

65KB
1K SLoC

Crates.io Documentation Codecov Dependency status

An unordered multiset/bag implementation backed by HashMap.

A bag, unlike a set, allows duplicate values, and keeps track of how many duplicates each value holds. This type of collection is often referred to as an unordered multiset (see also C++'s std::unordered_multiset).

License

Licensed under either of

at your option.

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

~0–340KB