Struct ScoreCollector 

pub struct ScoreCollector {
    pub k: usize,
    /* private fields */
}

Efficient top-k collector using min-heap (internal, scoring-layer)

Maintains the k highest-scoring documents using a min-heap where the lowest score is at the top for O(1) threshold lookup and O(log k) eviction. No deduplication — caller must ensure each doc_id is inserted only once.

This is intentionally separate from TopKCollector in collector.rs: ScoreCollector is used inside MaxScoreExecutor where only (doc_id, score, ordinal) tuples exist — no Scorer trait, no position tracking, and the threshold must be inlined for tight block-max loops. TopKCollector wraps a Scorer and drives the full DocSet/Scorer protocol, collecting positions on demand.

Fields

k: usize

Implementations

impl ScoreCollector

pub fn new(k: usize) -> Self

Create a new collector for top-k results

pub fn threshold(&self) -> f32

Current score threshold (minimum score to enter top-k)

pub fn insert(&mut self, doc_id: DocId, score: f32) -> bool

Insert a document score. Returns true if inserted in top-k. Caller must ensure each doc_id is inserted only once.

pub fn insert_with_ordinal( &mut self, doc_id: DocId, score: f32, ordinal: u16, ) -> bool

Insert a document score with ordinal. Returns true if inserted in top-k. Caller must ensure each doc_id is inserted only once.

pub fn would_enter(&self, score: f32) -> bool

Check if a score could potentially enter top-k

pub fn len(&self) -> usize

Get number of documents collected so far

pub fn is_empty(&self) -> bool

Check if collector is empty

pub fn into_sorted_results(self) -> Vec<(DocId, f32, u16)>

Convert to sorted top-k results (descending by score)