Struct MultiLevelCache 

pub struct MultiLevelCache<K, V>
where
    K: Hash + Eq + Send + Sync + Clone + 'static,
    V: Clone + Send + Sync + 'static,
{ /* private fields */ }

Scan-resistant cache backed by Moka’s TinyLFU

TinyLFU tracks frequency of both hits and misses, rejecting infrequent “scan” accesses that would pollute a pure LRU cache.

Implementations

impl<K, V> MultiLevelCache<K, V>

where K: Hash + Eq + Send + Sync + Clone + 'static, V: Clone + Send + Sync + 'static,

pub fn new(l1_size: usize, l2_size: usize) -> Self

Build a scan-resistant cache with specified capacity

The l1_size and l2_size parameters are combined for total capacity. Moka’s TinyLFU internally manages hot/cold separation.

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

Look up a cached value

TinyLFU admission policy means frequently-accessed keys stay cached while scan-like one-time accesses are rejected.

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

Store a value in the cache

Note: TinyLFU may reject this entry if the key hasn’t been seen frequently enough. This is intentional for scan resistance.

pub fn hit_rate(&self) -> f64

Cache hit rate (0.0 to 1.0)

pub fn avg_access_time(&self) -> Duration

Average access time for cache hits

pub fn metrics(&self) -> CacheMetrics

Full performance snapshot

pub fn len(&self) -> usize

Number of entries currently in cache

pub fn is_empty(&self) -> bool

Check if cache is empty

pub fn clear(&self)

Clear all entries and reset stats

Trait Implementations

impl<K, V> Debug for MultiLevelCache<K, V>

where K: Hash + Eq + Send + Sync + Clone + 'static, V: Clone + Send + Sync + 'static,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.