Struct MemoryVectorIndex 

pub struct MemoryVectorIndex { /* private fields */ }

An exact, brute-force in-memory vector index.

All vectors must share the same dimension once the first entry is inserted. Cosine similarity is used for scoring; results are ordered by descending score with ties broken by [RecordKey] ordering (lexicographic), making results deterministic.

Implementations

impl MemoryVectorIndex

pub fn new() -> Self

Create an empty index.

Trait Implementations

impl Default for MemoryVectorIndex

fn default() -> MemoryVectorIndex

Returns the “default value” for a type.

impl VectorIndex for MemoryVectorIndex

fn upsert<'life0, 'async_trait>( &'life0 self, key: RecordKey, vector: Vec<f32>, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Insert or replace the vector for key.

fn remove<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 RecordKey, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Remove key if present (no error if absent).

fn query<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, query: &'life1 [f32], k: usize, filter: &'life2 KeyPrefix, ) -> Pin<Box<dyn Future<Output = Result<Vec<Match>>> + Send + 'async_trait>>

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

Return the top-k matches to query, restricted to keys matching filter, ordered by descending score.