Struct VacantEntry 

pub struct VacantEntry<'a, K, V, C = Slab<Node<K, V>>> { /* private fields */ }

A view into a vacant entry in a BTreeMap. It is part of the Entry enum.

Implementations

impl<'a, K, V, C: Slab<Node<K, V>>> VacantEntry<'a, K, V, C>

pub fn address(&self) -> Address

Gets the address of the vacant entry in the B-Tree.

pub fn key(&self) -> &K

Gets a reference to the keys that would be used when inserting a value through the VacantEntry.

Example

use btree_slab::BTreeMap;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");

pub fn into_key(self) -> K

Take ownership of the key.

Example

use btree_slab::BTreeMap;
use btree_slab::generic::map::Entry;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();

if let Entry::Vacant(v) = map.entry("poneyland") {
    v.into_key();
}

impl<'a, K, V, C> VacantEntry<'a, K, V, C>

where C: SimpleCollectionRef + SimpleCollectionMut + SlabMut<Node<K, V>>,

pub fn insert(self, value: V) -> &'a mut V

Sets the value of the entry with the VacantEntry’s key, and returns a mutable reference to it.

Example

use btree_slab::BTreeMap;
use btree_slab::generic::map::Entry;

let mut map: BTreeMap<&str, u32> = BTreeMap::new();

if let Entry::Vacant(o) = map.entry("poneyland") {
    o.insert(37);
}
assert_eq!(map["poneyland"], 37);

Trait Implementations

impl<'a, K: Debug, V, C: Slab<Node<K, V>>> Debug for VacantEntry<'a, K, V, C>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.