Module std::collections::hash_map  
1.0.0 · source · Expand description
A hash map implemented with quadratic probing and SIMD lookup.
Structs
- ExtractIfExperimentalA draining, filtering iterator over the entries of aHashMap.
- OccupiedErrorExperimentalThe error returned bytry_insertwhen the key already exists.
- RawEntryBuilderExperimentalA builder for computing where in a HashMap a key-value pair would be stored.
- RawEntryBuilderMutExperimentalA builder for computing where in a HashMap a key-value pair would be stored.
- RawOccupiedEntryMutExperimentalA view into an occupied entry in aHashMap. It is part of theRawEntryMutenum.
- RawVacantEntryMutExperimentalA view into a vacant entry in aHashMap. It is part of theRawEntryMutenum.
- The defaultHasherused byRandomState.
- A draining iterator over the entries of aHashMap.
- A hash map implemented with quadratic probing and SIMD lookup.
- An owning iterator over the entries of aHashMap.
- An owning iterator over the keys of aHashMap.
- An owning iterator over the values of aHashMap.
- An iterator over the entries of aHashMap.
- A mutable iterator over the entries of aHashMap.
- An iterator over the keys of aHashMap.
- A view into an occupied entry in aHashMap. It is part of theEntryenum.
- RandomStateis the default state for- HashMaptypes.
- A view into a vacant entry in aHashMap. It is part of theEntryenum.
- An iterator over the values of aHashMap.
- A mutable iterator over the values of aHashMap.
Enums
- RawEntryMutExperimentalA view into a single entry in a map, which may either be vacant or occupied.
- A view into a single entry in a map, which may either be vacant or occupied.