Struct EbbinghausPolicy 

pub struct EbbinghausPolicy { /* private fields */ }

Ebbinghaus forgetting curve eviction policy.

Score formula: score = exp(-t / (S * ln(1 + n)))

Where:

• t = seconds since last_accessed (or created_at if never accessed)
• S = retention_strength (higher = slower decay)
• n = access_count

Entries with a high access count or recent access get higher scores and are less likely to be evicted.

Implementations

impl EbbinghausPolicy

pub fn new(retention_strength: f64) -> Self

Create a new policy with the given retention strength.

A good default is 86400.0 (one day in seconds).

Trait Implementations

impl Default for EbbinghausPolicy

fn default() -> Self

Returns the “default value” for a type.

impl EvictionPolicy for EbbinghausPolicy

fn score(&self, entry: &EvictionEntry) -> f64

Compute a retention score for the given entry.