Struct LockFreeCache 

pub struct LockFreeCache { /* private fields */ }

Lock-free cache with LRU-like eviction based on access frequency This implementation uses DashMap for lock-free concurrent access and provides 2-4x better performance than traditional LRU cache

Implementations

impl LockFreeCache

pub fn new(max_size_bytes: usize) -> Self

Create a new lock-free cache with the specified maximum size in bytes

pub fn get(&self, key: &EKey) -> Option<Arc<Vec<u8>>>

Get an item from the cache (returns Arc for zero-copy)

pub fn put(&self, key: EKey, data: Arc<Vec<u8>>)

Put an item into the cache

pub fn clear(&self)

Clear the entire cache

pub fn stats(&self) -> CacheStats

Get cache statistics

pub fn contains(&self, key: &EKey) -> bool

Check if a key exists in the cache without updating access stats

pub fn current_size(&self) -> usize

Get the current size of the cache in bytes

pub fn reserve(&self, additional: usize)

Preallocate space in the cache