Struct LrMap 

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

A concurrent map optimized for read-heavy workloads.

Readers never block — not even while a write is in progress. Writers are serialized through an internal Mutex.

Trade-off: doubled memory (two copies of the map).

Implementations

impl<K, V> LrMap<K, V>

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

pub fn new() -> Self

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

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

Lock-free lookup returning a clone of the value.

pub fn insert(&self, key: K, value: V)

pub fn clear(&self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

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

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

fn default() -> Self

Returns the “default value” for a type.