type Queue

bend-collections@1.0.0.0 · src/containers/queue.bend:4

import Base

4# Two-list FIFO queue: front ++ reverse(back). Reverse back only when front
5# is empty. Enqueue/dequeue/peek are amortized O(1) on consumed histories.
6# length is cached; to_list is O(n). Independent of the deque and DLL.
7type Queue<-T: Data> is Type:
8  QU{front: List<&2, T>, back: List<&2, T>, count: Nat}