Show More
@@ -411,9 +411,8 b' class localrepository(repo.repository):' | |||||
411 | for branch, newnodes in newbranches.iteritems(): |
|
411 | for branch, newnodes in newbranches.iteritems(): | |
412 | bheads = partial.setdefault(branch, []) |
|
412 | bheads = partial.setdefault(branch, []) | |
413 | bheads.extend(newnodes) |
|
413 | bheads.extend(newnodes) | |
414 |
if len(bheads) < |
|
414 | if len(bheads) <= 1: | |
415 | continue |
|
415 | continue | |
416 | newbheads = [] |
|
|||
417 | # starting from tip means fewer passes over reachable |
|
416 | # starting from tip means fewer passes over reachable | |
418 | while newnodes: |
|
417 | while newnodes: | |
419 | latest = newnodes.pop() |
|
418 | latest = newnodes.pop() | |
@@ -421,9 +420,8 b' class localrepository(repo.repository):' | |||||
421 | continue |
|
420 | continue | |
422 | minbhrev = self[min([self[bh].rev() for bh in bheads])].node() |
|
421 | minbhrev = self[min([self[bh].rev() for bh in bheads])].node() | |
423 | reachable = self.changelog.reachable(latest, minbhrev) |
|
422 | reachable = self.changelog.reachable(latest, minbhrev) | |
|
423 | reachable.remove(latest) | |||
424 | bheads = [b for b in bheads if b not in reachable] |
|
424 | bheads = [b for b in bheads if b not in reachable] | |
425 | newbheads.insert(0, latest) |
|
|||
426 | bheads.extend(newbheads) |
|
|||
427 | partial[branch] = bheads |
|
425 | partial[branch] = bheads | |
428 |
|
426 | |||
429 | def lookup(self, key): |
|
427 | def lookup(self, key): |
General Comments 0
You need to be logged in to leave comments.
Login now