Struct StorageTierManager 

pub struct StorageTierManager {
    pub records: RwLock<HashMap<String, BlockTierRecord>>,
    pub policy: TierPolicy,
    pub stats: TierStats,
}

Central manager for block tier tracking and reclassification.

Concurrency

All block records are protected by a single RwLock<HashMap<…>>. Reads (classification queries, summaries) hold a shared lock; writes (access recording, reclassification) hold an exclusive lock.

Fields

records: RwLock<HashMap<String, BlockTierRecord>>

Block records keyed by CID string.

policy: TierPolicy

Policy that governs tier classification.

stats: TierStats

Observable statistics.

Implementations

impl StorageTierManager

pub fn new(policy: TierPolicy) -> Self

Create a new manager with the supplied policy.

pub fn with_default_policy() -> Self

Create a new manager with the default policy.

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

Record one access to the block identified by cid.

Creates the record on first access; subsequent calls increment access_count and update last_accessed. The size_bytes parameter is used only when creating a new record — it is ignored for existing records (callers do not need to supply it after the first call).

pub fn classify(&self, cid: &str, window: Duration) -> StorageTier

Classify the block identified by cid using its current access rate computed over window.

Returns StorageTier::Archive for unknown CIDs.

pub fn reclassify_all(&self, window: Duration) -> Vec<TierTransition>

Reclassify every known block using window and return a list of TierTransitions for blocks whose tier changed.

Also updates current_tier on the record so that subsequent calls to blocks_in_tier reflect the new assignment.

pub fn blocks_in_tier(&self, tier: StorageTier) -> Vec<String>

Return all CIDs whose current_tier matches tier.

pub fn tier_summary(&self) -> HashMap<String, usize>

Return a map from tier name ("hot", "warm", "cold", "archive") to the number of blocks currently assigned to that tier.

pub fn eviction_candidates( &self, tier: StorageTier, max_count: usize, ) -> Vec<String>

Return up to max_count CIDs from tier sorted from least-recently accessed (oldest last_accessed) to most-recently accessed (best eviction candidates first).