A FIFO queue over a growable array with amortized O(1) dequeue.
Entries are consumed via an index (instead of costly Array#shift calls),
and the consumed prefix is dropped once it dominates the array,
bounding the memory overhead to twice the live queue size.
A FIFO queue over a growable array with amortized O(1) dequeue. Entries are consumed via an index (instead of costly
Array#shiftcalls), and the consumed prefix is dropped once it dominates the array, bounding the memory overhead to twice the live queue size.