traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

#7407: specify default maxsize value; patch by Floris Bruynooghe

This commit is contained in:
Andrew M. Kuchling 2010-02-26 13:22:50 +00:00
parent f4b6186d9c
commit 9aeeffa929
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Doc/library/queue.rst
View File

@ -26,14 +26,14 @@ lowest valued entry is retrieved first.
The :mod:`Queue` module defines the following classes and exceptions: The :mod:`Queue` module defines the following classes and exceptions:
.. class:: Queue(maxsize) .. class:: Queue(maxsize=0)
Constructor for a FIFO queue. *maxsize* is an integer that sets the upperbound 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 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 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. *maxsize* is less than or equal to zero, the queue size is infinite.
.. class:: LifoQueue(maxsize) .. class:: LifoQueue(maxsize=0)
Constructor for a LIFO queue. *maxsize* is an integer that sets the upperbound 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 limit on the number of items that can be placed in the queue. Insertion will
@ -42,7 +42,7 @@ The :mod:`Queue` module defines the following classes and exceptions:
.. versionadded:: 2.6 .. versionadded:: 2.6
.. class:: PriorityQueue(maxsize) .. class:: PriorityQueue(maxsize=0)
Constructor for a priority queue. *maxsize* is an integer that sets the upperbound Constructor for a priority queue. *maxsize* is an integer that sets the upperbound
limit on the number of items that can be placed in the queue. Insertion will limit on the number of items that can be placed in the queue. Insertion will