Struct hash_table::HashTable

pub struct HashTable<K: Eq + Hash, T, Hs: IndexMut<usize, Output = usize> + Index<RangeFull, Output = [usize]>, Es: IndexMut<usize, Output = Slot<(K, T)>>, H: Clone + Hasher = DefaultHasher> { /* fields omitted */ }

Methods

impl<K: Eq + Hash, T, Hs: IndexMut<usize, Output = usize> + Index<RangeFull, Output = [usize]>, Es: IndexMut<usize, Output = Slot<(K, T)>>, H: Clone + Hasher> HashTable<K, T, Hs, Es, H>

fn from_parts(hashes: Hs, elems: Es, hasher: H) -> Self

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

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

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

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

fn insert_with<F: FnOnce(Option<T>) -> T>(
    &mut self,
    k: K,
    f: F
) -> Result<(usize, &K, &mut T), (K, F)>

fn insert_with_ix(&mut self, k: K, x: T) -> Result<(usize, Option<T>), (K, T)>

fn insert(&mut self, k: K, x: T) -> Result<Option<T>, (K, T)>

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

fn iter_with_ix(&self) -> IterWithIx<K, T>

fn iter_mut_with_ix(&mut self) -> IterMutWithIx<K, T>

fn hasher(&self) -> &H

Trait Implementations

impl<K: Eq + Hash, T, Hs: IndexMut<usize, Output = usize> + Index<RangeFull, Output = [usize]>, Es: IndexMut<usize, Output = Slot<(K, T)>>, H: Clone + Hasher> Drop for HashTable<K, T, Hs, Es, H>

fn drop(&mut self)

Executes the destructor for this type.