traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix typo

This commit is contained in:
Raymond Hettinger 2010-08-07 23:37:37 +00:00
parent 0e833c3227
commit 648e725712
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Doc/library/heapq.rst
View File

@ -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 * Tuple comparison breaks for (priority, task) pairs if the priorities are equal
and the tasks do not have a default comparison order. 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? the heap?
* Or if a pending task needs to be deleted, how do you find it and remove it * Or if a pending task needs to be deleted, how do you find it and remove it