Expand description
A hash map implemented with quadratic probing and SIMD lookup.
Structs§
- Drain
- A draining iterator over the entries of a
HashMap
in arbitrary order. The iterator element type is(K, V)
. - Extract
If - A draining iterator over entries of a
HashMap
which 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.
- Into
Iter - An owning iterator over the entries of a
HashMap
in arbitrary order. The iterator element type is(K, V)
. - Into
Keys - An owning iterator over the keys of a
HashMap
in arbitrary order. The iterator element type isK
. - Into
Values - An owning iterator over the values of a
HashMap
in arbitrary order. The iterator element type isV
. - Iter
- An iterator over the entries of a
HashMap
in arbitrary order. The iterator element type is(&'a K, &'a V)
. - IterMut
- A mutable iterator over the entries of a
HashMap
in arbitrary order. The iterator element type is(&'a K, &'a mut V)
. - Keys
- An iterator over the keys of a
HashMap
in arbitrary order. The iterator element type is&'a K
. - Occupied
Entry - A view into an occupied entry in a
HashMap
. It is part of theEntry
andEntryRef
enums. - Occupied
Error - The error returned by
try_insert
when the key already exists. - Vacant
Entry - A view into a vacant entry in a
HashMap
. It is part of theEntry
enum. - Vacant
Entry Ref - A view into a vacant entry in a
HashMap
. It is part of theEntryRef
enum. - Values
- An iterator over the values of a
HashMap
in arbitrary order. The iterator element type is&'a V
. - Values
Mut - A mutable iterator over the values of a
HashMap
in arbitrary order. The iterator element type is&'a mut V
.