Struct in_place::dummy_collections::b_tree_map::DummyBTreeMapVacantEntry

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

Vacant entry of a BTreeMap.

This contains the key used to search for this entry, and can read that key, or insert into the BTreeMap at that key, when provided a value.

Trait Implementations

impl<'c, K, V> KeyedVacantEntry<'c> for DummyBTreeMapVacantEntry<'c, K, V>

type Key = K

fn get_key<'e>(&'e self) -> &'e Self::Key where
    'c: 'e, 

Get a reference to the key an item will be inserted with.

fn into_key(self) -> Self::Key

Consume self and return the contained key.

impl<'c, K, V> NextOccupiedFromVacant<'c> for DummyBTreeMapVacantEntry<'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 DummyBTreeMapVacantEntry<'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 DummyBTreeMapVacantEntry<'c, K, V>

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

The type of OccupiedEntry we convert to when inserting.

type Value = 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.