Struct MinHeap 

pub struct MinHeap<P: Ord, V> { /* private fields */ }

A min-heap priority queue.

Implementations

impl<P: Ord, V> MinHeap<P, V>

pub fn new() -> Self

Create an empty heap.

pub fn push(&mut self, priority: P, value: V)

Push (priority, value) onto the heap.

pub fn pop(&mut self) -> Option<(P, V)>

Pop the minimum-priority element.

pub fn peek(&self) -> Option<(&P, &V)>

Peek at the minimum-priority element without removing it.

pub fn len(&self) -> usize

Return the number of elements.

pub fn is_empty(&self) -> bool

Return true if empty.

Trait Implementations

impl<P: Debug + Ord, V: Debug> Debug for MinHeap<P, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<P: Default + Ord, V: Default> Default for MinHeap<P, V>

fn default() -> MinHeap<P, V>

Returns the “default value” for a type.