Struct CacheWarmer 

pub struct CacheWarmer {
    pub patterns: Vec<AccessPattern>,
    pub look_ahead_secs: u64,
    pub min_frequency: f64,
}

Predictive cache warmer.

Fields

patterns: Vec<AccessPattern>

All recorded access patterns, keyed by cache key.

look_ahead_secs: u64

Look-ahead window: only warm entries whose predicted next access is within this many seconds of current_time.

min_frequency: f64

Minimum accesses/hour for a key to be considered worth warming.

Implementations

impl CacheWarmer

pub fn new() -> Self

Create a new CacheWarmer with sensible defaults.

pub fn record_access(&mut self, key: &str, size_bytes: usize, time: u64)

Record an access to key at time (Unix seconds).

If no pattern for this key exists yet, one is created.

pub fn plan_warmup( &self, current_time: u64, available_bytes: usize, ) -> WarmupPlan

Build a WarmupPlan prioritising entries by:

score = frequency_per_hour × recency_weight × size_efficiency

where

• recency_weight = exp(-age_hours / 1.0) – exponential decay over 1 h
• size_efficiency = 1.0 / (1.0 + size_bytes / 1024)

Only entries whose predicted next access is within look_ahead_secs of current_time and whose frequency exceeds min_frequency are considered. Entries are added in descending score order until available_bytes would be exceeded.

pub fn top_hot_keys(&self, n: usize) -> Vec<(&str, f64)>

Return the top n hot keys sorted by descending frequency.