append-queue  (&rest queues)Create a new queue which appends the other queues. The original queues are
not changed.
copy-queue  (que)Copy a queue.
create  (&optional obj)Create a queue. If <obj> is non nil queue it up. In order to create a queue
with nil as the first element, call queue with no arguments and then call
enqueue with nil as the value to queue.
dequeue  (queue)Dequeue an object. Return the object queued.
do-nqueue  ((var que &optional result) &body body)Loop construct for queues that sets <var> to the successive values of the
queue, <que>, (by dequeuing) and then evaluates <body>. If the symbol <result>
is supplied, its value is returned when the iteration is finished.
Example: (rsm.queue:do-nqueue (item que) (format t "queue item = ~s~%" item))
This drains the queue, <que>, printing each of the elements of the queue.
Note: This is a destructive function. If <body> mutates <que>, this
construct could go into an infinite loop.
do-queue  ((var que &optional result) &body body)Loop construct for queues that sets <var> to the successive values of a copy
of the queue, <que>, (by dequeuing) and then evaluates <body>. If the symbol
<result> is supplied, its value is returned when the iteration is finished.
Example: (rsm.queue:do-queue (item que) (format t "queue item = ~s~%" item))
This drains a copy of the queue, <que>, printing each of the elements
of the queue.
empty-p  (queue)Is the queue empty?
enqueue  (obj queue)Enqueue an object. Return the queue.
get-first  (queue)Get the next element the queue would dequeue. Does not affect the queue.
get-last  (queue)Get the last element the queue would dequeue. Does not affect the queue.
list->queue  (list)Return a copy of the list as a queue.
nappend-queue  (&rest queues)Append (destructively (like nconc) the queues <queues> essentially by
nconsing the internal list of the first nonempty queue with the lists from the
rest of the non empty queues.
Note: After this operation, do not use the other queues.
nget-list  (queue)Get the internal list of queue, <queue>. The integrity of the queue cannot be
guaranteed if this list is destructively modified.
nsort-queue  (queue sort-func)Sort a queue, <queue>, in place using sort function <sort-func>.
queue->list  (que)Return a copy of the queue as a list, from 'first in' to 'last in'.
queue-p  (que)Returns true if <que> is a queue.
sort-queue  (queue sort-func)Sort a copy of queue, <queue>, using sort function <sort-func>. |