Struct LruCache 

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

Bounded LRU cache. Eviction is O(N) per insert in the worst case (we scan the access order), but N is the cache capacity — small in practice (≤4096 for the remoting use case).

Implementations

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

pub fn new(capacity: usize) -> Self

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

Look up key, bumping its recency. Returns None on miss.

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

Insert (key, value). Evicts the least-recently-used entry when at capacity. Returns the evicted value if any.

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

pub fn clear(&mut self)

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

Look up key without bumping its recency. Useful for diagnostic dumps where the cache state should not be perturbed.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Iterate over (key, value) pairs in arbitrary order. Provided for telemetry / dashboard inspection of cache contents.