#bag #multiset #set

hashbag

An unordered multiset implementation using a hash bag

12 releases

0.1.11 Mar 5, 2023
0.1.10 Jan 14, 2023
0.1.9 Jul 2, 2022
0.1.8 Jun 27, 2022
0.1.2 Feb 7, 2020

#81 in Data structures

Download history 2205/week @ 2022-12-03 1876/week @ 2022-12-10 2237/week @ 2022-12-17 1063/week @ 2022-12-24 1309/week @ 2022-12-31 1799/week @ 2023-01-07 1547/week @ 2023-01-14 1311/week @ 2023-01-21 1990/week @ 2023-01-28 1941/week @ 2023-02-04 2016/week @ 2023-02-11 2078/week @ 2023-02-18 2558/week @ 2023-02-25 3336/week @ 2023-03-04 3028/week @ 2023-03-11 2835/week @ 2023-03-18

12,196 downloads per month
Used in 33 crates (5 directly)

MIT/Apache

64KB
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–265KB