Struct RiShardedLock 

pub struct RiShardedLock<K, V> { /* private fields */ }

Implementations

impl<K, V> RiShardedLock<K, V>

where K: Hash + Eq + Clone + Send + Sync + 'static, V: Clone + Send + Sync + 'static,

pub fn new(shard_count: usize) -> Self

pub fn with_default_shards() -> Self

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

pub async fn get<Q>(&self, key: &Q) -> Option<V>

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

pub async fn get_mut<F, R, Q>(&self, key: &Q, f: F) -> Option<R>

where F: FnOnce(&mut V) -> R, K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

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

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

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

pub async fn len(&self) -> usize

pub async fn is_empty(&self) -> bool

pub async fn clear(&self)

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

where F: FnMut(&K, &mut V) -> bool,

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

where F: FnMut(&K, &V),

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

where F: FnMut(&K, &mut V),

pub async fn collect_all(&self) -> HashMap<K, V>

pub async fn collect_where<F>(&self, predicate: F) -> Vec<V>

where F: FnMut(&K, &V) -> bool,

pub async fn count_where<F>(&self, predicate: F) -> usize

where F: FnMut(&K, &V) -> bool,

pub async fn remove_where<F>(&self, predicate: F) -> usize

where F: FnMut(&K, &V) -> bool,

pub async fn update<F, R>(&self, key: &K, f: F) -> Option<R>

where F: FnOnce(Option<&mut V>) -> R,

pub async fn get_or_insert<F>(&self, key: K, default: F) -> V

where F: FnOnce() -> V,

pub async fn get_or_insert_with_key<F>(&self, key: K, default: F) -> V

where F: FnOnce(&K) -> V,

pub fn shard_count(&self) -> usize

Trait Implementations

impl<K, V> Default for RiShardedLock<K, V>

where K: Hash + Eq + Clone + Send + Sync + 'static, V: Clone + Send + Sync + 'static,

fn default() -> Self

Returns the “default value” for a type.