Struct alloc::collections::btree_map::VacantEntry 1.0.0[−][src]
pub struct VacantEntry<'a, K: 'a, V: 'a> { /* fields omitted */ }Expand description
A view into a vacant entry in a BTreeMap.
It is part of the Entry enum.
Implementations
impl<'a, K: Ord, V> VacantEntry<'a, K, V>[src]
impl<'a, K: Ord, V> VacantEntry<'a, K, V>[src]pub fn insert(self, value: V) -> &'a mut V[src]
pub fn insert(self, value: V) -> &'a mut V[src]Sets the value of the entry with the VacantEntry’s key,
and returns a mutable reference to it.
Examples
use std::collections::BTreeMap; use std::collections::btree_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);Run
Trait Implementations
Auto Trait Implementations
impl<'a, K, V> Send for VacantEntry<'a, K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<'a, K, V> Sync for VacantEntry<'a, K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<'a, K, V> Unpin for VacantEntry<'a, K, V> where
K: Unpin,
K: Unpin,