Struct alloc::collections::btree::navigate::LeafRange

pub struct LeafRange<BorrowType, K, V> {
    front: Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>,
    back: Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>,
}

Fields

front: Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>

back: Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>

Implementations

impl<BorrowType, K, V> LeafRange<BorrowType, K, V>

pub fn none() -> Self

fn is_empty(&self) -> bool

pub fn reborrow(&self) -> LeafRange<Immut<'_>, K, V>

Temporarily takes out another, immutable equivalent of the same range.

impl<'a, K, V> LeafRange<Immut<'a>, K, V>

pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)>

pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)>

impl<'a, K, V> LeafRange<ValMut<'a>, K, V>

pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)>

pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)>

impl<BorrowType: BorrowType, K, V> LeafRange<BorrowType, K, V>

fn perform_next_checked<F, R>(&mut self, f: F) -> Option<R>where F: Fn(&Handle<NodeRef<BorrowType, K, V, LeafOrInternal>, KV>) -> R,

If possible, extract some result from the following KV and move to the edge beyond it.

fn perform_next_back_checked<F, R>(&mut self, f: F) -> Option<R>where F: Fn(&Handle<NodeRef<BorrowType, K, V, LeafOrInternal>, KV>) -> R,

If possible, extract some result from the preceding KV and move to the edge beyond it.

Trait Implementations

impl<'a, K: 'a, V: 'a> Clone for LeafRange<Immut<'a>, K, V>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<B, K, V> Default for LeafRange<B, K, V>

fn default() -> Self

Returns the “default value” for a type.