Module deque 

Core Queue / Deque implementation

Uses a BTreeMap keyed by monotonically increasing sequence numbers for FIFO ordering. For priority mode, keys are (Reverse(priority), sequence) to ensure highest-priority messages are dequeued first.

Structs

QueueMessage

A message in the queue

QueueStore

Core queue data structure supporting FIFO, LIFO, and priority modes.

Enums

QueueError

Queue errors

QueueSide

Which end of the queue to push/pop from