A draining iterator over the entries of a HashMap
in arbitrary
order. The iterator element type is (K, V)
.
A draining iterator over entries of a HashMap
which don’t satisfy the predicate
f(&k, &mut v)
in arbitrary order. The iterator element type is (K, V)
.
A hash map implemented with quadratic probing and SIMD lookup.
An owning iterator over the entries of a HashMap
in arbitrary order.
The iterator element type is (K, V)
.
An owning iterator over the keys of a HashMap
in arbitrary order.
The iterator element type is K
.
An owning iterator over the values of a HashMap
in arbitrary order.
The iterator element type is V
.
An iterator over the entries of a HashMap
in arbitrary order.
The iterator element type is (&'a K, &'a V)
.
A mutable iterator over the entries of a HashMap
in arbitrary order.
The iterator element type is (&'a K, &'a mut V)
.
An iterator over the keys of a HashMap
in arbitrary order.
The iterator element type is &'a K
.
A view into an occupied entry in a
HashMap
.
It is part of the
Entry
enum.
A view into an occupied entry in a
HashMap
.
It is part of the
EntryRef
enum.
The error returned by
try_insert
when the key already exists.
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 the
RawEntryMut
enum.
A view into a vacant entry in a
HashMap
.
It is part of the
RawEntryMut
enum.
A view into a vacant entry in a
HashMap
.
It is part of the
Entry
enum.
A view into a vacant entry in a
HashMap
.
It is part of the
EntryRef
enum.
An iterator over the values of a HashMap
in arbitrary order.
The iterator element type is &'a V
.
A mutable iterator over the values of a HashMap
in arbitrary order.
The iterator element type is &'a mut V
.