Struct ConcurrentHashMap 

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

A cache-friendly sharded concurrent hash map

Uses multiple shards to reduce contention. Each shard has its own lock, so operations on different keys in different shards can proceed in parallel.

Implementations

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

pub fn new() -> Self

Create a new concurrent hash map

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

Insert a key-value pair

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

Get a value by key

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

Check if key exists

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

Remove a key

pub fn len(&self) -> usize

Get approximate length

pub fn is_empty(&self) -> bool

Check if empty

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

where F: FnOnce(&mut V),

Apply a function to a value

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

Get or insert with a default value

pub fn get_or_insert_with<F>(&self, key: K, f: F) -> V

where F: FnOnce() -> V,

Get or insert with a closure

pub fn snapshot(&self) -> Vec<(K, V)>

Iterate over all entries (snapshot)

pub fn clear(&self)

Clear all entries

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.