# Module std::collections::hash_map 1.0.0 [−] [src]

A hash map implementation which uses linear probing with Robin Hood bucket stealing.

## Structs

DefaultHasher | The default `Hasher` used by `RandomState`.
Drain | HashMap drain iterator.
HashMap | A hash map implementation which uses linear probing with Robin Hood bucket stealing.
IntoIter | HashMap move iterator.
Iter | HashMap iterator.
IterMut | HashMap mutable values iterator.
Keys | HashMap keys iterator.
OccupiedEntry | A view into a single occupied location in a HashMap. It is part of the `Entry` enum.
RandomState | `RandomState` is the default state for `HashMap` types.
VacantEntry | A view into a single empty location in a HashMap. It is part of the `Entry` enum.
Values | HashMap values iterator.
ValuesMut | Mutable HashMap values iterator.

## Enums

Entry | A view into a single location in a map, which may be vacant or occupied. This enum is constructed from the `entry` method on `HashMap`.

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)