Struct PredictiveCache 

pub struct PredictiveCache<V> {
    pub stats: CacheStats,
    /* private fields */
}

Predictive LRU cache with Markov chain pre-warming.

Generic over the value type V. Keys are strings.

Fields

stats: CacheStats

Implementations

impl<V: Clone> PredictiveCache<V>

pub fn new(max_size: usize, prediction_depth: usize) -> Self

Create a new predictive cache.

Arguments

• max_size - Maximum number of cached entries
• prediction_depth - How many likely-next keys to pre-warm

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

Get a value from the cache.

Returns Some(value) on hit, None on miss. On hit, records the access and predicts likely-next accesses.

pub fn set(&mut self, key: &str, value: V)

Set a value in the cache.

Evicts the least-recently-used entry if over capacity.

pub fn prewarm<F>(&mut self, loader: F, keys: &[String])

where F: Fn(&str) -> Option<V>,

Manually pre-warm the cache with specific keys using a loader function.

pub fn invalidate(&mut self, key: &str)

Remove a key from the cache.

pub fn clear(&mut self)

Clear the entire cache and all state.

pub fn len(&self) -> usize

Current number of cached entries.

pub fn is_empty(&self) -> bool

Whether the cache is empty.

pub fn likely_next(&self, current_key: &str, top_n: usize) -> Vec<(String, f64)>

Get the most likely next accesses given a current key.

pub fn hot_keys(&self, top_n: usize) -> Vec<(String, u64)>

Get the most frequently accessed keys.

Trait Implementations

impl<V: Clone> Default for PredictiveCache<V>

fn default() -> Self

Returns the “default value” for a type.