[Python module] queue

8.8. queue — A synchronized queue class¶
queue -- Ò»¸öͬ²½¶ÓÁÐÀà
The queue module implements multi-producer, multi-consumer queues. It is especially useful in threaded 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 Python; see the threading module.
queueÄ£¿é´¦Àí¶àÉú²úÕߺͶàÏû·ÑÕߵĶÓÁС£ÔÚ¶àÏ̼߳äÐÅÏ¢µÄ°²È«½»»»·Ç³£ÓÐÓá£Õâ¸ömoduleµÄQueueÀà´¦ÀíËùÐèµÄlockingÓïÒ壬ËüÒÀÀµÓÚthreadingÄ£¿é¡£
Implements three types of queue whose only difference is the order that the entries are retrieved. In a FIFO queue, the first tasks added are the first retrieved. In a LIFO queue, the most recently added entry is the first retrieved (operating like a stack). With a priority queue, the entries are kept sorted (using the heapq module) and the lowest valued entry is retrieved first.
ÈýÖÖÀàÐ͵ĶÓÁУ¬FIFO£¬LIFO£¬ÒÔ¼°ÓÅÏȶÓÁУ¨Ê¹ÓÃheapqÄ£¿é£¬ÏÈÈ¡µÃµÍÓÅÏȼ¶£©¡£
The queue module defines the following classes and exceptions:
class queue.Queue(maxsize)¶Constructor for a FIFO queue. 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.
´´½¨FIFP¶ÓÁС£maxsiaze <= 0, ÎÞÏÞÖÆ
class queue.LifoQueue(maxsize)¶Constructor for a LIFO queue. 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.
´´½¨LIFO¶ÓÁС£maxsiaze <= 0, ÎÞÏÞÖÆ
class queue.PriorityQueue(maxsize)¶
Constructor for a priority queue. maxsize is an integer that sets the upperbound limit on the number of items that can be place