Struct LruCache 

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

Thread-safe LRU cache using DashMap with approximate LRU eviction.

Uses an atomic counter for access ordering instead of timestamps, providing better performance while maintaining approximate LRU semantics.

Implementations

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

pub fn new(capacity: usize) -> Self

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

Get a value and update LRU order. Returns cloned value.

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

Put a value into the cache. Returns old value if key existed.

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

Remove a value from the cache.

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

Check if cache contains a key (read-only, doesn’t update LRU order).

pub fn clear(&self)

Clear all entries from the cache.

pub fn len(&self) -> usize

Get the current number of entries.

pub fn is_empty(&self) -> bool

Check if the cache is empty.

pub fn capacity(&self) -> usize

Get the capacity of the cache.