Struct VectorMerger 

pub struct VectorMerger { /* private fields */ }

Merges k-NN results from multiple shards.

Standard algorithm: collect all shard-local top-K results, sort globally by distance, return the top-K. Over-fetch factor is handled per-shard (each shard returns top_k * over_fetch_factor to account for filter reduction).

Implementations

impl VectorMerger

pub fn new(expected_shards: usize) -> Self

pub fn add_shard_result(&mut self, result: &ShardSearchResult)

Add a shard’s search results.

pub fn all_responded(&self) -> bool

Whether all expected shards have responded.

pub fn top_k(&mut self, top_k: usize) -> Vec<VectorHit>

Merge all shard results and return the global top-K.

Sorts by distance ascending (nearest first) and truncates to top_k. Ties are broken by shard_id for deterministic ordering.

pub fn total_hits(&self) -> usize

Number of total hits collected (before merge).

pub fn response_count(&self) -> usize

Number of shards that responded.