Constructs a new LimitedCapacityQueue.
The number of items the queue can hold.
The number of elements in the queue.
Whether the queue is full (adding any new items will cause removing existing ones).
Adds an item to the back of the queue. If the queue is holding maximum elements at the point of addition, the item at the front of the queue will be removed.
The item to be added to the back of the queue.
An indexed queue with limited capacity. Respects first-in-first-out insertion order.