A ring queue is a queue that has a fixed capacity. When the queue is full, the oldest element is removed to make room for the new element. Reading from a ring queue will return the oldest element and effectively remove it from the queue.
Private
Readonly
Adds an element to the queue.
the element to add
Clears the queue, removing all elements.
Calls the given function for each element in the queue.
the function to call
Whether the queue is empty.
true if the queue is empty, false otherwise
Number of elements in the queue.
the number of elements in the queue
Returns the next element in the queue without removing it.
the next element in the queue, or undefined if the queue is empty
Removes and returns the next element in the queue.
Generated using TypeDoc
A ring queue is a queue that has a fixed capacity. When the queue is full, the oldest element is removed to make room for the new element. Reading from a ring queue will return the oldest element and effectively remove it from the queue.