A simple FIFO queue implemented as a list with extra bookkeeping for efficiency.
Removes (and returns) the first item in an ordered
Removes all items from the container and returns nil.
Deletes each item in the list from the container.
Returns true if this container type should rely on the default behavior of basic-initial-contents...
Adds each item in the list to the container in an
Adds each item in the sequence to the container in an
Destructively alters the elements/nodes of an ordered container so that they are reversed.