#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

#104 in Data structures

Download history 1710/week @ 2023-12-23 2308/week @ 2023-12-30 2847/week @ 2024-01-06 3459/week @ 2024-01-13 3734/week @ 2024-01-20 2955/week @ 2024-01-27 2435/week @ 2024-02-03 3253/week @ 2024-02-10 3860/week @ 2024-02-17 2774/week @ 2024-02-24 2788/week @ 2024-03-02 3038/week @ 2024-03-09 2836/week @ 2024-03-16 2864/week @ 2024-03-23 2808/week @ 2024-03-30 2179/week @ 2024-04-06

10,969 downloads per month
Used in 57 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