Struct vesema::SortedMap

pub struct SortedMap<K: Ord, V> { /* fields omitted */ }

Methods

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

fn new() -> Self

fn with_capacity(size: usize) -> Self

fn from_vec(v: Vec<SortableKeyPair<K, V>>) -> Self

fn from_vec_unchecked(v: Vec<SortableKeyPair<K, V>>) -> Self

fn into_vec(self) -> Vec<SortableKeyPair<K, V>>

fn capacity(&self) -> usize

fn reserve(&mut self, additional: usize)

fn shrink_to_fit(&mut self)

fn iter(&self) -> Iter<SortableKeyPair<K, V>>

fn iter_mut(&mut self) -> IterMut<SortableKeyPair<K, V>>

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

fn first(&self) -> Option<&SortableKeyPair<K, V>>

fn last(&self) -> Option<&SortableKeyPair<K, V>>

fn binary_search(&self, k: &K) -> Result<usize, usize>

fn contains_key(&self, k: &K) -> bool

fn insert(&mut self, x: SortableKeyPair<K, V>) -> bool

fn remove(&mut self, k: &K) -> bool

fn remove_at(&mut self, idx: usize) -> SortableKeyPair<K, V>

fn clear(&mut self)

impl<K: Ord, V: PartialEq> SortedMap<K, V>

fn contains_value(&self, v: &V) -> bool

fn contains(&self, kv: &SortableKeyPair<K, V>) -> bool