Module std::collections::hash_map
A hash map implemented with quadratic probing and SIMD lookup.
Structs
A draining, filtering iterator over the entries of a HashMap
.
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.
The default Hasher
used by RandomState
.
A draining 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 the Entry
enum.
RandomState
is the default state for HashMap
types.
A view into a vacant entry in a HashMap
. It is part of the Entry
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.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/collections/hash_map/index.html