Struct PriorityQueue 

pub struct PriorityQueue { /* private fields */ }

Priority queue for events.

Maintains events in priority order with FIFO ordering for events of the same priority. Thread-safe via internal mutex.

Ordering

Events are ordered by:

1. Priority (lower value = higher precedence)
2. Insertion order (earlier = higher precedence)

This ensures that high-priority events (like user input) are always processed before low-priority events (like render signals).

Implementations

impl PriorityQueue

pub fn new() -> Self

Create a new priority queue with default capacity.

pub fn with_capacity(capacity: usize) -> Self

Create a priority queue with specified capacity.

A capacity of 0 means unlimited (not recommended).

pub fn push(&self, event: DynEvent) -> bool

Push an event onto the queue.

Returns false if capacity is exceeded (event is dropped).

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

Pop the highest priority event.

Returns None if the queue is empty.

pub fn peek_priority(&self) -> Option<u32>

Peek at the priority of the next event without removing it.

Returns None if the queue is empty.

pub fn len(&self) -> usize

Get the number of events in the queue.

pub fn is_empty(&self) -> bool

Check if the queue is empty.

pub const fn capacity(&self) -> usize

Get the queue capacity.

pub fn clear(&self)

Clear all events from the queue.

pub fn drain(&self) -> Vec<DynEvent>

Drain all events from the queue in priority order.

Returns events sorted by priority (highest first).

Trait Implementations

impl Debug for PriorityQueue

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

Formats the value using the given formatter.

impl Default for PriorityQueue

fn default() -> Self

Returns the “default value” for a type.