previous
|
index
|
next
A New Representation Invariant
0 ≤
queue_length
≤
cells_length
0 ≤
start
<
cells_length
For each
i
in the range
0 ≤
i
<
queue_length
, the element that is
i
elements after the head of the queue is stored in
cells
[(
start
+
i
) mod
cells_length
]
.
previous
|
index
|
next