From 6245cb3c015a5b9febef4d6ef30d3acfc762a79d Mon Sep 17 00:00:00 2001 From: Martin Panter Date: Fri, 15 Apr 2016 02:14:19 +0000 Subject: =?UTF-8?q?Correct=20=E2=80=9Can=E2=80=9D=20=E2=86=92=20=E2=80=9Ca?= =?UTF-8?q?=E2=80=9D=20with=20=E2=80=9CUnicode=E2=80=9D,=20=E2=80=9Cuser?= =?UTF-8?q?=E2=80=9D,=20=E2=80=9CUTF=E2=80=9D,=20etc?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit This affects documentation, code comments, and a debugging messages. --- Modules/_heapqmodule.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'Modules/_heapqmodule.c') 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\ -- cgit v1.2.1