Struct VectorTopK 

pub struct VectorTopK<K> { /* private fields */ }

Bounded deterministic lower-is-better vector hit accumulator.

This is the streaming form of exact_vector_top_k. It keeps only the current best k hits in memory, so graph-layer exact scans can avoid materializing every candidate before ranking.

Implementations

impl<K: Ord> VectorTopK<K>

pub fn new(k: usize) -> Self

Construct an empty accumulator that will retain at most k hits.

pub const fn k(&self) -> usize

Return the configured result cap.

pub fn len(&self) -> usize

Return the number of retained hits.

pub fn is_empty(&self) -> bool

Return true when no hits are retained.

pub fn push_distance(&mut self, key: K, distance: f64)

Push one candidate distance into the accumulator.

distance must be a finite lower-is-better score produced by VectorMetric::distance or an equivalent metric kernel. Ties are deterministic: lower distance wins, then lower key wins.

pub fn into_hits(self) -> Vec<VectorSearchHit<K>>

Return retained hits sorted best-first.

Trait Implementations

impl<K: Debug> Debug for VectorTopK<K>

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

Formats the value using the given formatter.