Struct hashbrown::table::VacantEntry

source ·
pub struct VacantEntry<'a, T, A = Global>
where A: Allocator,
{ hash: u64, insert_slot: InsertSlot, table: &'a mut HashTable<T, A>, }
Expand description

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

§Examples

use ahash::AHasher;
use hashbrown::hash_table::{Entry, HashTable, VacantEntry};
use std::hash::{BuildHasher, BuildHasherDefault};

let mut table: HashTable<&str> = HashTable::new();
let hasher = BuildHasherDefault::<AHasher>::default();
let hasher = |val: &_| hasher.hash_one(val);

let entry_v: VacantEntry<_, _> = match table.entry(hasher(&"a"), |&x| x == "a", hasher) {
    Entry::Vacant(view) => view,
    Entry::Occupied(_) => unreachable!(),
};
entry_v.insert("a");
assert!(table.find(hasher(&"a"), |&x| x == "a").is_some() && table.len() == 1);

// Nonexistent key (insert)
match table.entry(hasher(&"b"), |&x| x == "b", hasher) {
    Entry::Vacant(view) => {
        view.insert("b");
    }
    Entry::Occupied(_) => unreachable!(),
}
assert!(table.find(hasher(&"b"), |&x| x == "b").is_some() && table.len() == 2);

Fields§

§hash: u64§insert_slot: InsertSlot§table: &'a mut HashTable<T, A>

Implementations§

source§

impl<'a, T, A> VacantEntry<'a, T, A>
where A: Allocator,

source

pub fn insert(self, value: T) -> OccupiedEntry<'a, T, A>

Inserts a new element into the table with the hash that was used to obtain the VacantEntry.

An OccupiedEntry is returned for the newly inserted element.

§Examples
use ahash::AHasher;
use hashbrown::hash_table::Entry;
use hashbrown::HashTable;
use std::hash::{BuildHasher, BuildHasherDefault};

let mut table: HashTable<&str> = HashTable::new();
let hasher = BuildHasherDefault::<AHasher>::default();
let hasher = |val: &_| hasher.hash_one(val);

if let Entry::Vacant(o) = table.entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher) {
    o.insert("poneyland");
}
assert_eq!(
    table.find(hasher(&"poneyland"), |&x| x == "poneyland"),
    Some(&"poneyland")
);
source

pub fn into_table(self) -> &'a mut HashTable<T, A>

Converts the VacantEntry into a mutable reference to the underlying table.

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for VacantEntry<'_, T, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for VacantEntry<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for VacantEntry<'a, T, A>

§

impl<'a, T, A> Send for VacantEntry<'a, T, A>
where T: Send, A: Send,

§

impl<'a, T, A> Sync for VacantEntry<'a, T, A>
where T: Sync, A: Sync,

§

impl<'a, T, A> Unpin for VacantEntry<'a, T, A>

§

impl<'a, T, A = Global> !UnwindSafe for VacantEntry<'a, T, A>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.