Struct LeafRange
pub(in ::collections::btree) struct LeafRange<BorrowType, K, V> { pub(in ::collections::btree::navigate) front: Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>, pub(in ::collections::btree::navigate) 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<'a, K, V> LeafRange<Immut<'a>, K, V>
fn next_checked(&mut self) -> Option<(&'a K, &'a V)>fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)>
impl<'a, K, V> LeafRange<ValMut<'a>, K, V>
fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)>fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)>
impl<BorrowType, K, V> LeafRange<BorrowType, K, V>
fn none() -> Selffn is_empty(&self) -> boolfn reborrow(&self) -> LeafRange<Immut<'_>, K, V>Temporarily takes out another, immutable equivalent of the same range.
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
impl<B, K, V> Default for LeafRange<B, K, V>
fn default() -> Self
Auto Trait Implementations
impl<BorrowType, K, V> Freeze for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: Freeze + Freeze,
impl<BorrowType, K, V> RefUnwindSafe for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: RefUnwindSafe + RefUnwindSafe,
impl<BorrowType, K, V> Send for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: Send + Send,
impl<BorrowType, K, V> Sync for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: Sync + Sync,
impl<BorrowType, K, V> Unpin for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: Unpin + Unpin,
impl<BorrowType, K, V> UnsafeUnpin for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: UnsafeUnpin + UnsafeUnpin,
impl<BorrowType, K, V> UnwindSafe for LeafRange<BorrowType, K, V>
where
Option<Handle<NodeRef<BorrowType, K, V, Leaf>, Edge>>: UnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for LeafRange<BorrowType, K, V>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for LeafRange<BorrowType, K, V>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for LeafRange<BorrowType, K, V>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for LeafRange<BorrowType, K, V>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for LeafRange<BorrowType, K, V>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> SizeHint for LeafRange<BorrowType, K, V>
where
T: ?Sized,
fn lower_bound(&self) -> usizefn upper_bound(&self) -> Option<usize>
impl<T> SizedTypeProperties for LeafRange<BorrowType, K, V>
impl<T> ToOwned for LeafRange<BorrowType, K, V>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for LeafRange<BorrowType, K, V>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for LeafRange<BorrowType, K, V>
where
U: Into<T>,
type Error = Infallible;fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for LeafRange<BorrowType, K, V>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>