Struct BalancedRecallFold 

pub struct BalancedRecallFold { /* private fields */ }

Fold for the BalancedRecallProfile state (ADR-032 §5a).

The predecessor design had this fold update a flat HashMap<String, BetaPosterior> on the brain’s core BrainState. Per ADR-032, the three-scalar Bayesian state now lives entirely inside BalancedRecallProfile — brain’s BrainState holds profile registry metadata; posteriors are opaque to brain.

Deterministic: same events in same order → same BalancedRecallState.

Implementations

impl BalancedRecallFold

pub fn new(entity_capacity: usize) -> Self

Trait Implementations

impl Fold<Event, BalancedRecallState> for BalancedRecallFold

fn init(&self, _context: &FoldContext) -> BalancedRecallState

Get the initial state before any entries are processed.

fn reduce( &self, state: BalancedRecallState, event: &Event, _ctx: &FoldContext, ) -> BalancedRecallState

Process a single entry and return the new state.

fn finalize( &self, state: BalancedRecallState, _context: &FoldContext, ) -> BalancedRecallState

Finalize the state after all entries are processed.

fn derive<'a, I>(&self, entries: I, context: &FoldContext) -> FoldOutcome<S>

where Self: Sized, I: IntoIterator<Item = &'a L>, L: 'a,

Derive state from an iterator of entries.

fn derive_filtered<'a, I, F>( &self, entries: I, context: &FoldContext, filter: F, ) -> FoldOutcome<S>

where Self: Sized, I: IntoIterator<Item = &'a L>, L: 'a, F: Fn(&L) -> bool,

Derive state with a filter.