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