Struct HashTable

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

Implementations

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

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

pub fn find_with_ix<Q>(&self, k: &Q) -> Option<(usize, &K, &T)>

where K: Borrow<Q>, Q: Eq + Hash + ?Sized,

pub fn find_mut_with_ix<Q>(&mut self, k: &Q) -> Option<(usize, &K, &mut T)>

where K: Borrow<Q>, Q: Eq + Hash + ?Sized,

pub fn find<Q>(&self, k: &Q) -> Option<(&K, &T)>

where K: Borrow<Q>, Q: Eq + Hash + ?Sized,

pub fn find_mut<Q>(&mut self, k: &Q) -> Option<(&K, &mut T)>

where K: Borrow<Q>, Q: Eq + Hash + ?Sized,

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

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

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

pub fn delete<Q>(&mut self, k: &Q) -> Option<T>

where K: Borrow<Q>, Q: Eq + Hash + ?Sized,

pub fn drain(&mut self) -> Drain<'_, K, T>

pub fn drain_filter<F: FnMut(&K, &mut T) -> bool>( &mut self, f: F, ) -> DrainFilter<'_, K, T, F>

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

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

pub fn hasher(&self) -> &H

Trait Implementations

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

fn drop(&mut self)

Executes the destructor for this type.