Struct in_place::dummy_collections::b_tree_map::DummyBTreeMapRawVacantEntry

pub struct DummyBTreeMapRawVacantEntry<'c, K, V> { /* private fields */ }

Raw vacant entry of a BTreeMap.

This is acquired from the get_raw_entry method, and can insert into the BTreeMap when provided a (K, V) tuple where K sorts the same as the query used to aquire this entry. Inserting with a (K, V) tuple gives a DummyBTreeMapOccupiedEntry

Trait Implementations

impl<'c, K, V> NextOccupiedFromVacant<'c> for DummyBTreeMapRawVacantEntry<'c, K, V> where
    K: Ord, 

fn get_next_occupied(self) -> Option<Self::Occupied>

get the next occupied entry after this one.

impl<'c, K, V> PrevOccupiedFromVacant<'c> for DummyBTreeMapRawVacantEntry<'c, K, V> where
    K: Ord, 

fn get_prev_occupied(self) -> Option<Self::Occupied>

get the previous occupied entry after this one.

impl<'c, K, V> VacantEntry<'c> for DummyBTreeMapRawVacantEntry<'c, K, V>

type Occupied = DummyBTreeMapOccupiedEntry<'c, K, V>

The type of OccupiedEntry we convert to when inserting.

type Value = (K, V)

The type of values in the collection.

fn occupy(self, val: Self::Value) -> Self::Occupied

insert the val using the owned key, returning the occupied entry

fn insert(self, val: Self::Value)

insert the val using the owned key.