Bounded FIFO admission and worker-availability behavior.
Availability is a one-dispatch capability. It immediately consumes the
oldest waiting value or joins a unique FIFO of available workers. Submission
consumes the oldest worker or enters the bounded FIFO; at capacity it
returns the owned value. Duplicate availability and withdrawal are
idempotent. Initialization is empty, no actors are created, and the host
never terminates by policy. FIFO selection and bounded admission are Bombay
policy. Worker execution, mailbox admission, and physical backpressure are
runtime responsibilities. Naming its protocol requires only typed routes;
running the queue requires cloneable, comparable worker routes for state
inspection and duplicate availability checks. No transition has a semantic
panic condition.
Consume this definition, perform its one initialization fold, and
return the active behavior together with the ordered initialization
effects. Read more