#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

#78 in Data structures

Download history 8938/week @ 2024-10-19 9555/week @ 2024-10-26 10507/week @ 2024-11-02 10504/week @ 2024-11-09 9944/week @ 2024-11-16 9722/week @ 2024-11-23 11046/week @ 2024-11-30 11713/week @ 2024-12-07 8817/week @ 2024-12-14 2221/week @ 2024-12-21 2778/week @ 2024-12-28 6494/week @ 2025-01-04 5097/week @ 2025-01-11 4608/week @ 2025-01-18 4870/week @ 2025-01-25 4945/week @ 2025-02-01

20,755 downloads per month
Used in 77 crates (10 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