Struct PriorityQueueData 

pub struct PriorityQueueData {
    pub items: Vec<ValueWord>,
}

Data for PriorityQueue variant — binary min-heap.

Items are ordered by their numeric value (via as_number_coerce()). For non-numeric items, insertion order is preserved as a FIFO fallback.

Fields

items: Vec<ValueWord>

Implementations

impl PriorityQueueData

pub fn new() -> Self

pub fn from_items(items: Vec<ValueWord>) -> Self

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

Push an item and sift up to maintain heap invariant.

pub fn pop(&mut self) -> Option<ValueWord>

Pop the minimum item (root) and restore heap invariant.

pub fn peek(&self) -> Option<&ValueWord>

Peek at the minimum item without removing.

Trait Implementations

impl Clone for PriorityQueueData

fn clone(&self) -> PriorityQueueData

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PriorityQueueData

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

Formats the value using the given formatter.