Struct std::collections::hash_map::VacantEntry

pub struct VacantEntry<'a, K: 'a, V: 'a> { /* fields omitted */ }

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

Methods

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

Important traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;impl<'a, R: Read + ?Sized> Read for &'a mut Rimpl<'a, W: Write + ?Sized> Write for &'a mut W

pub fn key(&self) -> &K

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

Examples

use std::collections::HashMap;

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

pub fn into_key(self) -> K

Take ownership of the key.

Examples

use std::collections::HashMap;
use std::collections::hash_map::Entry;

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

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

Important traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;impl<'a, R: Read + ?Sized> Read for &'a mut Rimpl<'a, W: Write + ?Sized> Write for &'a mut W

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.

Examples

use std::collections::HashMap;
use std::collections::hash_map::Entry;

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

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

Trait Implementations

impl<'a, K: 'a + Debug, V: 'a> Debug for VacantEntry<'a, K, V>

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

Formats the value using the given formatter.