File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -19,10 +19,6 @@ the first retrieved (operating like a stack). With a priority queue,
1919the entries are kept sorted (using the :mod: `heapq ` module) and the
2020lowest valued entry is retrieved first.
2121
22- .. seealso ::
23-
24- Latest version of the :source: `queue module Python source code
25- <Lib/queue.py> `
2622
2723The :mod: `queue ` module defines the following classes and exceptions:
2824
@@ -180,3 +176,12 @@ Example of how to wait for enqueued tasks to be completed::
180176
181177 q.join() # block until all tasks are done
182178
179+
180+ .. seealso ::
181+
182+ Class :class: `multiprocessing.Queue `
183+ A queue class for use in a multi-processing (rather than multi-threading)
184+ context.
185+
186+ Latest version of the :source: `queue module Python source code
187+ <Lib/queue.py> `
You can’t perform that action at this time.
0 commit comments