Struct InMemoryPatternIndex 

pub struct InMemoryPatternIndex { /* private fields */ }

Brute-force in-memory implementation of PatternIndex.

Uses a Vec<PatternVector> with linear-scan cosine similarity. Adequate for small collections (<10K blocks); a real AgentDB deployment would use HNSW for sub-linear search.

Implementations

impl InMemoryPatternIndex

pub fn new() -> Self

Create a new empty index.

Trait Implementations

impl Default for InMemoryPatternIndex

fn default() -> Self

Returns the “default value” for a type.

impl PatternIndex for InMemoryPatternIndex

fn insert(&mut self, vec: &PatternVector)

Insert (or replace) a pattern vector.

fn search_nearest(&self, query: &[f32], k: usize) -> Vec<(BlockKey, f32)>

Return the k nearest neighbors to query, sorted by descending cosine similarity. Each result is (key, similarity).

fn remove(&mut self, key: BlockKey)

Remove the pattern for key, if present.

fn len(&self) -> usize

Number of pattern vectors currently stored.

fn is_empty(&self) -> bool

Returns true if the index contains no vectors.