Struct PrefetchScheduler 

pub struct PrefetchScheduler { /* private fields */ }

Tracks CID access patterns and suggests prefetch candidates.

A sliding window of the last 256 accesses is maintained. Within each access event the scheduler updates co-access counts for up to the 4 most-recent other CIDs (i.e., pairs within the last 5 accesses).

Implementations

impl PrefetchScheduler

pub fn new() -> Self

Create a new scheduler.

pub fn record_access(&self, cid: &str)

Record that cid was accessed.

Appends to the rolling log (trimmed to 256 entries) and updates co-access counts for all pairs formed by the current access and the preceding 4 entries (window of 5).

pub fn prefetch_candidates(&self, cid: &str, top_n: usize) -> Vec<String>

Return the top top_n CIDs most frequently co-accessed with cid, sorted by co-access count descending.

pub fn access_count(&self) -> usize

Return the total number of entries in the access log.

pub fn prune_log(&self, max_age: Duration)

Remove log entries older than max_age.

Note: co-access counts are not adjusted — they represent historical signal that remains valid even after pruning old log entries.

Trait Implementations

impl Default for PrefetchScheduler

fn default() -> Self

Returns the “default value” for a type.