mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-09-27 02:39:58 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 13

Issue 14976: Note that the queue module is not designed to protect against reentrancy

Browse source
This commit is contained in:
Raymond Hettinger 2016-09-09 15:57:13 -07:00
parent 7b3b3dc85d
commit 87dc4d6189
1 changed files with 2 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

7
Doc/library/queue.rst
View file

@ -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 the entries are kept sorted (using the :mod:`heapq` module) and the
lowest valued entry is retrieved first. 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: 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() t.join()
.. note::
The :mod:`queue` module is not safe for use from :mod:`signal` handlers as
it uses :mod:`threading` locks.
.. seealso:: .. seealso::
Class :class:`multiprocessing.Queue` Class :class:`multiprocessing.Queue`