pub struct VacantEntry<'a, T, S> {
    base: VacantEntry<'a, T, S>,
}🔬This is a nightly-only experimental API. (
hash_set_entry)Expand description
A view into a vacant entry in a HashSet.
It is part of the Entry enum.
§Examples
#![feature(hash_set_entry)]
use std::collections::hash_set::{Entry, HashSet};
let mut set = HashSet::<&str>::new();
let entry_v = match set.entry("a") {
    Entry::Vacant(view) => view,
    Entry::Occupied(_) => unreachable!(),
};
entry_v.insert();
assert!(set.contains("a") && set.len() == 1);
// Nonexistent key (insert)
match set.entry("b") {
    Entry::Vacant(view) => view.insert(),
    Entry::Occupied(_) => unreachable!(),
}
assert!(set.contains("b") && set.len() == 2);Fields§
§base: VacantEntry<'a, T, S>🔬This is a nightly-only experimental API. (
hash_set_entry)Implementations§
Source§impl<'a, T, S> VacantEntry<'a, T, S>
 
impl<'a, T, S> VacantEntry<'a, T, S>
Sourcepub fn get(&self) -> &T
 🔬This is a nightly-only experimental API. (hash_set_entry)
pub fn get(&self) -> &T
hash_set_entry)Gets a reference to the value that would be used when inserting
through the VacantEntry.
§Examples
#![feature(hash_set_entry)]
use std::collections::HashSet;
let mut set = HashSet::new();
assert_eq!(set.entry("poneyland").get(), &"poneyland");Sourcepub fn into_value(self) -> T
 🔬This is a nightly-only experimental API. (hash_set_entry)
pub fn into_value(self) -> T
hash_set_entry)Take ownership of the value.
§Examples
#![feature(hash_set_entry)]
use std::collections::hash_set::{Entry, HashSet};
let mut set = HashSet::new();
match set.entry("poneyland") {
    Entry::Occupied(_) => panic!(),
    Entry::Vacant(v) => assert_eq!(v.into_value(), "poneyland"),
}Sourcepub fn insert(self)where
    T: Hash,
    S: BuildHasher,
 🔬This is a nightly-only experimental API. (hash_set_entry)
pub fn insert(self)where
    T: Hash,
    S: BuildHasher,
hash_set_entry)Sets the value of the entry with the VacantEntry’s value.
§Examples
#![feature(hash_set_entry)]
use std::collections::HashSet;
use std::collections::hash_set::Entry;
let mut set = HashSet::new();
if let Entry::Vacant(o) = set.entry("poneyland") {
    o.insert();
}
assert!(set.contains("poneyland"));Trait Implementations§
Auto Trait Implementations§
impl<'a, T, S> Freeze for VacantEntry<'a, T, S>where
    T: Freeze,
impl<'a, T, S> RefUnwindSafe for VacantEntry<'a, T, S>where
    T: RefUnwindSafe,
    S: RefUnwindSafe,
impl<'a, T, S> Send for VacantEntry<'a, T, S>
impl<'a, T, S> Sync for VacantEntry<'a, T, S>
impl<'a, T, S> Unpin for VacantEntry<'a, T, S>where
    T: Unpin,
impl<'a, T, S> !UnwindSafe for VacantEntry<'a, T, S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
 
impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
 
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more