Struct alloc::collections::btree::map::ExtractIfInner
source · 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>>,
}
Expand description
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§
source§impl<'a, K, V> ExtractIfInner<'a, K, V>
impl<'a, K, V> ExtractIfInner<'a, K, V>
sourcepub(super) fn peek(&self) -> Option<(&K, &V)>
pub(super) fn peek(&self) -> Option<(&K, &V)>
Allow Debug implementations to predict the next element.
Auto Trait Implementations§
impl<'a, K, V> RefUnwindSafe for ExtractIfInner<'a, K, V>where K: RefUnwindSafe, V: RefUnwindSafe,
impl<'a, K, V> Send for ExtractIfInner<'a, K, V>where K: Send, V: Send,
impl<'a, K, V> Sync for ExtractIfInner<'a, K, V>where K: Sync, V: Sync,
impl<'a, K, V> Unpin for ExtractIfInner<'a, K, V>
impl<'a, K, V> !UnwindSafe for ExtractIfInner<'a, K, V>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more