We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 89a6e9a commit b98b37fCopy full SHA for b98b37f
1 file changed
Doc/library/queue.rst
@@ -15,8 +15,8 @@ module implements all the required locking semantics. It depends on the
15
availability of thread support in Python; see the :mod:`threading`
16
module.
17
18
-Implements three types of queue whose only difference is the order that
19
-the entries are retrieved. In a FIFO queue, the first tasks added are
+The module implements three types of queue, which differ only in the order in
+which the entries are retrieved. In a FIFO queue, the first tasks added are
20
the first retrieved. In a LIFO queue, the most recently added entry is
21
the first retrieved (operating like a stack). With a priority queue,
22
the entries are kept sorted (using the :mod:`heapq` module) and the
0 commit comments