Struct ConcurrentHashMap

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

Implementations

impl<K, V> ConcurrentHashMap<K, V>

pub fn new() -> Self

pub fn get_inner(&self) -> Arc<RwLock<HashMap<K, V>>>

pub fn get_inner_rl(&self) -> RwLockReadGuard<'_, HashMap<K, V>>

pub fn get_inner_wl(&self) -> RwLockWriteGuard<'_, HashMap<K, V>>

pub fn get_or_insert( &self, key: &K, value_gen_fn: impl Fn(&K) -> Result<V, SmallError>, ) -> Result<V, SmallError>

where K: Eq + Hash + Clone, V: Clone,

pub fn alter_value( &self, key: &K, alter_fn: impl Fn(&mut V) -> Result<(), SmallError>, ) -> Result<(), SmallError>

where K: Eq + Hash + Clone, V: Clone + Default,

pub fn exact_or_empty(&self, k: &K, v: &V) -> bool

where K: Eq + Hash, V: Eq,

Return true if map[&k] == v, or map[&k] is not exist.

Return false if map[&k] != v.

pub fn clear(&self)

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

where K: Eq + Hash,

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

where K: Eq + Hash,

pub fn keys(&self) -> Vec<K>

where K: Eq + Hash + Clone,