Struct ExtractIfInner

pub(super) struct ExtractIfInner<'a, K, V> {
    length: &'a mut usize,
    dormant_root: Option<DormantMutRef<'a, NodeRef<Owned, K, V, LeafOrInternal>>>,
    cur_leaf_edge: Option<Handle<NodeRef<Mut<'a>, K, V, Leaf>, Edge>>,
}

Most of the implementation of ExtractIf are generic over the type of the predicate, thus also serving for BTreeSet::ExtractIf.

Fields

length: &'a mut usize

Reference to the length field in the borrowed map, updated live.

dormant_root: Option<DormantMutRef<'a, NodeRef<Owned, K, V, LeafOrInternal>>>

Buried reference to the root field in the borrowed map. Wrapped in Option to allow drop handler to take it.

cur_leaf_edge: Option<Handle<NodeRef<Mut<'a>, K, V, Leaf>, Edge>>

Contains a leaf edge preceding the next element to be returned, or the last leaf edge. Empty if the map has no root, if iteration went beyond the last leaf edge, or if a panic occurred in the predicate.

Implementations

impl<'a, K, V> ExtractIfInner<'a, K, V>

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

Allow Debug implementations to predict the next element.

pub(super) fn next<F, A: Allocator + Clone>( &mut self, pred: &mut F, alloc: A, ) -> Option<(K, V)>

where F: FnMut(&K, &mut V) -> bool,

Implementation of a typical ExtractIf::next method, given the predicate.

pub(super) fn size_hint(&self) -> (usize, Option<usize>)

Implementation of a typical ExtractIf::size_hint method.