diff options
| author | Martin Panter <vadmium+py@gmail.com> | 2016-04-15 02:27:11 +0000 |
|---|---|---|
| committer | Martin Panter <vadmium+py@gmail.com> | 2016-04-15 02:27:11 +0000 |
| commit | cda80940ed444d01beed797dcd86c207f11104bc (patch) | |
| tree | 7beaa1c4db9c2e8351a9cf8ddda6a656900d4275 /Modules/_heapqmodule.c | |
| parent | 8ca020e1cc2590472ba83611727ae20d9f34bfe5 (diff) | |
| parent | 20d325574eaa4f2a88036eac81e8d3cf9135372f (diff) | |
| download | cpython-git-cda80940ed444d01beed797dcd86c207f11104bc.tar.gz | |
Issue #15984: Merge PyUnicode doc from 3.5
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 1c37c75c8f..b499e1f668 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\ |