# HG changeset patch
# User Benoit Boissinot <benoit.boissinot@ens-lyon.org>
# Date 1238257754 -3600
# Node ID afddc32b2b3f380f7f42c740fc6a8cd2ec0dfe60
# Parent  caef5fdf1375783e8599a03df0fac7af3f1bc84d
bisect: use integer division

diff -r caef5fdf1375 -r afddc32b2b3f mercurial/hbisect.py
--- 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