#multiset #bag #set #hold

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

#86 in Data structures

Download history 3312/week @ 2024-01-24 2649/week @ 2024-01-31 2971/week @ 2024-02-07 3481/week @ 2024-02-14 3437/week @ 2024-02-21 2957/week @ 2024-02-28 2939/week @ 2024-03-06 2528/week @ 2024-03-13 3020/week @ 2024-03-20 2550/week @ 2024-03-27 2794/week @ 2024-04-03 2692/week @ 2024-04-10 2616/week @ 2024-04-17 3207/week @ 2024-04-24 3276/week @ 2024-05-01 1643/week @ 2024-05-08

11,229 downloads per month
Used in 59 crates (8 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–360KB