Struct StorageGCPlanner 

pub struct StorageGCPlanner {
    pub config: GCConfig,
}

Plans garbage-collection runs by analysing block liveness.

The planner is intentionally stateless beyond its GCConfig: feed it a snapshot of candidates and a wall-clock timestamp and it returns a ready-to-execute GCPlan.

Fields

config: GCConfig

Configuration controlling collection behaviour.

Implementations

impl StorageGCPlanner

pub fn new(config: GCConfig) -> Self

Create a new planner with the given configuration.

pub fn plan( &self, candidates: &[GCCandidate], now_secs: u64, ) -> (GCPlan, GCPlannerStats)

Analyse candidates and produce a deletion plan.

now_secs is the current Unix timestamp in seconds. Using a parameter rather than reading the system clock keeps the function pure and deterministic for testing.

Algorithm

1. Iterate over every candidate, classifying it as pinned, referenced, too young, or eligible.
2. Sort eligible candidates by last_accessed_secs ascending.
3. Greedily add candidates to the plan until estimated_freed_bytes >= target_free_bytes or candidate_count >= max_candidates.

pub fn estimate_run_time_ms(&self, plan: &GCPlan) -> u64

Estimate how long executing plan might take in milliseconds.

Simple linear model:

• 1 ms per candidate block.
• 1 ms per 10 MiB (10 485 760 bytes) of data (integer division, no floats).

Trait Implementations

impl Clone for StorageGCPlanner

fn clone(&self) -> StorageGCPlanner

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StorageGCPlanner

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.