Expand description
Perfectly hashed mutable containers.
Structs
- Iterator over the domain of a
PerfectHash
. - A mutable, perfectly-hashed map. Note that a
Map
is always full, so you might preferstd::collections::HashMap
for sparse maps. - A mutable, perfectly-hashed set. Note that a small domain is recommended. For sparse sets, you might prefer
std::collections::HashSet
.
Traits
- Inverse operation of the perfect hash function. This is necessary for all operations that generate key values, for example iteration.
- The perfect hash function to be used in all further constructions.