Struct PriorityQueue 

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

Binary heap implementation of Queue.

Implementations

impl<T: Ord> PriorityQueue<T>

pub fn bounded(capacity: usize) -> Self

Creates a new queue with limited capacity.

Trait Implementations

impl<T: Ord> Default for PriorityQueue<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Ord> Queue for PriorityQueue<T>

type Item = T

Type of elements held by the queue.

fn push(&mut self, value: T) -> Result<(), PushError>

Add an element to the queue.

fn pop(&mut self) -> Option<T>

Removes the next element and returns it, or None if the Queue is empty.

fn len(&self) -> usize

Returns the number of elements in the queue.

fn is_empty(&self) -> bool

Returns true if there are no elements in the queue.