# HG changeset patch
# User Benoit Boissinot <benoit.boissinot@ens-lyon.org>
# Date 2008-10-24 14:20:53
# Node ID b9bf36905b553d588f994f35e41f8d020f0dc61b
# Parent  db6fbb785800d77babe5421417f2ec1540bf35c9

findincoming: build the correct list from the start

diff --git a/mercurial/localrepo.py b/mercurial/localrepo.py
--- a/mercurial/localrepo.py
+++ b/mercurial/localrepo.py
@@ -1318,7 +1318,7 @@ class localrepository(repo.repository):
                 elif n[1] and n[1] in m: # do we know the base?
                     self.ui.debug(_("found incomplete branch %s:%s\n")
                                   % (short(n[0]), short(n[1])))
-                    search.append(n) # schedule branch range for scanning
+                    search.append(n[0:2]) # schedule branch range for scanning
                     seenbranch[n] = 1
                 else:
                     if n[1] not in seen and n[1] not in fetch:
@@ -1347,7 +1347,6 @@ class localrepository(repo.repository):
                         unknown.append(b)
 
         # do binary search on the branches we found
-        search = [(t, b) for (t, b, p1, p2) in search]
         while search:
             newsearch = []
             reqcnt += 1