Class TopM

src/common/top_m.rs:6–9

Find the largest M integers. This implementation uses a MinPQ of size at most m + 1 to identify the M largest elements.

/// This implementation uses a MinPQ of size
/// at most m + 1 to identify the M largest elements.
pub struct TopM<T> {
    pq: PQ<T>,
    m: usize,
}

impl<T: PartialOrd + Default> TopM<T> {
    pub fn new(m: usize) -> Self {