summaryrefslogtreecommitdiffstats
path: root/Doc/library/queue.rst
diff options
context:
space:
mode:
Diffstat (limited to 'Doc/library/queue.rst')
-rw-r--r--Doc/library/queue.rst7
1 files changed, 2 insertions, 5 deletions
diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst
index f803852..e026e52 100644
--- a/Doc/library/queue.rst
+++ b/Doc/library/queue.rst
@@ -22,6 +22,8 @@ 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.
+Internally, the module uses locks to temporarily block competing threads;
+however, it is not designed to handle reentrancy within a thread.
The :mod:`queue` module defines the following classes and exceptions:
@@ -186,11 +188,6 @@ Example of how to wait for enqueued tasks to be completed::
t.join()
-.. note::
-
- The :mod:`queue` module is not safe for use from :mod:`signal` handlers as
- it uses :mod:`threading` locks.
-
.. seealso::
Class :class:`multiprocessing.Queue`