Struct SemanticIndex 

pub struct SemanticIndex { /* private fields */ }

Implementations

impl SemanticIndex

pub fn load_or_create(path: &Path) -> Self

pub fn has(&self, node_id: &str) -> bool

pub fn insert(&mut self, node_id: String, vec: Vec<f32>)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn retain_ids(&mut self, live_ids: &HashSet<String>) -> usize

Drop vectors whose node ID is not in live_ids. Node UUIDs regenerate on every re-index, so without pruning the index file grows with orphaned vectors that can still surface as (unresolvable) hits. Returns the number of vectors removed.

pub fn save(&self)

pub fn top_k(&self, query_vec: &[f32], k: usize) -> Vec<String>

Return up to k node IDs with cosine similarity ≥ SIMILARITY_THRESHOLD. Query vector need not be pre-normalised — normalised internally.