Infrastructure · Data Structures
Queue
Ordered container with FIFO/LIFO/priority discipline and explicit dequeue semantics
Definition
Mechanism
A linear container holding Tasks or Messages under an explicit ordering discipline (FIFO, LIFO, or Priority). Consumers dequeue one element at a time; producers enqueue at the discipline-dictated position. Distinct from a Stream (continuous, unbounded, with no single consumer) and from a plain list (no consumer semantics).
Invariants
None stated.
Risks
Failure modes
None stated.
Relationships
Builds on
Used by
References
Mind
Width-limited heuristic search
Reference
Data schema
{
"type": "object",
"required": [
"queue_id",
"items",
"policy"
],
"properties": {
"queue_id": {
"type": "string"
},
"items": {
"type": "array",
"items": {
"type": "object",
"description": "Enqueued Task or Message objects"
}
},
"policy": {
"type": "string",
"enum": [
"FIFO",
"LIFO",
"Priority"
],
"default": "FIFO"
},
"capacity": {
"type": "integer"
},
"metrics": {
"type": "object",
"properties": {
"depth": {
"type": "integer"
},
"average_wait_time": {
"type": "number"
}
}
}
}
}