Method new_min_pq

src/common/priority_queue.rs:36–39

The MinPQ represents a priority queue of generic keys. It supports the usual insert and delete-the-minimum operations, along with methods for peeking at the minimum key, testing if the priority queue is empty, and iterating through the keys.

(cap: usize)

    /// testing if the priority queue is empty, and iterating through
    /// the keys.
    pub fn new_min_pq(cap: usize) -> Self {
        let comparator = Box::new(|a: &T, b: &T| a.gt(b));
        Self::new(cap, comparator)
    }

    /// The MaxPQ represents a priority queue of generic keys.
    /// It supports the usual insert and delete-the-max