diff options
| author | Antoine Pitrou <solipsis@pitrou.net> | 2011-01-07 19:16:12 (GMT) |
|---|---|---|
| committer | Antoine Pitrou <solipsis@pitrou.net> | 2011-01-07 19:16:12 (GMT) |
| commit | 696efdd03f40d5a135961af54946b56028b323bd (patch) | |
| tree | a934079518e5869da1707d6d43223845bcf74c51 /Doc/library/queue.rst | |
| parent | 4b512f73e0fe55d21a36da5658e424528ec0b2d4 (diff) | |
| download | cpython-696efdd03f40d5a135961af54946b56028b323bd.zip cpython-696efdd03f40d5a135961af54946b56028b323bd.tar.gz cpython-696efdd03f40d5a135961af54946b56028b323bd.tar.bz2 | |
Mention multiprocessing.Queue in the queue docs
Diffstat (limited to 'Doc/library/queue.rst')
| -rw-r--r-- | Doc/library/queue.rst | 13 |
1 files changed, 9 insertions, 4 deletions
diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst index 424998e..8a767c6 100644 --- a/Doc/library/queue.rst +++ b/Doc/library/queue.rst @@ -19,10 +19,6 @@ the first retrieved (operating like a stack). With a priority queue, the entries are kept sorted (using the :mod:`heapq` module) and the lowest valued entry is retrieved first. -.. seealso:: - - Latest version of the :source:`queue module Python source code - <Lib/queue.py>` The :mod:`queue` module defines the following classes and exceptions: @@ -180,3 +176,12 @@ Example of how to wait for enqueued tasks to be completed:: q.join() # block until all tasks are done + +.. seealso:: + + Class :class:`multiprocessing.Queue` + A queue class for use in a multi-processing (rather than multi-threading) + context. + + Latest version of the :source:`queue module Python source code + <Lib/queue.py>` |