summaryrefslogtreecommitdiffstats
path: root/Doc
diff options
context:
space:
mode:
authorAndrew M. Kuchling <amk@amk.ca>2010-02-26 13:35:56 (GMT)
committerAndrew M. Kuchling <amk@amk.ca>2010-02-26 13:35:56 (GMT)
commit2b600e549603aaad7d97996837ac9bfef37e66bc (patch)
tree0b374820ae96884346646d0737d9879ec8f3f146 /Doc
parentc1c415f304e499b963131a83293bde07dcabc821 (diff)
downloadcpython-2b600e549603aaad7d97996837ac9bfef37e66bc.zip
cpython-2b600e549603aaad7d97996837ac9bfef37e66bc.tar.gz
cpython-2b600e549603aaad7d97996837ac9bfef37e66bc.tar.bz2
Merged revisions 78463 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk ........ r78463 | andrew.kuchling | 2010-02-26 08:22:50 -0500 (Fri, 26 Feb 2010) | 1 line #7407: specify default maxsize value; patch by Floris Bruynooghe ........
Diffstat (limited to 'Doc')
-rw-r--r--Doc/library/queue.rst7
1 files changed, 3 insertions, 4 deletions
diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst
index 63ef1ec..0ee920b 100644
--- a/Doc/library/queue.rst
+++ b/Doc/library/queue.rst
@@ -21,15 +21,14 @@ lowest valued entry is retrieved first.
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
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.
-
-.. class:: LifoQueue(maxsize)
+.. class:: LifoQueue(maxsize=0)
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
@@ -37,7 +36,7 @@ The :mod:`queue` module defines the following classes and exceptions:
*maxsize* is less than or equal to zero, the queue size is infinite.
-.. class:: PriorityQueue(maxsize)
+.. class:: PriorityQueue(maxsize=0)
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