Struct HashMap 

pub struct HashMap<K: Hashable + Eq + Clone, V: Clone> { /* private fields */ }

Implementations

impl<K: Hashable + Eq + Clone, V: Clone> HashMap<K, V>

pub fn empty() -> Self

create and return a new empty map

pub fn insert(&self, k: K, v: V) -> Self

create and return a new map containing the new key, value pair

pub fn remove(&self, k: K) -> Self

create and return a new map with the key, value pair removed

pub fn exist(&self, k: &K) -> bool

search for a key and return true if the key exist, false otherwise

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

search for a key and return a pointer to the value if the key exists, None otherwise

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

walk the list/stack and build a vector of keys and return it

pub fn is_empty(&self) -> bool

return the number of elements in the set

pub fn len(&self) -> usize

return the number of elements in the set

pub fn iter<'a>(&self) -> HMIter<'a, K, V>

returns an iterator

Trait Implementations

impl<K: Clone + Hashable + Eq + Clone, V: Clone + Clone> Clone for HashMap<K, V>

fn clone(&self) -> HashMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.