Enum VariousMap 

pub enum VariousMap<K, V> {
    One(Option<(K, V)>),
    Multi(BTreeMap<K, V>),
}

A tempoary map optimise for empty or one condition, to delay allocation.

Initial to be Option<(K, V)>. If multi item inserted, transit from Option to std::collections::BTreeMap.

Variants

One(Option<(K, V)>)

Multi(BTreeMap<K, V>)

Implementations

impl<K: Ord, V> VariousMap<K, V>

pub fn new() -> Self

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

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

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

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

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

where K: Ord,

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

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Trait Implementations

impl<K, V> IntoIterator for VariousMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.