pub struct VacantEntry<'a, K: 'a, V: 'a> { /* fields omitted */ }
A vacant Entry. It is part of the Entry
enum.
impl<'a, K: Ord, V> VacantEntry<'a, K, V>
[src]
fn key(&self) -> &K
Gets a reference to the key that would be used when inserting a value through the VacantEntry.
use std::collections::BTreeMap; let mut map: BTreeMap<&str, usize> = BTreeMap::new(); assert_eq!(map.entry("poneyland").key(), &"poneyland");
fn into_key(self) -> K
Take ownership of the key.
use std::collections::BTreeMap; use std::collections::btree_map::Entry; let mut map: BTreeMap<&str, usize> = BTreeMap::new(); if let Entry::Vacant(v) = map.entry("poneyland") { v.into_key(); }
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.
use std::collections::BTreeMap; let mut count: BTreeMap<&str, usize> = BTreeMap::new(); // count the number of occurrences of letters in the vec for x in vec!["a","b","a","c","a","b"] { *count.entry(x).or_insert(0) += 1; } assert_eq!(count["a"], 3);
impl<'a, K: 'a + Debug + Ord, V: 'a> Debug for VacantEntry<'a, K, V>
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/collections/btree_map/struct.VacantEntry.html