Struct LockFreeMap 

pub struct LockFreeMap<K, V>
where
    K: Eq + Hash + Clone,
    V: Clone,
{ /* private fields */ }

Lock-free concurrent hashmap optimized for read-heavy workloads

Implementations

impl<K, V> LockFreeMap<K, V>

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

pub fn new() -> Self

Create a new lock-free map

pub fn with_capacity(capacity: usize) -> Self

Create with specified capacity

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 remove(&self, key: &K) -> Option<(K, V)>

Remove a key-value pair

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

Check if the map contains a key

pub fn len(&self) -> usize

Get the number of entries

pub fn is_empty(&self) -> bool

Check if the map is empty

pub fn clear(&self)

Clear all entries

Trait Implementations

impl<K, V> Clone for LockFreeMap<K, V>

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for LockFreeMap<K, V>

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

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

Formats the value using the given formatter.

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

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

fn default() -> Self

Returns the “default value” for a type.