Struct RawTable

pub struct RawTable<T: Invariant, S = DefaultHashBuilder, A: Allocator = HashTableAlloc> { /* private fields */ }

Implementations

impl<T: Invariant> RawTable<T, DefaultHashBuilder, HashTableAlloc>

pub fn new() -> Self

impl<T: Invariant, S, A: Allocator> RawTable<T, S, A>

pub fn hasher(&self) -> &S

pub fn allocator(&self) -> &A

pub fn len(&self) -> usize

pub fn capacity(&self) -> usize

pub fn with_hasher_in(hasher: S, alloc: A) -> Self

pub fn remove( &mut self, hash: u64, eq: impl FnMut(&T) -> bool, ctx: &impl CtxMut, ) -> Option<T>

pub fn get( &self, hash: u64, eq: impl FnMut(&T) -> bool, ctx: &impl Ctx, ) -> Option<&T>

pub fn get_mut<'a>( &mut self, hash: u64, eq: impl FnMut(&T) -> bool, ctx: &'a impl CtxMut, ) -> Option<&'a mut T>

pub fn clear(&mut self)

pub fn carry_ctx(&self) -> CarryCtx<'_>

pub fn carry_ctx_mut<'a>( &self, base: &RefMut<'a, RawTable<T, S, A>>, ) -> CarryCtxMut<'a>

pub unsafe fn iter(&self) -> RawIter<T>

pub unsafe fn backing(&self) -> Ref<'_, u8>

pub unsafe fn backing_mut(&mut self) -> RefMut<'_, u8>

impl<T: Invariant, S> RawTable<T, S, HashTableAlloc>

pub fn bootstrap(&mut self, capacity: usize) -> Result<()>

pub fn reserve( &mut self, additional: usize, hasher: impl Fn(&T) -> u64, ctx: &impl CtxMut, )

pub fn reserve_rehash( &mut self, additional: usize, hasher: impl Fn(&T) -> u64, ctx: &impl CtxMut, ) -> Result<()>

pub unsafe fn resize( &mut self, capacity: usize, hasher: impl Fn(&T) -> u64, ctx: &impl CtxMut, ) -> Result<()>

pub fn find_or_find_insert_slot( &mut self, hash: u64, eq: impl FnMut(&T) -> bool, hasher: impl Fn(&T) -> u64, ctx: &impl CtxMut, ) -> Result<Ref<'_, T>, usize>

pub unsafe fn insert_in_slot( &mut self, hash: u64, slot: usize, value: T, ctx: &impl CtxMut, )

Trait Implementations

impl<T: Invariant, S, A: Allocator> BaseType for RawTable<T, S, A>

fn fingerprint() -> u64

The fingerprint of this type.