#bag #multiset #set

hashbag

An unordered multiset implementation using a hash bag

10 releases

new 0.1.9 Jul 2, 2022
0.1.8 Jun 27, 2022
0.1.5 Mar 20, 2022
0.1.4 Nov 6, 2021
0.1.2 Feb 7, 2020

#102 in Data structures

Download history 5186/week @ 2022-03-16 5081/week @ 2022-03-23 3012/week @ 2022-03-30 2667/week @ 2022-04-06 2885/week @ 2022-04-13 2367/week @ 2022-04-20 2680/week @ 2022-04-27 2165/week @ 2022-05-04 1857/week @ 2022-05-11 2398/week @ 2022-05-18 1880/week @ 2022-05-25 3016/week @ 2022-06-01 2373/week @ 2022-06-08 1850/week @ 2022-06-15 3727/week @ 2022-06-22 1875/week @ 2022-06-29

10,427 downloads per month
Used in 22 crates (3 directly)

MIT/Apache

57KB
926 lines

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