mercurial-scm/hg: mercurial/revlog.py comparison

revlog: move ancestor generation out to a new class This refactoring is to prepare for implementing lazy membership.

comparison

equal deleted inserted replaced

-:0127366df8fe
+:9abc55ef85b5
 def ancestors(self, revs, stoprev=0, inclusive=False):
 """Generate the ancestors of 'revs' in reverse topological order.
 Does not generate revs lower than stoprev.
-If inclusive is False, yield a sequence of revision numbers starting
+See the documentation for ancestor.lazyancestors for more details."""
-with the parents of each revision in revs, i.e., each revision is *not*
-considered an ancestor of itself.  Results are in breadth-first order:
+return ancestor.lazyancestors(self, revs, stoprev=stoprev,
-parents of each rev in revs, then parents of those, etc.
+inclusive=inclusive)
-If inclusive is True, yield all the revs first (ignoring stoprev),
-then yield all the ancestors of revs as when inclusive is False.
-If an element in revs is an ancestor of a different rev it is not
-yielded again.
-Result does not include the null revision."""
-visit = util.deque(revs)
-seen = set([nullrev])
-if inclusive:
-for rev in revs:
-yield rev
-seen.update(revs)
-while visit:
-for parent in self.parentrevs(visit.popleft()):
-if parent < stoprev:
-continue
-if parent not in seen:
-visit.append(parent)
-seen.add(parent)
-yield parent
 def descendants(self, revs):
 """Generate the descendants of 'revs' in revision order.
 Yield a sequence of revision numbers starting with a child of

Mercurial > public > mercurial-scm > hg