mercurial/hbisect.py
changeset 7902 afddc32b2b3f
parent 7557 21233de9c053
child 8109 496ae1ea4698
--- a/mercurial/hbisect.py	Fri Mar 27 17:35:00 2009 +0100
+++ b/mercurial/hbisect.py	Sat Mar 28 17:29:14 2009 +0100
@@ -78,7 +78,7 @@
     unskipped = [c for c in candidates if (c not in skip) and (c != badrev)]
     if tot == 1 or not unskipped:
         return ([changelog.node(rev) for rev in candidates], 0, good)
-    perfect = tot / 2
+    perfect = tot // 2
 
     # find the best node to test
     best_rev = None