Struct EmbeddingIndex 

pub struct EmbeddingIndex { /* private fields */ }

Mmap-backed embedding index for fast semantic lookup.

Implementations

impl EmbeddingIndex

pub fn open(path: &Path) -> Option<Self>

Open an existing embeddings.bin file (sparse format).

pub fn block_count(&self) -> usize

Number of stored (embedded) blocks.

pub fn embedding(&self, block_idx: usize) -> Option<&[f32]>

Get the embedding for a block index (zero-copy mmap access).

pub fn dim(&self) -> usize

Embedding dimension.

pub fn max_depth(&self) -> u8

Max depth that was embedded.

pub fn search(&self, query_emb: &[f32], k: usize) -> Vec<(f32, usize)>

Search for top-k most similar blocks to query embedding. Returns Vec<(similarity, block_index)> sorted descending.

pub fn all_block_ids(&self) -> &[u32]

Every stored block id, in ascending order.

Exposed for diagnostics that reason about the whole embedded set (a depth histogram, a per-block score) rather than a top-k slice of it.

pub fn similarity_of(&self, block_idx: usize, query_emb: &[f32]) -> Option<f32>

Cosine similarity of one stored block against a query embedding.

pub fn full_rank_of( &self, block_idx: usize, query_emb: &[f32], ) -> Option<(usize, f32)>

Rank of a stored block within the full untruncated cosine ordering.

Diagnostics only. This separates “the embedding is bad” from “the top-k is crowded out”: a block with a high score at a high rank is being drowned by redundant neighbours, not poorly represented.