#multiset #set #hash-map #bag

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

#77 in Data structures

Download history 8695/week @ 2024-12-16 2247/week @ 2024-12-23 2683/week @ 2024-12-30 6699/week @ 2025-01-06 4918/week @ 2025-01-13 4958/week @ 2025-01-20 4611/week @ 2025-01-27 7824/week @ 2025-02-03 6515/week @ 2025-02-10 6712/week @ 2025-02-17 7725/week @ 2025-02-24 7175/week @ 2025-03-03 6215/week @ 2025-03-10 6323/week @ 2025-03-17 5841/week @ 2025-03-24 6274/week @ 2025-03-31

24,863 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–330KB