A first-in-first-out (FIFO) queue implemented with an array. This array-based implementation is optimized for performance. Entries can be added/removed to/from the queue in amortized constant time. The cost of adding/removing N entries to/from the queue is O(N), and the constant factor is less t
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected