Struct PriorityQueue 

pub struct PriorityQueue<const N: usize, T: Copy> { /* private fields */ }

A simple prioritized queue

Implementations

impl<const N: usize, T> PriorityQueue<N, T>

where T: Copy + Send,

pub const fn new() -> Self

Create a new PriorityQueue

pub fn push(&self, prio: u32, item: T) -> Result<(), T>

Write an item to the queue

Arguments

• prio: The priority of the item. Lower priority values will be read first. Bit 31 is reserved and must always be zero, so the maximum priority value is (2**31-1)
• item: The item to queue

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

Remove the queue item with the lowest priority value

Returns: The item with the lowest priority value in the queue, or None if the queue is empty

Trait Implementations

impl<const N: usize, T: Debug + Copy> Debug for PriorityQueue<N, T>

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

Formats the value using the given formatter.

impl<const N: usize, T: Copy + Send> Default for PriorityQueue<N, T>

fn default() -> Self

Returns the “default value” for a type.