Trait BTreeMapExt

pub trait BTreeMapExt<K, V>
where
    K: Ord,
{
    // Required methods
    fn first(&self) -> Option<(&K, &V)>;
    fn last(&self) -> Option<(&K, &V)>;
    fn get_next(&self, key: &K) -> Option<(&K, &V)>;
    fn get_next_excluded(&self, key: &K) -> Option<(&K, &V)>;
    fn get_next_back(&self, key: &K) -> Option<(&K, &V)>;
    fn get_next_back_excluded(&self, key: &K) -> Option<(&K, &V)>;
    fn first_mut(&mut self) -> Option<(&K, &mut V)>;
    fn last_mut(&mut self) -> Option<(&K, &mut V)>;
    fn get_next_mut(&mut self, key: &K) -> Option<(&K, &mut V)>;
    fn get_next_excluded_mut(&mut self, key: &K) -> Option<(&K, &mut V)>;
    fn get_next_back_mut(&mut self, key: &K) -> Option<(&K, &mut V)>;
    fn get_next_back_excluded_mut(&mut self, key: &K) -> Option<(&K, &mut V)>;
    fn pop_first(&mut self) -> Option<(K, V)>
       where K: Clone;
    fn pop_last(&mut self) -> Option<(K, V)>
       where K: Clone;
    fn pop_next(&mut self, key: &K) -> Option<(K, V)>
       where K: Clone;
    fn pop_next_excluded(&mut self, key: &K) -> Option<(K, V)>
       where K: Clone;
    fn pop_next_back(&mut self, key: &K) -> Option<(K, V)>
       where K: Clone;
    fn pop_next_back_excluded(&mut self, key: &K) -> Option<(K, V)>
       where K: Clone;
    fn pop_first_if<P>(&mut self, pred: P) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
    fn pop_last_if<P>(&mut self, pred: P) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
    fn pop_next_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
    fn pop_next_excluded_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
    fn pop_next_back_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
    fn pop_next_back_excluded_if<P>(
        &mut self,
        key: &K,
        pred: P,
    ) -> Option<(K, V)>
       where K: Clone,
             P: FnMut(&K, &V) -> bool;
}

Required Methods

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

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

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

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

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

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

fn first_mut(&mut self) -> Option<(&K, &mut V)>

fn last_mut(&mut self) -> Option<(&K, &mut V)>

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

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

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

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

fn pop_first(&mut self) -> Option<(K, V)>

where K: Clone,

fn pop_last(&mut self) -> Option<(K, V)>

where K: Clone,

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

where K: Clone,

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

where K: Clone,

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

where K: Clone,

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

where K: Clone,

fn pop_first_if<P>(&mut self, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_last_if<P>(&mut self, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_excluded_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_back_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_back_excluded_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<K, V> BTreeMapExt<K, V> for BTreeMap<K, V>

where K: Ord,

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

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

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

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

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

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

fn first_mut(&mut self) -> Option<(&K, &mut V)>

fn last_mut(&mut self) -> Option<(&K, &mut V)>

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

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

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

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

fn pop_first(&mut self) -> Option<(K, V)>

where K: Clone,

fn pop_last(&mut self) -> Option<(K, V)>

where K: Clone,

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

where K: Clone,

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

where K: Clone,

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

where K: Clone,

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

where K: Clone,

fn pop_first_if<P>(&mut self, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_last_if<P>(&mut self, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_excluded_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_back_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

fn pop_next_back_excluded_if<P>(&mut self, key: &K, pred: P) -> Option<(K, V)>

where K: Clone, P: FnMut(&K, &V) -> bool,

Implementors