Struct network_collections::BoundedHashMap

pub struct BoundedHashMap<K: Hash + Eq, V> { /* fields omitted */ }

A bounded hash map, very similar to a regular Rust HashMap but can not become larger than its maximum capacity (plus one); ideal for indexes of network connections, etc in resource constraint aware environments.

Methods

impl<K: Hash + Eq, V> BoundedHashMap<K, V>

pub fn new(maximum_capacity: usize) -> Self

Creates a new instance.

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

Identical to HashMap.

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

Identical to HashMap.

pub fn len(&self) -> usize

Identical to HashMap.

pub fn is_full(&self) -> bool

Is this map full?

pub fn is_over_filled(&self) -> bool

Is this map over-full? False if just full.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

pub fn insert_uniquely_and_return_mutable_reference(     &mut self,     key: K,     value: V ) -> &mut V

Inserts a value once, returning a mutable reference to it.

pub fn insert(&mut self, key: K, value: V) -> Option<V>

Identical to HashMap.

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

Identical to HashMap.

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

Identical to HashMap.

Trait Implementations

impl<K: Debug + Hash + Eq, V: Debug> Debug for BoundedHashMap<K, V>

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

Formats the value using the given formatter.