Type Alias PrioQueue 

pub type PrioQueue<T> = BinaryHeap<T>;

Min-Heap

This sequencer is used for the Best-First-Algorithms in minimization problems.

Aliased Type

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

Trait Implementations

impl<T> NodeSequencer<T> for PrioQueue<T>

where T: Ord,

fn is_ordered(&self) -> bool

Returns true if the sequence is ordered and minimum/maximum matter.

fn init(item: T) -> Self

Initializes the sequencer with a starting object as the first element.

fn push(&mut self, item: T)

Pushes a given element onto the sequencer.

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

Pops the highest-order-priority element from the sequencer and returns it as an Option<T>. Returns None if the sequencer was empty.

fn len(&self) -> usize

Returns the number of elements in the sequencer.

fn to_vec(self) -> Vec<T>

Consumes the sequencer and returns a Vec<T> with all remaining objects in the sequencer.

fn from_vec(items: Vec<T>) -> Self

Creates a sequencer from a Vec<T>. Note that elements will most likely be pushed into the sequencer in the given order in the vector.

fn is_empty(&self) -> bool

Returns true if the length is zero

fn convert_from<S>(other: S) -> Self

where S: NodeSequencer<T>,

Consumes a foreign sequencer to create a new sequencer of this type.

fn pop_until_satisfied<F>(&mut self, f: F) -> Option<T>

where F: Fn(&T) -> bool,

Keeps popping elements from the sequencer until a condition is met or the sequencer is empty.