Struct rs_graph::collections::ItemVecMap

pub struct ItemVecMap<'a, I, V> { /* fields omitted */ }

A thin wrapper around a ItemVec<_, Option<V>>.

Such a vector can be used as ItemMap<_, V> with a field being None if and only if the corresponding key is not contained in the map.

Implementations

impl<'a, I, V> ItemVecMap<'a, I, V> where
    I: Indexer, 

pub fn new_empty(vec: &'a mut ItemVec<I, Option<V>>) -> Self

Trait Implementations

impl<'a, I, V> ItemMap<<I as Indexer>::Idx, V> for ItemVecMap<'a, I, V> where
    I: Indexer,
    I::Idx: Copy, 

fn is_empty(&self) -> bool

Return true if this map is empty.

fn len(&self) -> usize

Return the number of items in this map.

fn clear(&mut self)

Remove all items from the map.

fn insert(&mut self, key: I::Idx, value: V) -> bool

Add one item to the map.

fn insert_or_replace(&mut self, key: I::Idx, value: V) -> bool

Add one item to the map.

fn remove(&mut self, key: I::Idx) -> bool

Remove one item from the map.

fn get(&self, key: I::Idx) -> Option<&V>

Return a read-only reference to the element with the given key.

fn get_mut(&mut self, key: I::Idx) -> Option<&mut V>

Return a mutable reference to the element with the given key.

fn contains(&self, key: I::Idx) -> bool

Return true iff item u is contained in this map.