Struct AbsentEntry

pub struct AbsentEntry<'a, T, A = Global>
where
    A: Allocator, { /* private fields */ }

Type representing the absence of an entry, as returned by HashTable::find_entry and HashTable::get_bucket_entry.

This type only exists due to limitations in Rust's NLL borrow checker. In the future, those methods will return an Option<OccupiedEntry> and this type will be removed.

Examples

# #[cfg(feature = "nightly")]
# fn test() {
use hashbrown::hash_table::{AbsentEntry, Entry};
use hashbrown::{HashTable, DefaultHashBuilder};
use std::hash::BuildHasher;

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

let entry_v: AbsentEntry<_, _> = table.find_entry(hasher(&"a"), |&x| x == "a").unwrap_err();
entry_v
    .into_table()
    .insert_unique(hasher(&"a"), "a", hasher);
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);
# }
# fn main() {
#     #[cfg(feature = "nightly")]
#     test()
# }

Implementations

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

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

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

Trait Implementations

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

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

Auto Trait Implementations

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

impl<'a, T, A> Freeze for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: Freeze,

impl<'a, T, A> RefUnwindSafe for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: RefUnwindSafe,

impl<'a, T, A> Send for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: Send,

impl<'a, T, A> Sync for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: Sync,

impl<'a, T, A> Unpin for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: Unpin,

impl<'a, T, A> UnsafeUnpin for AbsentEntry<'a, T, A> where &'a mut HashTable<T, A>: UnsafeUnpin,

Blanket Implementations

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

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for AbsentEntry<'a, T, A> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for AbsentEntry<'a, T, A> where T: ?Sized,

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

impl<T> From<T> for AbsentEntry<'a, T, A>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into<U> for AbsentEntry<'a, T, A> where U: From<T>,

fn into(self) -> U

Calls U::from(self).

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

impl<T, U> TryFrom<U> for AbsentEntry<'a, T, A> where U: Into<T>,

type Error = never;
fn try_from(value: U) -> Result<T, never>

impl<T, U> TryInto<U> for AbsentEntry<'a, T, A> where U: TryFrom<T>,

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