Struct hash_ord::hash_map::HashMap

pub struct HashMap<K, V, S = RandomState> { /* fields omitted */ }

Methods

impl<K, V, S> HashMap<K, V, S>

pub fn clear(&mut self)

pub fn capacity(&self) -> usize

pub fn get_max_node_of_single_index(&self) -> i32

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Important traits for Keys<'a, K, V, S>

impl<'a, K, V, S> Iterator for Keys<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = &'a K;

pub fn keys(&self) -> Keys<K, V, S>

Important traits for Values<'a, K, V, S>

impl<'a, K, V, S> Iterator for Values<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = &'a V;

pub fn values(&self) -> Values<K, V, S>

Important traits for ValuesMut<'a, K, V, S>

impl<'a, K, V, S> Iterator for ValuesMut<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = &'a mut V;

pub fn values_mut(&mut self) -> ValuesMut<K, V, S>

Important traits for Iter<'a, K, V, S>

impl<'a, K, V, S> Iterator for Iter<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = (&'a K, &'a V);

pub fn iter(&self) -> Iter<K, V, S>

impl<K, V, S> HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher, 

pub fn entry(&mut self, key: K) -> Entry<K, V, S>

pub fn with_hasher(hash_builder: S) -> Self

pub fn get<Q: ?Sized>(&self, q: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Hash + Ord, 

pub fn get_mut<Q: ?Sized>(&mut self, q: &Q) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Hash + Ord, 

pub fn reserve(&mut self, capacity: usize)

pub fn contains_key<Q: ?Sized>(&self, q: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Ord, 

pub fn insert(&mut self, key: K, value: V) -> Option<(K, V)>

pub fn remove<Q: ?Sized>(&mut self, q: &Q) -> Option<(K, V)> where
    K: Borrow<Q>,
    Q: Hash + Ord, 

pub fn with_capacity_and_hasher(
    capacity: usize,
    hash_builder: S
) -> HashMap<K, V, S>

pub fn shrink_to_fit(&mut self)

impl<K, V> HashMap<K, V, RandomState> where
    K: Hash + Ord, 

pub fn new() -> HashMap<K, V, RandomState>

pub fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState>

Trait Implementations

impl<K, V, S> Default for HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher + Default, 

fn default() -> HashMap<K, V, S>

Returns the "default value" for a type.

impl<K, V, S> Drop for HashMap<K, V, S>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, K, Q: ?Sized, V, S> Index<&'a Q> for HashMap<K, V, S> where
    Q: Hash + Ord,
    K: Hash + Ord + Borrow<Q>,
    S: BuildHasher, 

type Output = V

The returned type after indexing.

fn index(&self, q: &Q) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher, 

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where
    K: Ord + Hash + Copy,
    V: Copy,
    S: BuildHasher, 

fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher, 

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V, S>

Which kind of iterator are we turning this into?

Important traits for Iter<'a, K, V, S>

impl<'a, K, V, S> Iterator for Iter<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = (&'a K, &'a V);

fn into_iter(self) -> Iter<'a, K, V, S>

Creates an iterator from a value.

impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher, 

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, K, V, S>

Which kind of iterator are we turning this into?

Important traits for IterMut<'a, K, V, S>

impl<'a, K, V, S> Iterator for IterMut<'a, K, V, S> where
    K: 'a,
    V: 'a,
    S: 'a,  type Item = (&'a K, &'a mut V);

fn into_iter(self) -> IterMut<'a, K, V, S>

Creates an iterator from a value.

impl<K, V, S> IntoIterator for HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher, 

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V, S>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where
    K: Ord + Hash,
    S: BuildHasher + Default, 

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> HashMap<K, V, S>

Creates a value from an iterator.

impl<K, V, S> Clone for HashMap<K, V, S> where
    K: Ord + Hash + Clone,
    V: Clone,
    S: BuildHasher + Clone, 

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, V, S> PartialEq for HashMap<K, V, S> where
    K: Ord + Hash,
    V: PartialEq,
    S: BuildHasher, 

fn eq(&self, other: &HashMap<K, V, S>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<K, V, S> Eq for HashMap<K, V, S> where
    K: Ord + Hash,
    V: Eq,
    S: BuildHasher,