A small counting gate: at most capacity() holders at once, waiters served
by priority rank then FIFO, and a waiter whose signal aborts leaves the
queue at once.
The primitive behind the OPFS read gate. It is deliberately NOT the fetch
gate's engine: that one also widens per origin, caps a speculative share,
raises a queued request's class in place and dispatches by width tier —
see the "Queues and what they honour" table in utils/README.md for
which queue does what.
A small counting gate: at most
capacity()holders at once, waiters served by priority rank then FIFO, and a waiter whose signal aborts leaves the queue at once.The primitive behind the OPFS read gate. It is deliberately NOT the fetch gate's engine: that one also widens per origin, caps a speculative share, raises a queued request's class in place and dispatches by width tier — see the "Queues and what they honour" table in
utils/README.mdfor which queue does what.