Struct sentry_types::protocol::v7::map::VacantEntry

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

A view into a single empty location in a LinkedHashMap.

Methods

impl<'a, K, V, S> VacantEntry<'a, K, V, S> where     K: 'a + Eq + Hash,     S: BuildHasher,     V: 'a,

Important traits for &'a mut R

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

pub fn key(&self) -> &K

Gets a reference to the entry key

Examples

use linked_hash_map::LinkedHashMap;

let mut map = LinkedHashMap::<String, u32>::new();

assert_eq!("foo", map.entry("foo".to_string()).key());

Important traits for &'a mut R

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

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