From a2156c0b3690bf8bb235a6d212aa0d243ce0b4e7 Mon Sep 17 00:00:00 2001 From: Raymond Hettinger Date: Sat, 7 Aug 2010 23:38:16 +0000 Subject: [PATCH] Fix typo --- Doc/library/heapq.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 6368cca574..f5d62c7a45 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -151,7 +151,7 @@ for a heap, and it presents several implementation challenges: * Tuple comparison breaks for (priority, task) pairs if the priorities are equal and the tasks do not have a default comparison order. -* If the priority of a task changes, how do you move it to a new posistion in +* If the priority of a task changes, how do you move it to a new position in the heap? * Or if a pending task needs to be deleted, how do you find it and remove it -- 2.40.0