Struct InterferenceDetector 

pub struct InterferenceDetector { /* private fields */ }

Detector for memory interference effects

Implementations

impl InterferenceDetector

pub fn new() -> Self

pub fn check_interference( &mut self, new_memory_id: &str, new_memory_importance: f32, _new_memory_created: DateTime<Utc>, similar_memories: &[(String, f32, f32, DateTime<Utc>, String)], ) -> InterferenceCheckResult

Check for interference when storing a new memory

Compares the new memory’s embedding against existing memories and determines interference effects.

pub fn apply_retrieval_competition( &mut self, candidates: &[(String, f32, f32)], query_preview: &str, ) -> CompetitionResult

Apply retrieval competition between similar memories

When multiple similar memories are retrieved, they compete for activation. Stronger memories suppress weaker ones.

pub fn get_history(&self, memory_id: &str) -> Option<&Vec<InterferenceRecord>>

Get interference history for a memory

pub fn stats(&self) -> (usize, usize)

Get statistics

pub fn clear_memory(&mut self, memory_id: &str)

Clear history for a deleted memory

pub fn calculate_retrieval_adjustment( &self, memory_id: &str, current_activation: f32, ) -> f32

Calculate retrieval score adjustment based on interference history

This implements Anderson’s retrieval-induced forgetting (RIF) theory:

• Memories with high interference that maintained activation → BOOST (survivors)
• Memories with high interference and low activation → SUPPRESS (chronic losers)

Arguments

• memory_id - The memory to score
• current_activation - Current importance/activation level (0.0-1.0)

Returns

Score adjustment factor:

• 1.0: boost (multiply score)

• < 1.0: suppress (multiply score)
• 1.0: no adjustment

Research Reference

Anderson, M.C. & Neely, J.H. (1996). Interference and inhibition in memory retrieval. In E.L. Bjork & R.A. Bjork (Eds.), Memory (pp. 237-313).

pub fn batch_retrieval_adjustments( &self, memories: &[(String, f32)], ) -> HashMap<String, f32>

Batch calculate retrieval adjustments for multiple memories

Efficient for scoring entire result sets.

Arguments

• memories - Vec of (memory_id, current_activation)

Returns

HashMap of memory_id → adjustment factor

pub fn has_significant_interference(&self, memory_id: &str) -> bool

Check if a memory has significant interference history

Useful for deciding whether to apply interference adjustments.

pub fn load_history( &mut self, history: HashMap<String, Vec<InterferenceRecord>>, total_events: usize, )

Bulk load interference history from persistent storage on startup

Replaces the in-memory HashMap with persisted data. Called once during MemorySystem initialization.

pub fn get_affected_ids_from_check( &self, new_memory_id: &str, result: &InterferenceCheckResult, ) -> Vec<String>

Get memory IDs affected by a storage interference check

Returns IDs that had interference records modified, for targeted persistence.

pub fn get_affected_ids_from_competition( &self, result: &CompetitionResult, ) -> Vec<String>

Get memory IDs affected by retrieval competition

Returns IDs of all memories that had interference recorded (both suppressed and close survivors with score_ratio > 0.9).

pub fn get_records_for_ids<'a>( &'a self, ids: &'a [String], ) -> Vec<(&'a str, &'a Vec<InterferenceRecord>)>

Get interference records for specific memory IDs (for targeted persistence)

Trait Implementations

impl Default for InterferenceDetector

fn default() -> Self

Returns the “default value” for a type.