Struct MemoryGraph 

pub struct MemoryGraph {
    pub entries: HashMap<String, MemoryEntry>,
}

In-memory graph of memory entries keyed by ID.

Fields

entries: HashMap<String, MemoryEntry>

Implementations

impl MemoryGraph

pub fn new() -> Self

Create an empty memory graph.

pub fn load(path: &Path) -> Self

Load a graph from a JSON file. Returns an empty graph if the file is missing or unparseable, so a missing/corrupt store never blocks startup.

pub fn save(&self, path: &Path) -> Result<()>

Persist the graph to a JSON file (creating parent directories).

pub fn insert(&mut self, entry: MemoryEntry)

Insert a memory entry into the graph.

pub fn remember_keyed(&mut self, entry: MemoryEntry)

Insert an entry, deterministically superseding any active entry with the same key (latest-wins). Superseded entries are kept (active=false) for audit/restore — never hard-deleted. Unkeyed entries just insert.

pub fn list_all(&self) -> Vec<&MemoryEntry>

All entries (including inactive/superseded), newest first — for /memory --all and recovery.

pub fn restore(&mut self, id: &str) -> bool

Reactivate a previously superseded/deactivated entry by id. Clears its superseded_by link. Returns true if the entry existed.

pub fn get_mut(&mut self, id: &str) -> Option<&mut MemoryEntry>

Get a mutable reference to a memory entry by ID.

pub fn forget(&mut self, id: &str) -> bool

Permanently remove a memory entry by ID. Returns true if one was removed.

pub fn deactivate(&mut self, id: &str) -> bool

Soft-deactivate a memory entry by ID (marks inactive, keeps for audit). Returns true if the entry existed and was active.

pub fn prune(&mut self, max_entries: usize)

Bound the graph: drop expired entries first, then (if still over max_entries) the lowest effective-confidence ones, until at the cap. Keeps long-term memory and disk usage bounded on small servers.

pub fn search(&self, query: &str, limit: usize) -> Vec<&MemoryEntry>

Search active entries by lexical relevance (TF-IDF/BM25-lite over content+tags) blended with effective confidence, then truncate to limit. Dep-free (no vector store) — fits resource-constrained hosts. Multi-word / partial-overlap queries recall far better than a whole-query substring match. Falls back to whole-query substring for very short queries.

pub fn linked(&self, id: &str) -> Vec<&MemoryEntry>

Return all entries directly linked to the given entry.

pub fn supersede(&mut self, old_id: &str, new_id: &str)

Replace an old entry with a new one and create a bidirectional link.

pub fn decay_all(&mut self, amount: f32)

Decay confidence of all active entries by amount.

pub fn prune_inactive(&mut self) -> usize

Remove inactive entries that have not been accessed in 30 days.

pub fn neighbors(&self, id: &str, max_hops: usize) -> Vec<&MemoryEntry>

BFS traversal of reinforcement-related entries up to max_hops hops.

pub fn search_by_tag(&self, tag: &str) -> Vec<&MemoryEntry>

Search entries whose category or trust matches the given tag string.

pub fn prune_stale(&mut self, max_age_days: u64) -> usize

Remove external-trust entries not accessed within max_age_days.

Trait Implementations

impl Default for MemoryGraph

fn default() -> Self

Returns the “default value” for a type.