Queue

An ordered, first-in-first-out (FIFO) collection

The Queue is implemented using a circular buffer, which allows for efficient enqueue and dequeue operations with a constant time complexity. To optimize performance, it utilizes an UnsafeMutablePointer instead of a standard Swift Array. The buffer automatically resizes to ensure optimal use of memory, by increasing the capacity when the number of elements in the queue reaches the current capacity, and reducing it when it drops below a quarter of the current capacity.