Struct rehashinghashmap::RehashingHashMap

pub struct RehashingHashMap<K: Eq + Hash, V> { /* fields omitted */ }

Methods

impl<K, V> RehashingHashMap<K, V> where
    K: Eq + Hash + Clone, 

fn new() -> RehashingHashMap<K, V>

fn with_capacity(capacity: usize) -> RehashingHashMap<K, V>

fn rehash(&mut self)

fn capacity(&self) -> usize

fn reserve(&mut self, additional: usize)

fn is_rehashing(&self) -> bool

fn shrink_to_fit(&mut self)

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn clear(&mut self)

fn insert(&mut self, k: K, v: V) -> Option<V>

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

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

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

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

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

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

fn iter_mut(&mut self) -> IterMut<K, V>

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

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

Trait Implementations

impl<K: Debug + Eq + Hash, V: Debug> Debug for RehashingHashMap<K, V>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: Default + Eq + Hash, V: Default> Default for RehashingHashMap<K, V>

fn default() -> RehashingHashMap<K, V>

Returns the "default value" for a type.

impl<K, V> PartialEq for RehashingHashMap<K, V> where
    K: Eq + Hash + Clone,
    V: PartialEq, 

fn eq(&self, other: &RehashingHashMap<K, V>) -> 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<'a, K, Q: ?Sized, V> Index<&'a Q> for RehashingHashMap<K, V> where
    K: Eq + Hash + Clone + Borrow<Q>,
    Q: Eq + Hash, 

type Output = V

The returned type after indexing

fn index(&self, index: &Q) -> &V

The method for the indexing (container[index]) operation

impl<'a, K, V> IntoIterator for &'a RehashingHashMap<K, V> where
    K: Eq + Hash + Clone, 

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl<'a, K, V> IntoIterator for &'a mut RehashingHashMap<K, V> where
    K: Eq + Hash + Clone, 

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl<K, V> FromIterator<(K, V)> for RehashingHashMap<K, V> where
    K: Eq + Hash + Clone, 

fn from_iter<T: IntoIterator<Item = (K, V)>>(
    iterable: T
) -> RehashingHashMap<K, V>

Creates a value from an iterator.

impl<K, V> Extend<(K, V)> for RehashingHashMap<K, V> where
    K: Eq + Hash + Clone, 

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

Extends a collection with the contents of an iterator.