Show More
@@ -624,12 +624,6 b' def _commonancestorheads(repo, subset, x' | |||||
624 | @predicate('commonancestors(set)', safe=True) |
|
624 | @predicate('commonancestors(set)', safe=True) | |
625 | def commonancestors(repo, subset, x): |
|
625 | def commonancestors(repo, subset, x): | |
626 | """Returns all common ancestors of the set. |
|
626 | """Returns all common ancestors of the set. | |
627 |
|
||||
628 | This method is for calculating "::x and ::y" (i.e. all the ancestors that |
|
|||
629 | are common to both x and y) in an easy and optimized way. We can't quite |
|
|||
630 | use "::head()" because that revset returns "::x + ::y + ..." for each head |
|
|||
631 | in the repo (whereas we want "::x *and* ::y"). |
|
|||
632 |
|
||||
633 | """ |
|
627 | """ | |
634 | startrevs = getset(repo, fullreposet(repo), x, order=anyorder) |
|
628 | startrevs = getset(repo, fullreposet(repo), x, order=anyorder) | |
635 | if not startrevs: |
|
629 | if not startrevs: |
General Comments 0
You need to be logged in to leave comments.
Login now