Struct FilteredDiskANN 

pub struct FilteredDiskANN<D>
where
    D: Distance<f32> + Send + Sync + Copy + Clone + 'static,
{ /* private fields */ }

DiskANN index with metadata filtering support

Implementations

impl<D> FilteredDiskANN<D>

where D: Distance<f32> + Send + Sync + Copy + Clone + Default + 'static,

pub fn build( vectors: &[Vec<f32>], labels: &[Vec<u64>], base_path: &str, ) -> Result<Self, DiskAnnError>

Build a new filtered index

pub fn build_with_params( vectors: &[Vec<f32>], labels: &[Vec<u64>], base_path: &str, params: DiskAnnParams, ) -> Result<Self, DiskAnnError>

Build with custom parameters

pub fn open(base_path: &str) -> Result<Self, DiskAnnError>

Open an existing filtered index

impl<D> FilteredDiskANN<D>

where D: Distance<f32> + Send + Sync + Copy + Clone + 'static,

pub fn search_filtered( &self, query: &[f32], k: usize, beam_width: usize, filter: &Filter, ) -> Vec<u32>

Search with a filter predicate

Uses an expanded beam search that skips non-matching candidates but continues exploring the graph to find matches.

pub fn search_filtered_with_dists( &self, query: &[f32], k: usize, beam_width: usize, filter: &Filter, ) -> Vec<(u32, f32)>

Search with filter, returning distances

pub fn search_filtered_batch( &self, queries: &[Vec<f32>], k: usize, beam_width: usize, filter: &Filter, ) -> Vec<Vec<u32>>

Parallel batch filtered search

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

Unfiltered search (delegates to base index)

pub fn get_labels(&self, id: usize) -> Option<&[u64]>

Get labels for a vector

pub fn inner(&self) -> &DiskANN<D>

Get the underlying index

pub fn num_vectors(&self) -> usize

Number of vectors in the index

pub fn num_fields(&self) -> usize

Number of label fields per vector

pub fn count_matching(&self, filter: &Filter) -> usize

Count vectors matching a filter (useful for selectivity estimation)