Struct StackMap

pub struct StackMap<K, V>
where
    K: PartialEq,
{
    pub keys: Vec<K>,
    pub value: Vec<V>,
}

Keys keep the order they’re added in.

Fields

keys: Vec<K>

value: Vec<V>

Implementations

impl<K, V> StackMap<K, V>

where K: PartialEq,

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

Constructs a new StackMap.

impl<K, V> StackMap<K, V>

where K: PartialEq, V: Default,

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

• get a mutable reference to the value of a key
• not in map? insert default value before returning

impl<K, V> StackMap<K, V>

where K: PartialEq,

pub fn key_idx(&self, key: &K) -> Option<usize>

• Some(idx): index of requested key
• None: not part of the map

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

read-only reference iterator

pub fn into_iter(self) -> Zip<IntoIter<K>, IntoIter<V>>

consuming iterator

pub fn is_empty(&self) -> bool

true if empty

Trait Implementations

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

where K: PartialEq, V: Default,

fn default() -> StackMap<K, V>

Returns the “default value” for a type.