Module sgx_tstd::collections::hash_map
source · Expand description
A hash map implemented with quadratic probing and SIMD lookup.
Structs
- The default
Hasher
used byRandomState
. - A draining iterator over the entries of a
HashMap
. - A draining, filtering iterator over the entries of a
HashMap
. - A hash map implemented with quadratic probing and SIMD lookup.
- An owning iterator over the entries of a
HashMap
. - An owning iterator over the keys of a
HashMap
. - An owning iterator over the values of a
HashMap
. - An iterator over the entries of a
HashMap
. - A mutable iterator over the entries of a
HashMap
. - An iterator over the keys of a
HashMap
. - A view into an occupied entry in a
HashMap
. It is part of theEntry
enum. - The error returned by
try_insert
when the key already exists. RandomState
is the default state forHashMap
types.- A builder for computing where in a HashMap a key-value pair would be stored.
- A builder for computing where in a HashMap a key-value pair would be stored.
- A view into an occupied entry in a
HashMap
. It is part of theRawEntryMut
enum. - A view into a vacant entry in a
HashMap
. It is part of theRawEntryMut
enum. - A view into a vacant entry in a
HashMap
. It is part of theEntry
enum. - An iterator over the values of a
HashMap
. - A mutable iterator over the values of a
HashMap
.
Enums
- A 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.