Struct SearchPolicy 

pub struct SearchPolicy {
    pub expansion: usize,
    pub routing_probes: usize,
}

Per-query approximation policy.

Increasing expansion explores more graph nodes. Increasing routing_probes recovers more candidates from nearby deterministic routing buckets, which is useful when graph expansion alone no longer improves recall.

Fields

expansion: usize

Minimum number of graph candidates retained per replica.

routing_probes: usize

Number of deterministic routing buckets probed after graph traversal.

Values from 1 through Self::MAX_ROUTING_PROBES are supported.

Implementations

impl SearchPolicy

pub const MAX_ROUTING_PROBES: usize = VECTOR_MAX_ROUTING_PROBES

Largest supported routing recovery width.

pub const fn new(expansion: usize) -> Self

Creates the low-overhead default policy used by crate::VectorIndex::search.

pub const fn high_recall(expansion: usize) -> Self

Creates a stronger deterministic recovery policy for recall-sensitive queries.

pub const fn with_routing_probes(self, routing_probes: usize) -> Self

Changes only the routing recovery width.

Trait Implementations

impl Clone for SearchPolicy

fn clone(&self) -> SearchPolicy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for SearchPolicy

impl Debug for SearchPolicy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for SearchPolicy

impl PartialEq for SearchPolicy

fn eq(&self, other: &SearchPolicy) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SearchPolicy