Struct InMemoryGraph 

pub struct InMemoryGraph { /* private fields */ }

In-memory KnowledgeGraph backed by a petgraph StableGraph.

StableGraph preserves node/edge indices after removal — required for future forget() support without re-indexing every entry. The single Mutex<Inner> is acceptable for the spike scale; production traffic goes to Neo4jKnowledgeGraph (M2).

Trait Implementations

impl Default for InMemoryGraph

fn default() -> Self

Returns the “default value” for a type.

impl KnowledgeGraph for InMemoryGraph

fn index<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, scope: Scope, fact_id: &'life1 FactId, entities: &'life2 [EntityRef], text: &'life3 str, _valid_from: Option<DateTime<Utc>>, ) -> Pin<Box<dyn Future<Output = Result<(), MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Index a stored fact’s entities into the graph.

fn neighbors<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, scope: &'life1 Scope, entities: &'life2 [EntityRef], ) -> Pin<Box<dyn Future<Output = Result<Vec<FactId>, MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Return FactIds of facts reachable from entities via: (a) direct MENTIONED_IN edges, and (b) 1-hop CO_OCCURS siblings’ MENTIONED_IN edges.

fn recall_paths<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, scope: &'life1 Scope, entities: &'life2 [EntityRef], ) -> Pin<Box<dyn Future<Output = Result<Vec<RetrievalPath>, MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Return one crate::RetrievalPath per (entity, fact_id) edge reachable from entities via the same traversal as Self::neighbors. Each hop carries chain_entry: None; the ProvenanceKnowledgeGraph wrapper attaches provenance after the inner graph returns.

fn subgraph<'life0, 'life1, 'async_trait>( &'life0 self, scope: &'life1 Scope, limit: usize, ) -> Pin<Box<dyn Future<Output = Result<GraphView, MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Enumerate up to limit nodes of scope’s graph for browsing.

fn forget<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, scope: &'life1 Scope, fact_id: &'life2 FactId, ) -> Pin<Box<dyn Future<Output = Result<(), MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Remove a fact’s graph-side index entries. Paired with a Custom("MemoryForget") provenance event by ProvenanceKnowledgeGraph so the audit chain records the deletion even though the chain itself stays append-only.

fn index_many<'life0, 'life1, 'async_trait>( &'life0 self, scope: Scope, batch: &'life1 [IndexEntry], ) -> Pin<Box<dyn Future<Output = Result<(), MemoryError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Index a batch of facts under the same Scope in one call.