Issue 14976: Note that the queue module is not designed to protect against reentrancy
This commit is contained in:
parent
7b3b3dc85d
commit
87dc4d6189
|
@ -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`
|
||||
|
|
Loading…
Reference in New Issue