On this page
Module std::collections::hash_map
A hash map implemented with quadratic probing and SIMD lookup.
Structs
-
ExtractIfExperimentalA draining, filtering iterator over the entries of a
HashMap. -
OccupiedErrorExperimentalThe error returned by
try_insertwhen the key already exists. -
RawEntryBuilderExperimentalA builder for computing where in a HashMap a key-value pair would be stored.
-
RawEntryBuilderMutExperimentalA builder for computing where in a HashMap a key-value pair would be stored.
-
RawOccupiedEntryMutExperimentalA view into an occupied entry in a
HashMap. It is part of theRawEntryMutenum. -
RawVacantEntryMutExperimentalA view into a vacant entry in a
HashMap. It is part of theRawEntryMutenum. -
The default
Hasherused byRandomState. -
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 theEntryenum. -
RandomStateis the default state forHashMaptypes. -
A view into a vacant entry in a
HashMap. It is part of theEntryenum. -
An iterator over the values of a
HashMap. -
A mutable iterator over the values of a
HashMap.
Enums
-
RawEntryMutExperimentalA 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