Method insert

src/common/top_m.rs:19–26

(&mut self, v: T)

    }

    pub fn insert(&mut self, v: T) {
        self.pq.enqueue(v);
        // remove minimum if m+1 entries on the PQ
        if self.pq.len() > self.m {
            let _ = self.pq.dequeue();
        }
        // top m entries are on the PQ
    }

    pub fn into_vec(mut self) -> Vec<T> {
        let mut vec = Vec::with_capacity(self.m);