Struct CHashMap

pub struct CHashMap<K, T, S = DefaultHashBuilder> { /* private fields */ }

Implementations

impl<K, T> CHashMap<K, T, DefaultHashBuilder>

pub fn new(num_shards: usize) -> Self

impl<K, T, S> CHashMap<K, T, S>

where S: Clone,

pub fn with_hasher(num_shards: usize, hash_builder: S) -> Self

impl<K, T, S> CHashMap<K, T, S>

where K: Clone, T: Clone, S: Clone,

pub async fn duplicate(&self) -> Self

Duplicates/Clones the CHashMap. A CHashMap cannot be cloned regularly due to internal async locking.

impl<K, T, S> CHashMap<K, T, S>

where K: Hash + Eq, S: BuildHasher,

pub fn hash_builder(&self) -> &S

pub async fn clear(&self)

pub async fn retain<F>(&self, f: F)

where F: Fn(&K, &mut T) -> bool,

pub fn iter_shards<'a>( &'a self, ) -> impl Iterator<Item = &'a RwLock<Shard<K, T, S>>>

pub fn size(&self) -> usize

pub fn num_shards(&self) -> usize

pub fn try_maybe_contains_hash(&self, hash: u64) -> bool

pub async fn contains_hash(&self, hash: u64) -> bool

pub async fn contains<Q>(&self, key: &Q) -> bool

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub async fn remove<Q>(&self, key: &Q) -> Option<T>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub async fn insert(&self, key: K, value: T) -> Option<T>

pub async fn get<Q>(&self, key: &Q) -> Option<ReadHandle<impl Erased, T>>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub async fn get_cloned<Q>(&self, key: &Q) -> Option<T>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized, T: Clone,

pub async fn get_mut<Q>(&self, key: &Q) -> Option<WriteHandle<impl Erased, T>>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub async fn get_or_insert( &self, key: &K, on_insert: impl FnOnce() -> T, ) -> ReadHandle<impl Erased, T>

where K: Clone,

pub async fn get_mut_or_insert( &self, key: &K, on_insert: impl FnOnce() -> T, ) -> WriteHandle<impl Erased, T>

where K: Clone,

pub async fn get_or_default(&self, key: &K) -> ReadHandle<impl Erased, T>

where K: Clone, T: Default,

pub async fn get_mut_or_default(&self, key: &K) -> WriteHandle<impl Erased, T>

where K: Clone, T: Default,

pub async fn batch_read<'a, Q, I, F>( &self, keys: I, cache: Option<&mut Vec<(&'a Q, u64, usize)>>, f: F, )

where K: Borrow<Q>, Q: Hash + Eq + 'a + ?Sized, I: IntoIterator<Item = &'a Q>, F: FnMut(&'a Q, Option<(&K, &T)>),

Aggregates all the provided keys and batches together access to the underlying shards, reducing locking overhead at the cost of memory to buffer keys/hashes.

pub async fn batch_write<'a, Q, I, F>( &self, keys: I, cache: Option<&mut Vec<(&'a Q, u64, usize)>>, f: F, )

where K: Borrow<Q>, Q: Hash + Eq + 'a + ?Sized, I: IntoIterator<Item = &'a Q>, F: FnMut(&'a Q, RawEntryMut<'_, K, T, S>),

Aggregates all the provided keys and batches together access to the underlying shards, reducing locking overhead at the cost of memory to buffer keys/hashes

Trait Implementations

impl<K: Debug, T: Debug, S: Debug> Debug for CHashMap<K, T, S>

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

Formats the value using the given formatter.

impl<K, T> Default for CHashMap<K, T, DefaultHashBuilder>

fn default() -> Self

Returns the “default value” for a type.