diff options
author | Raymond Hettinger <python@rcn.com> | 2010-08-07 23:37:37 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2010-08-07 23:37:37 (GMT) |
commit | 648e725712dda5d3e217c02b28efeb13241778b5 (patch) | |
tree | 91ab8043c742264fa8dc46c1bcd5ca9f4c7fe5e9 | |
parent | 0e833c3227271a0295edc945693090a5f1daad7d (diff) | |
download | cpython-648e725712dda5d3e217c02b28efeb13241778b5.zip cpython-648e725712dda5d3e217c02b28efeb13241778b5.tar.gz cpython-648e725712dda5d3e217c02b28efeb13241778b5.tar.bz2 |
Fix typo
-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 6368cca..f5d62c7 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 |