Struct StorageAccessPredictor 

pub struct StorageAccessPredictor {
    pub history: HashMap<String, Vec<AccessEvent>>,
}

Predicts future block access patterns from historical access sequences.

Events are stored in a bounded per-CID ring (capped at MAX_HISTORY). The predictor derives an AccessPattern from the inter-access intervals and computes a confidence score for each prediction.

Fields

history: HashMap<String, Vec<AccessEvent>>

Per-CID ordered list of access events (oldest first).

Implementations

impl StorageAccessPredictor

pub fn new() -> Self

Create a new, empty predictor.

pub fn record(&mut self, event: AccessEvent)

Record a new access event.

Events are appended to the per-CID history. When the history exceeds MAX_HISTORY entries the oldest entry (index 0) is evicted.

pub fn predict(&self, cid: &str) -> PredictionResult

Predict the access pattern for a given CID.

Returns a PredictionResult with pattern = Random and confidence = 0.0 when no history is available, or confidence = 0.1 when only a single event has been recorded.

pub fn top_predicted(&self) -> Vec<PredictionResult>

Return predictions for all tracked CIDs whose pattern is Sequential or Repeated, sorted by descending confidence.

pub fn stats(&self) -> PredictorStats

Compute aggregate statistics for the current state of the predictor.

Trait Implementations

impl Default for StorageAccessPredictor

fn default() -> Self

Returns the “default value” for a type.