diff options
| author | R David Murray <rdmurray@bitdance.com> | 2012-05-08 21:28:24 -0400 |
|---|---|---|
| committer | R David Murray <rdmurray@bitdance.com> | 2012-05-08 21:28:24 -0400 |
| commit | b98b37f10139ab92b265c11455eaaa353f04325f (patch) | |
| tree | a0e2daa456789b1c38f75d189311bb6481b4548e /Doc/library/queue.rst | |
| parent | 89a6e9a27b565d8143c3e064aae92e831ff14801 (diff) | |
| download | cpython-git-b98b37f10139ab92b265c11455eaaa353f04325f.tar.gz | |
Improve the grammar of a non-sentence.
Diffstat (limited to 'Doc/library/queue.rst')
| -rw-r--r-- | Doc/library/queue.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/queue.rst b/Doc/library/queue.rst index 26336ef515..bc35dfe40e 100644 --- a/Doc/library/queue.rst +++ b/Doc/library/queue.rst @@ -15,8 +15,8 @@ module implements all the required locking semantics. It depends on the availability of thread support in Python; see the :mod:`threading` module. -Implements three types of queue whose only difference is the order that -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 the first retrieved. In a LIFO queue, the most recently added entry is the first retrieved (operating like a stack). With a priority queue, the entries are kept sorted (using the :mod:`heapq` module) and the |