Don't use true division where int division was intended. For that matter,

don't use division at all.

diff --git a/Lib/heapq.py b/Lib/heapq.py
index cdba693b6ded9f7b088d4fd9ade8033696fa94fb..6264700ee4f96f8837b60aa9e8ccc77e0b2f3da0 100644 (file)
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -126,7 +126,7 @@ def heappush(heap, item):
     pos = len(heap)
     heap.append(None)
     while pos:
-        parentpos = (pos - 1) / 2
+        parentpos = (pos - 1) >> 1
         parent = heap[parentpos]
         if item >= parent:
             break

diff --git a/Lib/test/test_heapq.py b/Lib/test/test_heapq.py
index 43723f33f650709c8d0002fcb52fcbee8567adc8..016fd3af41edbb024afed3d91d5c8bf268033940 100644 (file)
--- a/Lib/test/test_heapq.py
+++ b/Lib/test/test_heapq.py
@@ -8,7 +8,7 @@ import random
 def check_invariant(heap):
     # Check the heap invariant.
     for pos, item in enumerate(heap):
-        parentpos = (pos+1)/2 - 1
+        parentpos = ((pos+1) >> 1) - 1
         if parentpos >= 0:
             verify(heap[parentpos] <= item)