Enum SearchMode 

pub enum SearchMode<'a> {
    FlatScan {
        filter: Option<SearchPredicate<'a>>,
    },
    Graph {
        filter: Option<SearchPredicate<'a>>,
    },
    InlineFilter {
        filter: Box<dyn QueryLabelProvider<u32> + 'a>,
        adaptive_l: Option<AdaptiveL>,
    },
    DiverseGraph {
        filter: Option<SearchPredicate<'a>>,
        params: DeterminantDiversityParams,
    },
}

Top-level disk search mode.

Three variants encode the algorithm + filter combination:

• FlatScan — brute-force linear scan, with or without an inline filter.
• Graph — plain greedy beam search; the optional filter is applied as a hard post-filter during reranking (no traversal-time effect).
• InlineFilter — label-filtered graph search; the predicate is consulted at visit time (not just during rerank). adaptive_l = Some(_) grows the beam mid-search if the observed match specificity is low.
• DiverseGraph — greedy graph search with determinant-diversity post-processing; selects a maximally diverse top-k from the candidate pool using DeterminantDiversityParams. Optional hard post-filter is applied during the diversity selection step.

Variants

FlatScan

Fields

filter: Option<SearchPredicate<'a>>

Graph

Fields

filter: Option<SearchPredicate<'a>>

InlineFilter

Fields

filter: Box<dyn QueryLabelProvider<u32> + 'a>

adaptive_l: Option<AdaptiveL>

DiverseGraph

Fields

filter: Option<SearchPredicate<'a>>

params: DeterminantDiversityParams

Implementations

impl<'a> SearchMode<'a>

pub fn flat() -> Self

Flat scan over all vectors. Recall baseline.

pub fn flat_filtered<F>(predicate: F) -> Self

where F: Fn(&u32) -> bool + Send + Sync + 'a,

Flat scan restricted to vectors that satisfy predicate.

pub fn graph() -> Self

Plain greedy graph search; no filter.

pub fn graph_filtered<F>(predicate: F) -> Self

where F: Fn(&u32) -> bool + Send + Sync + 'a,

Plain greedy graph search with a hard post-filter applied during reranking. Traversal is unaffected.

pub fn inline_filter<F>(predicate: F, adaptive_l: Option<AdaptiveL>) -> Self

where F: Fn(&u32) -> bool + Send + Sync + 'a,

Inline label-filtered graph search. adaptive_l = Some(_) enables mid-search beam widening; None runs inline tracking only (no resizing).

The closure is wrapped in a generic adapter (FnLabelProvider<F>) that implements QueryLabelProvider<u32>.

pub fn diverse_graph(params: DeterminantDiversityParams) -> Self

Greedy graph search with determinant-diversity post-processing. Selects a diverse top-k from the candidate pool found at L.

pub fn diverse_graph_filtered<F>( predicate: F, params: DeterminantDiversityParams, ) -> Self

where F: Fn(&u32) -> bool + Send + Sync + 'a,

Greedy graph search with determinant-diversity post-processing and a hard post-filter. The filter is honored during the diverse-selection step (non-matching IDs are excluded from the final top-k).