Struct TopK 

pub struct TopK<T: Ord, const K: usize> { /* private fields */ }

Maintains the top K elements seen so far (by Ord), using a bounded min-heap.

Internally keeps a BinaryHeap<Reverse<T>> so peek() returns the current minimum among the kept items.

Implementations

impl<T: Ord, const K: usize> TopK<T, K>

pub fn new() -> Self

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

Pushes an item, keeping only the top K items seen so far.

pub fn into_sorted_iter_ascending(self) -> impl Iterator<Item = T>

Consumes self and returns an iterator yielding items in ascending order.

This uses BinaryHeapExtensions::into_sorted_iter, which pops from the underlying heap.

Trait Implementations

impl<T: Clone + Ord, const K: usize> Clone for TopK<T, K>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Default + Ord, const K: usize> Default for TopK<T, K>

fn default() -> Self

Returns the “default value” for a type.