Struct LruCache 

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

Generic LRU Cache with HashMap + Vec-based intrusive list

Implementations

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

pub fn new(capacity: usize) -> Self

Create a new LRU cache with specified capacity

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

Get a value by key and move it to the most recently used position

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

Insert a key-value pair into the cache

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

Remove a key from the cache

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

Check if key exists in the cache

pub fn len(&self) -> usize

Get the number of entries in the cache

pub fn is_empty(&self) -> bool

Check if cache is empty

pub fn capacity(&self) -> usize

Get the capacity of the cache

pub fn clear(&mut self)

Clear all entries from the cache

pub fn stats(&self) -> (u64, u64)

Get cache statistics

pub fn hit_rate(&self) -> f64

Get hit rate as a percentage (0.0 to 100.0)