#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

#74 in Data structures

Download history 4113/week @ 2024-09-10 3785/week @ 2024-09-17 5030/week @ 2024-09-24 6997/week @ 2024-10-01 7268/week @ 2024-10-08 9152/week @ 2024-10-15 8746/week @ 2024-10-22 9662/week @ 2024-10-29 10456/week @ 2024-11-05 10255/week @ 2024-11-12 10108/week @ 2024-11-19 10210/week @ 2024-11-26 11064/week @ 2024-12-03 11012/week @ 2024-12-10 7712/week @ 2024-12-17 2188/week @ 2024-12-24

34,120 downloads per month
Used in 75 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–350KB