Skip to main content

GraphAwareLongTerm

Struct GraphAwareLongTerm 

Source
pub struct GraphAwareLongTerm { /* private fields */ }
Expand description

Graph-first RAG composer over a FilterableLongTermMemory vector store + a KnowledgeGraph + an EntityExtractor.

Provenance recording is not the composer’s responsibility — wrap the graph argument in crate::ProvenanceKnowledgeGraph at construction time to emit signed chain entries on every graph.index() call (ADR-038).

Implementations§

Source§

impl GraphAwareLongTerm

Source

pub fn new( vector: Arc<dyn FilterableLongTermMemory>, graph: Arc<dyn KnowledgeGraph>, extractor: Arc<dyn EntityExtractor>, metrics: Arc<RecallMetrics>, ) -> Self

Build with the default min_graph_hits = 1 threshold.

Source

pub fn with_min_graph_hits(self, n: usize) -> Self

Override the minimum candidate count required to take the graph path. When graph.neighbors() returns fewer than n FactIds, recall falls back to pure vector. Default is 1.

Source

pub fn builder() -> GraphAwareLongTermBuilder

Capability-shaped builder facade — defaults the extractor to BuiltinExtractor (regex over caller hints + typed-id patterns) and the metrics to a fresh RecallMetrics.

let long_term = GraphAwareLongTerm::builder().build(vector, graph);

Override defaults via the builder’s setters; pass the authoritative vector store + graph at GraphAwareLongTermBuilder::build time since both are required.

Source

pub async fn recall_traced( &self, scope: Scope, query: &str, k: usize, ) -> Result<RecallTrace, MemoryError>

The “why did retrieval return this?” trace behind one recall call.

Runs the exact same Self::recall_core that LongTermMemory::recall uses, then additionally fetches KnowledgeGraph::recall_paths for display. Production recall never issues that second graph call — this method is the only path that pays for it.

Records no RecallMetrics — it’s a debug/introspection call, not production recall traffic.

Trait Implementations§

Source§

impl LongTermMemory for GraphAwareLongTerm

Source§

fn remember<'life0, 'async_trait>( &'life0 self, scope: Scope, fact: Fact, ) -> Pin<Box<dyn Future<Output = Result<FactId, MemoryError>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Store a fact under scope. Returns a stable id.
Source§

fn recall<'life0, 'life1, 'async_trait>( &'life0 self, scope: Scope, query: &'life1 str, k: usize, ) -> Pin<Box<dyn Future<Output = Result<Vec<Fact>, MemoryError>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Top-k semantic recall under scope for the supplied query.
Source§

fn forget<'life0, 'async_trait>( &'life0 self, id: FactId, ) -> Pin<Box<dyn Future<Output = Result<(), MemoryError>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Remove a stored fact.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more