diff options
| author | R David Murray <rdmurray@bitdance.com> | 2012-05-08 21:29:36 -0400 |
|---|---|---|
| committer | R David Murray <rdmurray@bitdance.com> | 2012-05-08 21:29:36 -0400 |
| commit | 5ec0340ce1927a2220a0fc510f2f9968d05917eb (patch) | |
| tree | 1b8b9a83363b2232d880606fdbb336f5691eee9c | |
| parent | f1ae5cf5c7f17e1103735060457fccd5844d21c9 (diff) | |
| download | cpython-git-5ec0340ce1927a2220a0fc510f2f9968d05917eb.tar.gz | |
Improve the grammar of a non-sentence.
| -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 67c5c6f853..179c4c67c6 100644 --- a/Doc/library/queue.rst +++ b/Doc/library/queue.rst @@ -20,8 +20,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 |