Struct TinyLfuEviction 

pub struct TinyLfuEviction { /* private fields */ }

Ranks eviction candidates least-frequent-first, reading frequency from a shared estimator; ties break oldest-access-first (LRFU), then largest first, so blobs sharing the open-time recency seed release in the order that reaches the target in the fewest releases. Also owns the probation lifecycle at sweep time: promotes probation members whose buffered frequency has reached promotion_threshold, and caps probation’s footprint to probation_target_pct of cache_bytes by evicting the least-frequent non-promoted probation members first.

Implementations

impl TinyLfuEviction

pub fn new( freq: Arc<dyn FrequencyEstimator>, promotion_threshold: u32, probation_target_pct: u64, ) -> Self

Rank against freq, promoting probation members at promotion_threshold sightings and holding probation to probation_target_pct of the cache.

Trait Implementations

impl Debug for TinyLfuEviction

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

Formats the value using the given formatter.

impl EvictionPolicy for TinyLfuEviction

fn plan(&self, ctx: &EvictionContext<'_>) -> EvictionPlan

The one sweep-time decision: what leaves, what graduates. A policy that ranks by frequency reads the shared FrequencyEstimator directly — the engine feeds that estimator on every serve. candidates is already stripped of pins and probe-holds by the engine; a deny-listed hash stays a candidate even when pinned (deny wins over pin).