Struct DiskANNIndex 

pub struct DiskANNIndex { /* private fields */ }

DiskANN index for large-scale vector search

Implementations

impl DiskANNIndex

pub fn new(config: DiskANNConfig) -> Self

Create a new DiskANN index

pub fn with_defaults(dimension: usize) -> Self

Create with default configuration

pub fn create(&mut self, path: impl AsRef<Path>) -> Result<()>

Create index file on disk

pub fn load(path: impl AsRef<Path>) -> Result<Self>

Load existing index from disk

pub fn insert(&mut self, cid: &Cid, vector: &[f32]) -> Result<()>

Insert a vector using Vamana algorithm

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

Search for k nearest neighbors using greedy search

pub fn stats(&self) -> DiskANNStats

Get index statistics

pub fn is_loaded(&self) -> bool

Check if index is loaded

pub fn config(&self) -> &DiskANNConfig

Get configuration

pub fn save(&self) -> Result<()>

Save index to disk (persist all in-memory data)

pub fn flush(&self) -> Result<()>

Flush changes to disk

pub fn compact(&mut self) -> Result<CompactionStats>

Compact the index by removing fragmentation

This method:

• Removes gaps in the ID space
• Rebuilds the graph with contiguous IDs
• Optimizes memory layout

pub fn prune_graph(&mut self, quality_threshold: f32) -> Result<usize>

Prune the graph to remove low-quality edges

This helps reduce memory usage and can improve query performance by removing edges that don’t contribute to search quality.

pub fn len(&self) -> usize

Get number of vectors in the index

pub fn is_empty(&self) -> bool

Check if index is empty