pub struct DummyBTreeMapOccupiedEntry<'c, K, V> { /* private fields */ }
Expand description
Occupied entry of a BTreeMap.
This entry can be used to read the key, mutate the value, or remove the key/value pair from the BTreeMap, without re-searching for the key.
Trait Implementations
sourceimpl<'c, K, V> EntryRemovableOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
impl<'c, K, V> EntryRemovableOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
type Vacant = DummyBTreeMapVacantEntry<'c, K, V>
fn recover_removed_entry(removed: Self::Removed) -> DummyBTreeMapEntry<'c, K, V>
sourceimpl<'c, K, V> KeyedOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
impl<'c, K, V> KeyedOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
type Key = K
type Key = K
the type of the keys in the collection
type BorrowedKey = &'c K
sourcefn get_pair<'e>(&'e self) -> (&'e Self::Key, &'e Self::Value) where
'c: 'e,
fn get_pair<'e>(&'e self) -> (&'e Self::Key, &'e Self::Value) where
'c: 'e,
get the key value pair, immutably borrowed
sourceimpl<'c, K, V> NextOccupiedFromOccupied<'c> for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Ord,
impl<'c, K, V> NextOccupiedFromOccupied<'c> for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Ord,
sourcefn get_next_occupied(self) -> Option<Self>
fn get_next_occupied(self) -> Option<Self>
get the next occupied entry after this one.
sourceimpl<'c, K, V> OccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
impl<'c, K, V> OccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
type Value = V
type Value = V
the type of the values in the collection
sourcefn get_value<'e>(&'e self) -> &'e Self::Value where
'c: 'e,
fn get_value<'e>(&'e self) -> &'e Self::Value where
'c: 'e,
get the value, immutably borrowed.
sourcefn get_value_mut<'e>(&'e mut self) -> &mut Self::Value where
'c: 'e,
fn get_value_mut<'e>(&'e mut self) -> &mut Self::Value where
'c: 'e,
get the value, mutably borrowed.
sourcefn into_value_mut<'e>(self) -> &'c mut Self::Value
fn into_value_mut<'e>(self) -> &'c mut Self::Value
convert the entry into a mutable to the value.
sourcefn replace_value<'e>(&'e mut self, value: Self::Value) -> Self::Value where
'c: 'e,
fn replace_value<'e>(&'e mut self, value: Self::Value) -> Self::Value where
'c: 'e,
replace the value in the entry, returning the old value.
sourceimpl<'c, K, V> PrevOccupiedFromOccupied<'c> for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Ord,
impl<'c, K, V> PrevOccupiedFromOccupied<'c> for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Ord,
sourcefn get_prev_occupied(self) -> Option<Self>
fn get_prev_occupied(self) -> Option<Self>
get the previous occupied entry after this one.
sourceimpl<'c, K, V> RemovableOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
impl<'c, K, V> RemovableOccupiedEntry<'c> for DummyBTreeMapOccupiedEntry<'c, K, V>
type Removed = DummyBTreeMapVacantEntry<'c, K, V>
type Removed = DummyBTreeMapVacantEntry<'c, K, V>
The type returned when removing the OccupiedEntry
sourcefn remove(self) -> (V, Self::Removed)
fn remove(self) -> (V, Self::Removed)
remove this entry from the collection, converting the entry into a Self::Removed and returning the value that was there. Read more
sourcefn remove_value(self) -> Self::Value
fn remove_value(self) -> Self::Value
remove this entry from the collection, consuming the entry and returning the value that was there. Read more
Auto Trait Implementations
impl<'c, K, V> RefUnwindSafe for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<'c, K, V> Send for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Send,
V: Send,
impl<'c, K, V> Sync for DummyBTreeMapOccupiedEntry<'c, K, V> where
K: Sync,
V: Sync,
impl<'c, K, V> Unpin for DummyBTreeMapOccupiedEntry<'c, K, V>
impl<'c, K, V> !UnwindSafe for DummyBTreeMapOccupiedEntry<'c, K, V>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more