Struct ChainingHashTable

pub struct ChainingHashTable<K, V> { /* private fields */ }

Implementations

impl<K: Hash + Debug + PartialEq, V: PartialEq + Clone> ChainingHashTable<K, V>

pub fn new() -> ChainingHashTable<K, V>

Creates a new HashTable

pub fn size(&self) -> usize

Returns the number of elements in the HashTable

pub fn is_empty(&self) -> bool

Returns a Boolean indicating whether the HashTable is empty

pub fn get(&self, key: K) -> Option<&V>

Returns the value v associated with key k

pub fn put(&mut self, key: K, value: V)

Adds entry (k, v), overwriting any value v associated with an existing key k, returns old value. Resizes the map which the table encounters a load factor >.75.

pub fn remove(&mut self, key: K)

Removes the entry (k, v) associated with key k

pub fn key_set(&self) -> Vec<&K>

Returns an iterable collection of all keys in the map

pub fn values(&self) -> Vec<&V>

Returns an iterable collection of all values in the map, including repeats for multiple key-value associations

pub fn entry_set(&self) -> Vec<&Entry<K, V>>

Returns an iterable collection of all (k, v) entries in the map

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

Returns a Boolean if the map contains key k; Used to disambiguate the presence of a key with a null/None value

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

A function that follows the naming convention for iterable collections; Returns struct Iter that tracks iteration state

Trait Implementations

impl<K: Debug, V: Debug> Debug for ChainingHashTable<K, V>

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

Formats the value using the given formatter.

impl<K: Hash + Debug + PartialEq, V: PartialEq + Clone> Default for ChainingHashTable<K, V>

fn default() -> Self

Returns the “default value” for a type.