These are ordinary first-in, first-out queues.
The procedures are in structure
(make-queue) -> queue
(queue? value) -> boolean
(queue-empty? queue) -> boolean
(enqueue! queue value)
(dequeue! queue) -> value
Make-queuecreates an empty queue,
queue?is a predicate for identifying queues,
queue-empty?tells you if a queue is empty,
dequeue!add and remove values.
(queue-length queue) -> integer
(queue->list queue) -> values
(list->queue values) -> queue
(delete-from-queue! queue value) -> boolean
Queue-lengthreturns the number of values in queue.
Queue->listreturns the values in queue as a list, in the order in which the values were added.
List->queuereturns a queue containing values, preserving their order.
Delete-from-queueremoves the first instance of value from
#tif value is found and
#fif it is not.
Previous: Cells | Next: Arrays