# HG changeset patch
# User Matt Mackall <mpm@selenic.com>
# Date 1199146833 21600
# Node ID 78d14403bdc7ccf015a723fc90df1681a32b2ce7
# Parent  dd5f8ed3105706ef7a5244e9f71c973e632b27e2
bisect: use a dict for children

We fill in the children only for ancestors of badrev

diff -r dd5f8ed31057 -r 78d14403bdc7 hgext/hbisect.py
--- a/hgext/hbisect.py	Mon Dec 31 18:20:33 2007 -0600
+++ b/hgext/hbisect.py	Mon Dec 31 18:20:33 2007 -0600
@@ -31,18 +31,19 @@
         raise util.Abort(_("Inconsistent state, %s:%s is good and bad")
                          % (badrev, hg.short(bad)))
 
-    # build children array
-    children = [[]] * (badrev + 1) # an extra for [-1]
-    for rev in xrange(badrev, -1, -1):
+    # build children dict
+    children = {}
+    visit = [badrev]
+    while visit:
+        rev = visit.pop(0)
         if ancestors[rev] == []:
             for prev in clparents(rev):
-                if prev == -1:
-                    continue
-                l = children[prev]
-                if l:
-                    l.append(rev)
-                else:
-                    children[prev] = [rev]
+                if prev != -1:
+                    if prev in children:
+                        children[prev].append(rev)
+                    else:
+                        children[prev] = [rev]
+                        visit.append(prev)
 
     # accumulate ancestor lists
     for rev in xrange(badrev + 1):
@@ -58,7 +59,7 @@
                     a.update(dict.fromkeys(s))
                 a[rev] = None
                 a = a.keys()
-            for c in children[rev]:
+            for c in children.get(rev, []):
                 if ancestors[c]:
                     ancestors[c].append(a)
                 else: