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:
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>`