Struct QueueHashMap 

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

Implementations

impl<K, V> QueueHashMap<K, V>

where K: PartialEq + Eq + Hash,

pub fn iter(&self) -> impl Iterator<Item = &(K, V)>

pub fn iter_idx(&self) -> impl Iterator<Item = usize>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn pop_front(&mut self) -> Option<(K, V)>

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

pub fn get_idx(&self, idx: usize) -> Option<&(K, V)>

pub fn get_mut_or_insert(&mut self, key: K, default: V) -> (&mut V, bool)

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

Trait Implementations

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

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

Formats the value using the given formatter.

impl<K, V> Default for QueueHashMap<K, V>

fn default() -> Self

Returns the “default value” for a type.