Struct InMemoryVectorStore 

pub struct InMemoryVectorStore { /* private fields */ }

In-memory vector store using brute-force cosine similarity. Suitable for MVP and small datasets (<100k entries).

Implementations

impl InMemoryVectorStore

pub fn new() -> Self

Create a new empty in-memory vector store.

Trait Implementations

impl Default for InMemoryVectorStore

fn default() -> Self

Returns the “default value” for a type.

impl VectorStore for InMemoryVectorStore

fn insert<'life0, 'async_trait>( &'life0 self, entry: MemoryEntry, ) -> Pin<Box<dyn Future<Output = ArgentorResult<()>> + Send + 'async_trait>>

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

Insert a memory entry.

fn search<'life0, 'life1, 'async_trait>( &'life0 self, query_embedding: &'life1 [f32], top_k: usize, session_filter: Option<Uuid>, ) -> Pin<Box<dyn Future<Output = ArgentorResult<Vec<SearchResult>>> + Send + 'async_trait>>

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

Search for the top-k most similar entries to a query embedding.

fn delete<'life0, 'async_trait>( &'life0 self, id: Uuid, ) -> Pin<Box<dyn Future<Output = ArgentorResult<bool>> + Send + 'async_trait>>

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

Delete a memory entry by ID.

fn list<'life0, 'async_trait>( &'life0 self, session_filter: Option<Uuid>, ) -> Pin<Box<dyn Future<Output = ArgentorResult<Vec<MemoryEntry>>> + Send + 'async_trait>>

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

List all entries (optionally filtered by session).

fn count<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = ArgentorResult<usize>> + Send + 'async_trait>>

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

Count entries.