Struct IndexAwareTopK 

pub struct IndexAwareTopK<T, F>
where
    F: Fn(&T, &T) -> Ordering,
{ /* private fields */ }

Top-K with index awareness

When the index only partially matches the ORDER BY (e.g., index on col1 but ORDER BY col1, col2), we can still use the index for the first column and apply top-K for the rest.

Implementations

impl<T, F> IndexAwareTopK<T, F>

where F: Fn(&T, &T) -> Ordering,

pub fn new(k: usize, secondary_cmp: F) -> Self

Create new index-aware top-K

pub fn push(&mut self, item: T, same_index_key_as_previous: bool)

Process an item from an index-ordered scan

Items must be provided in index order. When the index key changes, the previous batch is finalized.

pub fn is_complete(&self) -> bool

Check if we have enough results

pub fn into_result(self) -> Vec<T>

Drain into final result