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

Reexports

use core::prelude::v1::*;

use self::Entry::*;

use self::SearchResult::*;

use self::VacantEntryState::*;

use borrow::Borrow;

use clone::Clone;

use cmp::{max, Eq, PartialEq};

use default::Default;

use fmt::{self, Debug};

use hash::{Hash, SipHasher};

use iter::{self, Iterator, ExactSizeIterator, IntoIterator, FromIterator, Extend, Map};

use marker::Sized;

use mem::{self, replace};

use ops::{Deref, FnMut, FnOnce, Index};

use option::Option::{self, Some, None};

use rand::{Rng, SeedableRng};

use self::raw_table::{Bucket, EmptyBucket, FullBucket, FullBucketImm, FullBucketMut, RawTable, SafeHash};

use self::raw_table::BucketState::{Empty, Full};

use super::hash_state::HashState;

DefaultResizePolicy	The default behavior of HashMap implements a load factor of 90.9%. This behavior is characterized by the following condition:
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.
RandomState	`RandomState` is the default state for `HashMap` types.
VacantEntry	A view into a single empty location in a HashMap.
Values	HashMap values iterator.

Entry	A view into a single location in a map, which may be vacant or occupied.
SearchResult	A result that works like Option> but preserves the reference that grants us access to the table in any case.
VacantEntryState	Possible states of a VacantEntry.

INITIAL_CAPACITY
INITIAL_LOG2_CAP

pop_internal
robin_hood	Perform robin hood bucket stealing at the given `bucket`. You must also pass the position of that bucket's initial bucket so we don't have to recalculate it.
search_entry_hashed
search_hashed	Search for a pre-hashed key.