The Queue module implements a multi-producer, multi-consumer
FIFO queue. It is especially useful in threads programming when
information must be exchanged safely between multiple threads. The
Queue class in this module implements all the required locking
semantics. It depends on the availability of thread support in
- Module bisect:
- PriorityQueue example using the Queue class.
The Queue module defines the following class and exception:
Constructor for the class. maxsize is an integer that sets the
upperbound limit on the number of items that can be placed in the
queue. Insertion will block once this size has been reached, until
queue items are consumed. If maxsize is less than or equal to
zero, the queue size is infinite.
- exception Empty
Exception raised when non-blocking get() (or
get_nowait()) is called on a Queue object which is
empty or locked.
- exception Full
Exception raised when non-blocking put() (or
put_nowait()) is called on a Queue object which is
full or locked.
See About this document... for information on suggesting changes.