Struct TopK 

pub struct TopK<T> { /* private fields */ }

Top-K tracking structure for incremental sorting

Implementations

impl<T> TopK<T>

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

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

Create a new top-k tracker

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

Push an item, maintaining only top k

pub fn items(&self) -> &[T]

Get current items

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

Take the items

pub fn len(&self) -> usize

Number of items

pub fn is_empty(&self) -> bool

Check if empty