Struct MruRanker 

pub struct MruRanker { /* private fields */ }

rank:mru. Combines the matcher’s MatchScore with a per- candidate bonus (frecency / recency / MRU-style) supplied by the caller. Bonus is added to the score; the result is re-sorted descending with alphabetical tie-break.

Slice 3c.unify.mru-promotion: promoted from lattice-picker’s inline combined = score + bonus arithmetic to a first-class CandidateRanker impl. The bonus lookup is a caller-supplied closure so different surfaces can choose their identity scheme:

• Picker decodes the index encoded in CandidateData::Extension (the existing parallel-bonus-vec scheme).
• Cmdline-completion (future) can look up by candidate text in a HashMap<String, f64> derived from the host’s MRU index at filter time.
• Plugins supply their own lookup against whatever identity scheme they prefer.

MruRanker subsumes the ScoreRanker behavior (it sorts by score when every bonus is 0.0), so the typical pipeline composition is rankers: vec![Arc::new(MruRanker::new(...))] — not stacking [ScoreRanker, MruRanker] which would just be a wasted first sort.

Implementations

impl MruRanker

pub fn new( bonus_lookup: impl Fn(&RawCandidate) -> f64 + Send + Sync + 'static, ) -> Self

bonus_lookup(raw) returns the candidate’s MRU bonus — a non-negative f64 added to its MatchScore.get() as f64 for ranking. Returning 0.0 means “no MRU history; rank purely by match score.”

Trait Implementations

impl CandidateRanker for MruRanker

fn rank(&self, scored: &mut Vec<ScoredCandidate>)