Struct VecMap 

pub struct VecMap<K, V>(Vec<(K, V)>);

A small map backed by an unsorted vector.

Maintains key uniqueness at cost of O(n) lookup/insert/remove. Maintains insertion order (insert calls that overwrite an existing value don’t change order).

Tuple Fields

0: Vec<(K, V)>

Implementations

impl<K: Eq, V> VecMap<K, V>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

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

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

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

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

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

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

pub fn values(&self) -> impl Iterator<Item = &V>

Trait Implementations

impl<K: Clone, V: Clone> Clone for VecMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Default, V: Default> Default for VecMap<K, V>

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

Returns the “default value” for a type.