The CircularQueue class allows for storing objects in a circular queue of a predefined size. Once the end of the queue has been reached, new item objects are inserted from the beginning, replacing earlier entries. Any object can be placed in the queue and the same object can occupy more than one position in the queue.

The collected objects can be processed in FIFO (first-in, first-out) or in a stack-like LIFO (last-in, first-out) order.