Queue

A queue follows first in, first out (FIFO). The item that arrives first is the item removed first, like people waiting in line.

The duplicate check from Set protects intake. Once a routine player report is accepted, the support team needs a separate rule: assign the oldest waiting report first.

waiting_items = empty queue
enqueue "first" into waiting_items
next_item = dequeue from waiting_items

Enqueue and dequeue are usually O(1) when the queue uses a suitable implementation. Queues model work assignments, message processing, print jobs, and breadth-first search.

The queue intentionally ignores priority. Duplicate prevention and assignment order remain separate operations.

See Queue examples for runnable examples in supported programming languages.