mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-10-03 05:35:59 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 8

Use LT in all comparisons

Browse source
This commit is contained in:
Raymond Hettinger 2013-03-05 01:17:57 -05:00
parent 221760a3aa
commit 975a8e8f76
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Lib/heapq.py
View file

@ -181,7 +181,7 @@ def heapify(x):
def _heappushpop_max(heap, item): def _heappushpop_max(heap, item):
"""Maxheap version of a heappush followed by a heappop.""" """Maxheap version of a heappush followed by a heappop."""
if heap and heap[0] > item: if heap and item < heap[0]:
item, heap[0] = heap[0], item item, heap[0] = heap[0], item
_siftup_max(heap, 0) _siftup_max(heap, 0)
return item return item
@ -312,7 +312,7 @@ def _siftdown_max(heap, startpos, pos):
while pos > startpos: while pos > startpos:
parentpos = (pos - 1) >> 1 parentpos = (pos - 1) >> 1
parent = heap[parentpos] parent = heap[parentpos]
if newitem > parent: if parent < newitem:
heap[pos] = parent heap[pos] = parent
pos = parentpos pos = parentpos
continue continue
@ -329,7 +329,7 @@ def _siftup_max(heap, pos):
while childpos < endpos: while childpos < endpos:
# Set childpos to index of larger child. # Set childpos to index of larger child.
rightpos = childpos + 1 rightpos = childpos + 1
if rightpos < endpos and not heap[childpos] > heap[rightpos]: if rightpos < endpos and not heap[rightpos] < heap[childpos]:
childpos = rightpos childpos = rightpos
# Move the larger child up. # Move the larger child up.
heap[pos] = heap[childpos] heap[pos] = heap[childpos]