Module hash_map
A hash map implemented with quadratic probing and SIMD lookup.
Structs
-
Drain
A draining iterator over the entries of a
HashMapin arbitrary order. The iterator element type is(K, V). -
ExtractIf
A draining iterator over entries of a
HashMapwhich don't satisfy the predicatef(&k, &mut v)in arbitrary order. The iterator element type is(K, V). - HashMap A hash map implemented with quadratic probing and SIMD lookup.
-
IntoIter
An owning iterator over the entries of a
HashMapin arbitrary order. The iterator element type is(K, V). -
IntoKeys
An owning iterator over the keys of a
HashMapin arbitrary order. The iterator element type isK. -
IntoValues
An owning iterator over the values of a
HashMapin arbitrary order. The iterator element type isV. -
Iter
An iterator over the entries of a
HashMapin arbitrary order. The iterator element type is(&'a K, &'a V). -
IterMut
A mutable iterator over the entries of a
HashMapin arbitrary order. The iterator element type is(&'a K, &'a mut V). -
Keys
An iterator over the keys of a
HashMapin arbitrary order. The iterator element type is&'a K. -
OccupiedEntry
A view into an occupied entry in a
HashMap. It is part of theEntryandEntryRefenums. -
OccupiedError
The error returned by
try_insertwhen the key already exists. -
VacantEntry
A view into a vacant entry in a
HashMap. It is part of theEntryenum. -
VacantEntryRef
A view into a vacant entry in a
HashMap. It is part of theEntryRefenum. -
Values
An iterator over the values of a
HashMapin arbitrary order. The iterator element type is&'a V. -
ValuesMut
A mutable iterator over the values of a
HashMapin arbitrary order. The iterator element type is&'a mut V.