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

don't use division at all.

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

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)