Struct HashTable 

pub struct HashTable<T: HTEntry> { /* private fields */ }

Implementations

impl<T: HTFromKey> HashTable<T>

pub fn get_mut(&mut self, key: &T::Key) -> &mut T

Returns a mutable reference to the value corresponding to the key. If the key is not present in the table, it is inserted with a default value.

pub fn ensure(&mut self, key: &T::Key)

Ensures a value for the key by inserting the default value if it is not present.

impl<T: HTEntry> HashTable<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn has<K>(&self, key: &K) -> bool

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

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

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

Finds a reference to the value corresponding to the key or returns None if the key is not present in the table.

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

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

Finds a mutable reference to the value corresponding to the key or returns None if the key is not present in the table.

pub fn insert(&mut self, item: T)

pub fn extract_if<'a, F>(&'a mut self, f: F) -> impl Iterator<Item = T> + 'a

where F: FnMut(&mut T) -> bool + 'a,

pub fn remove<K>(&mut self, key: &K) -> Option<T>

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

pub fn find_entry<K>( &mut self, key: &K, ) -> Result<OccupiedEntry<'_, T>, AbsentEntry<'_, T>>

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

pub fn entry<K>(&mut self, key: &K) -> Entry<'_, T>

where T::Key: Borrow<K> + PartialEq<K>, K: Hash + Eq + ?Sized,

pub fn iter(&self) -> Iter<'_, T>

pub fn iter_mut(&mut self) -> IterMut<'_, T>

pub fn first_key(&self) -> Option<T::Key>

Trait Implementations

impl<T: Clone + HTEntry> Clone for HashTable<T>

fn clone(&self) -> HashTable<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + HTEntry> Debug for HashTable<T>

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

Formats the value using the given formatter.

impl<T: HTEntry> Default for HashTable<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T: HTEntry> IntoIterator for &'a HashTable<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T: HTEntry> IntoIterator for &'a mut HashTable<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: HTEntry> IntoIterator for HashTable<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<<HashTable<T> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.