#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

#80 in Data structures

Download history 4322/week @ 2024-09-25 7773/week @ 2024-10-02 7457/week @ 2024-10-09 9098/week @ 2024-10-16 9337/week @ 2024-10-23 9505/week @ 2024-10-30 10494/week @ 2024-11-06 10563/week @ 2024-11-13 10048/week @ 2024-11-20 10108/week @ 2024-11-27 11494/week @ 2024-12-04 10297/week @ 2024-12-11 6210/week @ 2024-12-18 2199/week @ 2024-12-25 3946/week @ 2025-01-01 6987/week @ 2025-01-08

21,116 downloads per month
Used in 76 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