Struct DecaySchedule 

pub struct DecaySchedule {
    pub half_life: Duration,
    pub valence_weight: f64,
    pub min_valence_for_permanent: f64,
}

Ebbinghaus-inspired memory decay schedule.

Fields

half_life: Duration

valence_weight: f64

min_valence_for_permanent: f64

Implementations

impl DecaySchedule

pub fn retention(&self, tile: &Tile, now: DateTime<Utc>) -> f64

Ebbinghaus forgetting curve: retention = e^(-t/S)

Returns a value between 0.0 and 1.0 representing how well this tile should be retained. High-valence tiles decay slower.

pub fn should_forget(&self, tile: &Tile, now: DateTime<Utc>) -> bool

Should this tile be forgotten based on decay?

pub fn reconsolidate(&self, tile: &mut Tile, new_context: &str)

Reconsolidate: update tile with new context, resetting decay.

This models the neurobiological process where recalling a memory makes it labile again, and re-storing it can strengthen or modify it.

pub fn fast_decay() -> Self

Create a fast-decay schedule (for testing).

pub fn slow_decay() -> Self

Create a slow-decay schedule (permanent-ish memories).

Trait Implementations

impl Clone for DecaySchedule

fn clone(&self) -> DecaySchedule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DecaySchedule

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

Formats the value using the given formatter.

impl Default for DecaySchedule

fn default() -> Self

Returns the “default value” for a type.