Struct SortedVecMap 

pub struct SortedVecMap<K: Ord, V> { /* private fields */ }

Implementations

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

pub fn new() -> Self

pub fn with_capacity(cap: usize) -> Self

pub fn from_sorted_unique(entries: Vec<(K, V)>) -> Self

Construct from a vector that the caller asserts is sorted by K and contains no duplicates. Debug-build asserts both invariants; release builds trust the caller.

pub fn from_iter_unsorted<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

where K: Clone,

Construct from any iterator. Sorts and dedups (last value wins).

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

O(log n) lookup. Full key equality on hit (binary search returns the exact match index).

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

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

Insert or update. O(n) worst case (shift). Returns previous value on update.

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

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)> + '_

Iterate (&K, &V) pairs sorted by K. Canonical order.

pub fn range<Q>( &self, start: &Q, end: &Q, ) -> impl Iterator<Item = (&K, &V)> + '_

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

Range iteration. [start, end).

Trait Implementations

impl<K: Clone + Ord, V: Clone> Clone for SortedVecMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord, V: Debug> Debug for SortedVecMap<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: Ord, V> Default for SortedVecMap<K, V>

fn default() -> Self

Returns the “default value” for a type.