Mercurial > hg
changeset 7237:b9bf36905b55
findincoming: build the correct list from the start
author | Benoit Boissinot <benoit.boissinot@ens-lyon.org> |
---|---|
date | Fri, 24 Oct 2008 16:20:53 +0200 |
parents | db6fbb785800 |
children | b1a9ad7b464e a8e4e599e17f 127a624406b4 |
files | mercurial/localrepo.py |
diffstat | 1 files changed, 1 insertions(+), 2 deletions(-) [+] |
line wrap: on
line diff
--- a/mercurial/localrepo.py Fri Oct 24 15:00:40 2008 +0200 +++ b/mercurial/localrepo.py Fri Oct 24 16:20:53 2008 +0200 @@ -1318,7 +1318,7 @@ 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 @@ 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