Struct containers::collections::HashTable

pub struct HashTable<K: Eq + Hash, T, H: Clone + Hasher = DefaultHasher, A: Alloc = NullAllocator> { /* fields omitted */ }

Methods

impl<K: Eq + Hash, T, H: Clone + Hasher, A: Alloc + Default> HashTable<K, T, H, A>

pub fn new(log_cap: u32, hasher: H) -> Option<Self>

impl<K: Eq + Hash, T, H: Clone + Hasher, A: Alloc> HashTable<K, T, H, A>

pub fn new_in(a: A, log_cap: u32, hasher: H) -> Option<Self>

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

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

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

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

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

pub fn grow(&mut self) -> bool

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: ?Sized>(&mut self, k: &Q) -> Option<T> where     K: Borrow<Q>,     Q: Eq + Hash,

Important traits for IterWithIx<'a, K, T>

impl<'a, K, T> Iterator for IterWithIx<'a, K, T> where
    K: 'a,
    T: 'a,  type Item = (usize, &'a K, &'a T);

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

Important traits for IterMutWithIx<'a, K, T>

impl<'a, K, T> Iterator for IterMutWithIx<'a, K, T> where
    K: 'a,
    T: 'a,  type Item = (usize, &'a K, &'a mut T);

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

Trait Implementations

impl<K: Send + Eq + Hash, T: Send, H: Send + Clone + Hasher, A: Alloc + Send> Send for HashTable<K, T, H, A>

impl<K: Sync + Eq + Hash, T: Sync, H: Sync + Clone + Hasher, A: Alloc + Sync> Sync for HashTable<K, T, H, A>

impl<K: Debug + Eq + Hash, T: Debug, H: Clone + Hasher, A: Alloc> Debug for HashTable<K, T, H, A>

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

Formats the value using the given formatter.

impl<K: Eq + Hash, T, H: Clone + Hasher, A: Alloc> Drop for HashTable<K, T, H, A>

fn drop(&mut self)

Executes the destructor for this type.