#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

#87 in Data structures

Download history 3696/week @ 2024-01-18 3306/week @ 2024-01-25 2612/week @ 2024-02-01 2967/week @ 2024-02-08 3610/week @ 2024-02-15 3229/week @ 2024-02-22 2884/week @ 2024-02-29 3065/week @ 2024-03-07 2649/week @ 2024-03-14 3117/week @ 2024-03-21 2506/week @ 2024-03-28 2710/week @ 2024-04-04 2687/week @ 2024-04-11 2633/week @ 2024-04-18 3144/week @ 2024-04-25 2776/week @ 2024-05-02

11,750 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–365KB