Struct ordered_vecmap::OrderedVecMap

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

Implementations

impl<K, V> OrderedVecMap<K, V>

pub const fn new() -> Self

pub fn from_vec(kv: Vec<(K, V)>) -> Self where
    K: Ord, 

pub fn keys_slice(&self) -> &[K]

pub fn values_slice(&self) -> &[V]

pub fn contains_key<Q>(&self, key: &Q) -> bool where
    K: Borrow<Q> + Ord,
    Q: Ord + ?Sized, 

Performs a binary search

pub fn get<Q>(&self, key: &Q) -> Option<&V> where
    K: Borrow<Q> + Ord,
    Q: Ord + ?Sized, 

Performs a binary search

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V> where
    K: Borrow<Q> + Ord,
    Q: Ord + ?Sized, 

pub fn remove<Q>(&mut self, key: &Q) -> Option<V> where
    K: Borrow<Q> + Ord,
    Q: Ord + ?Sized, 

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

Trait Implementations

impl<K: Ord, V> FromIterator<(K, V)> for OrderedVecMap<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<'a, K, V> IntoIterator for &'a OrderedVecMap<K, V>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.