Struct PriorityQueue 

pub struct PriorityQueue<T: Ord> { /* private fields */ }

A min-priority queue.

Implementations

impl<T: Ord> PriorityQueue<T>

pub fn new(items: impl IntoIterator<Item = T>) -> Self

Create a new priority queue with the given items.

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

Add an item.

pub fn pop(&mut self) -> Result<T, Error>

Remove and return the smallest item.

pub fn peek(&self) -> Result<&T, Error>

Return the smallest item without removing it.

pub fn len(&self) -> usize

Return the number of items.

pub fn is_empty(&self) -> bool

Return whether the queue is empty.