Struct TreeMap 

pub struct TreeMap<K, V>(/* private fields */)
where
    K: Clone + Ord,
    V: Clone;

A cheaply-cloneable ordered map based on a SumTree.

Implementations

impl<K: Clone + Ord, V: Clone> TreeMap<K, V>

pub fn from_ordered_entries(entries: impl IntoIterator<Item = (K, V)>) -> Self

pub fn is_empty(&self) -> bool

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

pub fn insert(&mut self, key: K, value: V)

pub fn extend(&mut self, iter: impl IntoIterator<Item = (K, V)>)

pub fn clear(&mut self)

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

pub fn remove_range( &mut self, start: &impl MapSeekTarget<K>, end: &impl MapSeekTarget<K>, )

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

Returns the key-value pair with the greatest key less than or equal to the given key.

pub fn iter_from<'a>( &'a self, from: &K, ) -> impl Iterator<Item = (&'a K, &'a V)> + 'a

pub fn update<F, T>(&mut self, key: &K, f: F) -> Option<T>

where F: FnOnce(&mut V) -> T,

pub fn retain<F: FnMut(&K, &V) -> bool>(&mut self, predicate: F)

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

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

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

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

pub fn insert_tree(&mut self, other: TreeMap<K, V>)

Trait Implementations

impl<K, V> Clone for TreeMap<K, V>

where K: Clone + Ord + Clone, V: Clone + Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for TreeMap<K, V>

where K: Clone + Debug + Ord, V: Clone + Debug,

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

Formats the value using the given formatter.

impl<K, V> Default for TreeMap<K, V>

where K: Clone + Ord, V: Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> PartialEq for TreeMap<K, V>

where K: Clone + Ord + PartialEq, V: Clone + PartialEq,

fn eq(&self, other: &TreeMap<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> Eq for TreeMap<K, V>

where K: Clone + Ord + Eq, V: Clone + Eq,

impl<K, V> StructuralPartialEq for TreeMap<K, V>

where K: Clone + Ord, V: Clone,