Module queue

Homogeneous data structures that process elements in FIFO order.

Elements are typically added at one end (the “tail” or “back”) and removed from the other (the “head” or “front”).

Variants like double-ended queues (deques) allow insertion and removal at both ends, providing additional flexibility.

Structs

BinaryHeapalloc

📦 alloc A priority queue implemented with a binary heap.

Destaque

📦 A static double-ended queue and stack backed by an Array.

DestaqueIter

🔄 An iterator over Destaque elements.

VecDequealloc

📦 alloc A double-ended growable queue.

Traits

DataDeque

📦 An abstract double-ended queue data type.

DataQueue

📦 An abstract queue data type.

Type Aliases

DestaqueU8_destaque_u8

📦 A Destaque with an 8-bit index size.