diff options
author | Martin Panter <vadmium+py@gmail.com> | 2016-04-15 02:14:19 +0000 |
---|---|---|
committer | Martin Panter <vadmium+py@gmail.com> | 2016-04-15 02:14:19 +0000 |
commit | 6245cb3c015a5b9febef4d6ef30d3acfc762a79d (patch) | |
tree | 3e0a3907968edb89a7d24a051dab35c9a43f5dee /Doc/library/heapq.rst | |
parent | 7d82d0366bb6c1b175cf54cf87778bba2451b0f4 (diff) | |
download | cpython-git-6245cb3c015a5b9febef4d6ef30d3acfc762a79d.tar.gz |
Correct “an” → “a” with “Unicode”, “user”, “UTF”, etc
This affects documentation, code comments, and a debugging messages.
Diffstat (limited to 'Doc/library/heapq.rst')
-rw-r--r-- | Doc/library/heapq.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index e29a31b3b3..45720bfaac 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -242,7 +242,7 @@ for a tournament. The numbers below are *k*, not ``a[k]``:: 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 -In the tree above, each cell *k* is topping ``2*k+1`` and ``2*k+2``. In an usual +In the tree above, each cell *k* is topping ``2*k+1`` and ``2*k+2``. In a usual binary tournament we see in sports, each cell is the winner over the two cells it tops, and we can trace the winner down the tree to see all opponents s/he had. However, in many computer applications of such tournaments, we do not need |