RawTable

Struct RawTable 

Source
#[repr(align(128))]
pub struct RawTable<K: Key + ?Sized, V> { /* private fields */ }
Expand description

A concurrent hash table.

Implementations§

Source§

impl<K: Key + ?Sized, V> RawTable<K, V>

Source

pub const fn new() -> Self

Creates a new RawTable.

Source

pub fn with_capacity(capacity: usize) -> Self

Creates a new RawTable that will not reallocate before capacity insertions are done.

Source

pub unsafe fn gc<F: FnOnce()>(&self, drop_guard: F)

Free any resources which are no longer necessary.

§Safety

Until drop_guard gets called, there may not be any alive references returned by the RawTable, or concurrent other operations.

Source

pub fn get(&self, hash: u64, eq: impl FnMut(&K) -> bool) -> Option<&V>

Finds the value corresponding to a key with the given hash and equality function.

Source

pub fn get_or_insert_with( &self, hash: u64, key: &K, eq: impl FnMut(&K) -> bool, val_f: impl FnOnce(&K) -> V, ) -> &V

Finds the value corresponding to a key with the given hash and equality function, or insert a new one if the key does not exist.

val_f is guaranteed to only be called when inserting a new key not currently found in the table, even if multiple concurrent inserts occur. The key reference passed to val_f lives as long as the new entry will.

Source

pub fn try_get_or_insert_with<E>( &self, hash: u64, key: &K, eq: impl FnMut(&K) -> bool, val_f: impl FnOnce(&K) -> Result<V, E>, ) -> Result<&V, E>

Finds the value corresponding to a key with the given hash and equality function, or insert a new one if the key does not exist.

val_f is guaranteed to only be called when inserting a new key not currently found in the table, even if multiple concurrent inserts occur. The key reference passed to val_f lives as long as the new entry will.

Source

pub fn remove(&self, hash: u64, eq: impl FnMut(&K) -> bool) -> Option<&V>

Finds and removes the value corresponding to a key with the given hash and equality function.

Note that the value is not dropped until RawTable::gc is called or the RawTable is dropped.

Trait Implementations§

Source§

impl<K: Key + ?Sized, V> Default for RawTable<K, V>

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<K: Key + ?Sized, V> Drop for RawTable<K, V>

Source§

fn drop(&mut self)

Executes the destructor for this type. Read more
Source§

impl<K: Key + Send + ?Sized, V: Send> Send for RawTable<K, V>

Source§

impl<K: Key + Send + Sync + ?Sized, V: Send + Sync> Sync for RawTable<K, V>

Auto Trait Implementations§

§

impl<K, V> !Freeze for RawTable<K, V>

§

impl<K, V> RefUnwindSafe for RawTable<K, V>

§

impl<K, V> Unpin for RawTable<K, V>
where V: Unpin, K: ?Sized,

§

impl<K, V> UnwindSafe for RawTable<K, V>

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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

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>,

Source§

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.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> Ungil for T
where T: Send,