Struct ConcurrentHashMap 

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

Thread-safe wrapper around HashMap

Implementations

impl<K: Clone + Eq + Hash, V: Clone> ConcurrentHashMap<K, V>

pub fn new() -> Self

Create a new concurrent hashmap

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

Insert a key-value pair

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

Get a value by key

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

Remove a key-value pair

pub fn contains_key(&self, key: &K) -> UtilsResult<bool>

Check if key exists

pub fn len(&self) -> UtilsResult<usize>

Get the number of entries

pub fn is_empty(&self) -> UtilsResult<bool>

Check if the map is empty

Trait Implementations

impl<K: Clone, V: Clone> Clone for ConcurrentHashMap<K, V>

fn clone(&self) -> ConcurrentHashMap<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for ConcurrentHashMap<K, V>

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

Formats the value using the given formatter.

impl<K: Clone + Eq + Hash, V: Clone> Default for ConcurrentHashMap<K, V>

fn default() -> Self

Returns the “default value” for a type.