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 /Modules/_heapqmodule.c | |
| 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 'Modules/_heapqmodule.c')
| -rw-r--r-- | Modules/_heapqmodule.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Modules/_heapqmodule.c b/Modules/_heapqmodule.c index c343862b8c..136abf5985 100644 --- a/Modules/_heapqmodule.c +++ b/Modules/_heapqmodule.c @@ -550,7 +550,7 @@ representation for a tournament. The numbers below are `k', not a[k]:\n\ \n\ \n\ In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'. In\n\ -an usual binary tournament we see in sports, each cell is the winner\n\ +a usual binary tournament we see in sports, each cell is the winner\n\ over the two cells it tops, and we can trace the winner down the tree\n\ to see all opponents s/he had. However, in many computer applications\n\ of such tournaments, we do not need to trace the history of a winner.\n\ |