QueueEdit on GitHub
An immutable queue implementation. A queue is a FIFO (first-in-first-out) data structure where new values are added to the end and retrieved or removed from the beginning.
Creates a new queue.
Checks if the given queue contains no elements.
Some(item) with the next item in the queue, or
None if the queue is empty.
Adds an item to the end of the queue.
Removes the next item in the queue.
Computes the size of the input queue.