diff options
author | Raymond Hettinger <python@rcn.com> | 2016-09-09 22:58:00 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2016-09-09 22:58:00 (GMT) |
commit | f1024f74250d534d16a9970e5093b3b4e693b398 (patch) | |
tree | 84f2c7e4dbdc45b8236b641efdfbdf3db5c494bb /Doc/library/queue.rst | |
parent | 3ceb573a720b8b9c9148135c64ba966fa37e3a92 (diff) | |
parent | 87dc4d61890b4ed1c74b1f5e7256b3aa2080a499 (diff) | |
download | cpython-f1024f74250d534d16a9970e5093b3b4e693b398.zip cpython-f1024f74250d534d16a9970e5093b3b4e693b398.tar.gz cpython-f1024f74250d534d16a9970e5093b3b4e693b398.tar.bz2 |
merge
Diffstat (limited to 'Doc/library/queue.rst')
-rw-r--r-- | Doc/library/queue.rst | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst index c7dfc35..ed408f4 100644 --- a/Doc/library/queue.rst +++ b/Doc/library/queue.rst @@ -23,6 +23,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: @@ -189,11 +191,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` |