Show More
@@ -530,7 +530,8 b' class revlog(object):' | |||
|
530 | 530 | if heads is None: |
|
531 | 531 | heads = self.headrevs() |
|
532 | 532 | |
|
533 | return ancestor.missingancestors(heads, common, self.parentrevs) | |
|
533 | inc = self.incrementalmissingrevs(common=common) | |
|
534 | return inc.missingancestors(heads) | |
|
534 | 535 | |
|
535 | 536 | def findmissing(self, common=None, heads=None): |
|
536 | 537 | """Return the ancestors of heads that are not ancestors of common. |
@@ -555,8 +556,8 b' class revlog(object):' | |||
|
555 | 556 | common = [self.rev(n) for n in common] |
|
556 | 557 | heads = [self.rev(n) for n in heads] |
|
557 | 558 | |
|
558 | return [self.node(r) for r in | |
|
559 | ancestor.missingancestors(heads, common, self.parentrevs)] | |
|
559 | inc = self.incrementalmissingrevs(common=common) | |
|
560 | return [self.node(r) for r in inc.missingancestors(heads)] | |
|
560 | 561 | |
|
561 | 562 | def nodesbetween(self, roots=None, heads=None): |
|
562 | 563 | """Return a topological path from 'roots' to 'heads'. |
General Comments 0
You need to be logged in to leave comments.
Login now