Expand description
This is a fork of the hashbrown
crate.
It’s been modified to make use of the memory utilities provided by rune alloc.
This is a Rust port of Google’s high-performance SwissTable hash map,
adapted to make it a drop-in replacement for Rust’s standard HashMap
and
HashSet
types.
The original C++ version of SwissTable can be found here, and this CppCon talk gives an overview of how the algorithm works.
Modules§
Structs§
- HashMap
- A hash map implemented with quadratic probing and SIMD lookup.
- HashSet
- A hash set implemented as a
HashMap
where the value is()
. - TupleFn
- Adapter for
HasherFn
for hashing tuples.
Enums§
- Error
OrInsert Slot - Error raised by
RawTable::find_or_find_insert_slot
.
Traits§
- EqFn
- Trait used to implement custom equality implementations which are not solely based on traits.
- Equivalent
- Key equivalence trait.
- Hasher
Fn - Trait used to implement custom hash implementations which are not solely based on traits.