##// END OF EJS Templates
findincoming: build the correct list from the start
Benoit Boissinot -
r7237:b9bf3690 default
parent child Browse files
Show More
@@ -1318,7 +1318,7 b' class localrepository(repo.repository):'
1318 elif n[1] and n[1] in m: # do we know the base?
1318 elif n[1] and n[1] in m: # do we know the base?
1319 self.ui.debug(_("found incomplete branch %s:%s\n")
1319 self.ui.debug(_("found incomplete branch %s:%s\n")
1320 % (short(n[0]), short(n[1])))
1320 % (short(n[0]), short(n[1])))
1321 search.append(n) # schedule branch range for scanning
1321 search.append(n[0:2]) # schedule branch range for scanning
1322 seenbranch[n] = 1
1322 seenbranch[n] = 1
1323 else:
1323 else:
1324 if n[1] not in seen and n[1] not in fetch:
1324 if n[1] not in seen and n[1] not in fetch:
@@ -1347,7 +1347,6 b' class localrepository(repo.repository):'
1347 unknown.append(b)
1347 unknown.append(b)
1348
1348
1349 # do binary search on the branches we found
1349 # do binary search on the branches we found
1350 search = [(t, b) for (t, b, p1, p2) in search]
1351 while search:
1350 while search:
1352 newsearch = []
1351 newsearch = []
1353 reqcnt += 1
1352 reqcnt += 1
General Comments 0
You need to be logged in to leave comments. Login now