Struct PriorityQueue 

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

Typed, stable priority queue for host-controlled execution.

The queue never executes values itself. Lower numeric priorities are scheduled first, and insertion order is preserved within each priority.

Implementations

impl<T> PriorityQueue<T>

pub fn new() -> Self

Create an empty queue.

pub fn len(&self) -> usize

Number of pending values.

pub fn is_empty(&self) -> bool

Whether the queue has no pending values.

pub fn push(&mut self, priority: Priority, value: T) -> u64

Submit a value and return its stable insertion sequence.

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

Claim the highest-priority pending value.

pub fn restore(&mut self, item: PriorityItem<T>)

Return a previously claimed item without changing its original FIFO position. This is intended for admission failures and other cases where execution never acquired ownership of the work.

pub fn ordered(&self) -> Vec<&PriorityItem<T>>

Borrow pending items in the exact order in which they will be claimed.

pub fn clear(&mut self)

Remove all pending values.

Trait Implementations

impl<T: Debug> Debug for PriorityQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for PriorityQueue<T>

fn default() -> Self

Returns the “default value” for a type.