Struct TemporalRecencyObjective 

pub struct TemporalRecencyObjective {
    pub half_life_days: f64,
}

Scores a NoteCandidate by pure temporal recency with a configurable half-life.

Formula: exp(-ln(2) / half_life_days * age_days)

At age_days = 0 → score 1.0 (brand new note). At age_days = half_life_days → score 0.5.

Complements DecayAwareSalienceObjective: this signal rewards freshness independently of the note’s own decay rate.

Fields

half_life_days: f64

Number of days for the recency score to halve. Must be > 0.

Implementations

impl TemporalRecencyObjective

pub fn default_memory() -> Self

Create with the ADR-021 default temporal half-life of 30 days.

Trait Implementations

impl Objective<NoteCandidate> for TemporalRecencyObjective

fn score(&self, candidate: &NoteCandidate, _context: &ObjectiveContext) -> f64

Evaluate a single candidate.

fn name(&self) -> &str

Get the name of this objective.

fn precision(&self, _candidate: &T, _context: &ObjectiveContext) -> f64

Precision (inverse variance) estimate for the score of a candidate.

fn passes_score(&self, score: f64, context: &ObjectiveContext) -> bool

Check if a score passes the threshold.

fn passes(&self, candidate: &T, context: &ObjectiveContext) -> bool

Check if a candidate passes the threshold.

fn batch_score( &self, candidates: &[T], context: &ObjectiveContext, ) -> Vec<(usize, f64)>

Score a batch of candidates and return the passing (index, score) pairs.

fn select<'a>( &self, candidates: &'a [T], context: &ObjectiveContext, ) -> Vec<Selection<&'a T>>

Select candidates from a list, returning all that pass in score-descending order.

fn select_top<'a>( &self, candidates: &'a [T], n: usize, context: &ObjectiveContext, ) -> Vec<Selection<&'a T>>

Select the top N candidates.