Struct LazyLeafRange

pub(super) struct LazyLeafRange<BorrowType, K, V> {
    front: Option<LazyLeafHandle<BorrowType, K, V>>,
    back: Option<LazyLeafHandle<BorrowType, K, V>>,
}

Fields

front: Option<LazyLeafHandle<BorrowType, K, V>>

back: Option<LazyLeafHandle<BorrowType, K, V>>

Implementations

impl<BorrowType, K, V> LazyLeafRange<BorrowType, K, V>

pub(super) fn none() -> Self

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

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

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

pub(super) unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V)

pub(super) unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a V)

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

pub(super) unsafe fn next_unchecked(&mut self) -> (&'a K, &'a mut V)

pub(super) unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a mut V)

impl<K, V> LazyLeafRange<Dying, K, V>

fn take_front(&mut self) -> Option<Handle<NodeRef<Dying, K, V, Leaf>, Edge>>

pub(super) unsafe fn deallocating_next_unchecked<A: Allocator + Clone>( &mut self, alloc: A, ) -> Handle<NodeRef<Dying, K, V, LeafOrInternal>, KV>

pub(super) unsafe fn deallocating_next_back_unchecked<A: Allocator + Clone>( &mut self, alloc: A, ) -> Handle<NodeRef<Dying, K, V, LeafOrInternal>, KV>

pub(super) fn deallocating_end<A: Allocator + Clone>(&mut self, alloc: A)

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

fn init_front( &mut self, ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>

fn init_back( &mut self, ) -> Option<&mut Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>

Trait Implementations

impl<'a, K: 'a, V: 'a> Clone for LazyLeafRange<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 LazyLeafRange<B, K, V>

fn default() -> Self

Returns the “default value” for a type.