Struct MultiLevelCache 

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

A two-level cache hierarchy.

L1 is a small, fast LRU cache. L2 is a larger LRU cache. On a miss in L1, L2 is checked and the result is promoted to L1.

Implementations

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

pub fn new(l1_cap: usize, l2_cap: usize) -> Self

Create a two-level cache.

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

Get a value, checking L1 first, then L2.

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

Insert into both L1 and L2.

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

Insert only into L2 (for pre-warming the L2 cache).

pub fn clear_l1(&mut self)

Clear L1 only.

pub fn clear_all(&mut self)

Clear both levels.

pub fn l1_hits(&self) -> u64

L1 hit count.

pub fn l2_hits(&self) -> u64

L2 hit count.

pub fn misses(&self) -> u64

Miss count.

pub fn total_requests(&self) -> u64

Total requests served.

pub fn hit_rate(&self) -> f64

Overall hit rate.