This is the class of queue objects. Queues are conceptually (but not necessarily implementationally) like first-in first-out lists, with objects being enqueued by being appended onto the end and dequeued by being popped off the front. Queues are more convenient than lists in a multiprocessing environment because enqueing and dequeuing operations are atomic (they will complete without a process switch) and because dequeuing has a built-in wait capability. Queues have no pre specified size limit.
See enqueue, dequeue, queue-empty-p, and Queues (both models) in multiprocessing.htm.
The documentation is described in introduction.htm and the index is in index.htm.
Copyright (c) 1998-2000, Franz Inc. Berkeley, CA., USA. All rights reserved.
Created 2000.10.5.