This module provides a simple mutable queue representation, first-in/first-out only. Operations on queues mutate it in a thread-unsafe way.
Produces an empty queue.
Adds an element to the back of a queue.
Removes an element from the front of a nonempty queue, and returns that element.
Returns an immutable list containing the elements of the queue in the order the elements were added.
Returns the number of elements in the queue.
Recognizes whether a queue is empty or not.
This predicate recognizes queues.
Returns a sequence whose elements are the elements of queue.
These contracts recognize queues; the latter requires the queue to contain at least one value.