Struct NaiveMemCube 

pub struct NaiveMemCube<G, V, E> {
    pub graph: G,
    pub vec_store: V,
    pub embedder: E,
    pub default_scope: String,
}

MemCube that composes a graph store, vector store, and embedder for add/search.

Fields

graph: G

vec_store: V

embedder: E

default_scope: String

Default scope for new memories (e.g. LongTermMemory).

Implementations

impl<G, V, E> NaiveMemCube<G, V, E>

where G: GraphStore + Send + Sync, V: VecStore + Send + Sync, E: Embedder + Send + Sync,

pub fn new(graph: G, vec_store: V, embedder: E) -> Self

Trait Implementations

impl<G, V, E> MemCube for NaiveMemCube<G, V, E>

where G: GraphStore + Send + Sync, V: VecStore + Send + Sync, E: Embedder + Send + Sync,

fn add_memories<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 ApiAddRequest, ) -> Pin<Box<dyn Future<Output = Result<MemoryResponse, MemCubeError>> + Send + 'async_trait>>

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

Add memories from request; returns MemoryResponse.

fn search_memories<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 ApiSearchRequest, ) -> Pin<Box<dyn Future<Output = Result<SearchResponse, MemCubeError>> + Send + 'async_trait>>

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

Search memories from request; returns SearchResponse.

fn update_memory<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 UpdateMemoryRequest, ) -> Pin<Box<dyn Future<Output = Result<UpdateMemoryResponse, MemCubeError>> + Send + 'async_trait>>

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

Update an existing memory (partial fields); re-embeds if memory text changed.

fn forget_memory<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 ForgetMemoryRequest, ) -> Pin<Box<dyn Future<Output = Result<ForgetMemoryResponse, MemCubeError>> + Send + 'async_trait>>

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

Forget (soft or hard delete) a memory.

fn get_memory<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 GetMemoryRequest, ) -> Pin<Box<dyn Future<Output = Result<GetMemoryResponse, MemCubeError>> + Send + 'async_trait>>

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

Get a single memory by id (within user/cube scope).

fn graph_neighbors<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 GraphNeighborsRequest, ) -> Pin<Box<dyn Future<Output = Result<GraphNeighborsResponse, MemCubeError>> + Send + 'async_trait>>

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

Query graph neighbors for one memory id.

fn graph_path<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 GraphPathRequest, ) -> Pin<Box<dyn Future<Output = Result<GraphPathResponse, MemCubeError>> + Send + 'async_trait>>

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

Query shortest path between two memory nodes.

fn graph_paths<'life0, 'life1, 'async_trait>( &'life0 self, req: &'life1 GraphPathsRequest, ) -> Pin<Box<dyn Future<Output = Result<GraphPathsResponse, MemCubeError>> + Send + 'async_trait>>

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

Query top-k shortest paths between two memory nodes.