#hash-map #hash-set #projection #keyed #elements #index

keyed-set

Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements

10 releases (1 stable)

1.0.0 Mar 5, 2024
0.4.5 Mar 29, 2023
0.4.4 Dec 21, 2022
0.4.2 Nov 14, 2022
0.1.0 Nov 8, 2022

#273 in Data structures

Download history 10077/week @ 2024-03-03 9904/week @ 2024-03-10 9937/week @ 2024-03-17 8045/week @ 2024-03-24 7794/week @ 2024-03-31 12085/week @ 2024-04-07 12380/week @ 2024-04-14 9675/week @ 2024-04-21 8589/week @ 2024-04-28 7575/week @ 2024-05-05 13719/week @ 2024-05-12 8143/week @ 2024-05-19 8305/week @ 2024-05-26 8466/week @ 2024-06-02 8679/week @ 2024-06-09 9138/week @ 2024-06-16

34,970 downloads per month
Used in 63 crates (via zenoh-keyexpr)

EPL-2.0 license

21KB
451 lines

Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements.

Ever wanted a HashMap<K, V>, but where V actually contains K (or at least can be projected to it)? Well this is it.

The easiest way to define a projection is through a closure that you pass at construction, but you may also define your own key extractors as ZSTs that implement Default to gain a Default constructor for your Keyed Sets.


lib.rs:

Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements.

Ever wanted a HashMap<K, V>, but where V actually contains K (or at least can be projected to it)? Well this is it.

The easiest way to define a projection is through a closure that you pass at construction, but you may also define your own key extractors as ZSTs that implement Default to gain a Default constructor for your Keyed Sets.

Dependencies

~2MB
~25K SLoC