Queue
class implements a First-In-First-Out (FIFO) list of objects. A queue is for the exclusive use of one single consumer, whereas many producers may access it. It is ready for use after instantiation. A producer may wait for the queue to be empty by calling the stop()
method. This method returns when the queue is actually empty, and prohibits any further call to the push
method. To be able to use the queue again, it must be re-started through the start()
method.
|
|
|
|
|
|