This is an archive of the discontinued Mercurial Phabricator instance.

Status	Author	Revision
Closed	martinvonz	D3931 revlog: introduce a isancestorrev() and use it in rebase
Closed	martinvonz	D3930 revlog: make isdescendantrev(a, b) check if a < b
Closed	martinvonz	D3929 revlog: replace descendant(b, a) by isdescendantrev(a, b) (API)
Closed	martinvonz	D3928 revlog: move comment about commonancestorsheads where it's used

Diff 9560

	A revision is considered a descendant of itself.			A revision is considered a descendant of itself.

	The implementation of this is trivial but the use of			The implementation of this is trivial but the use of
	commonancestorsheads is not."""			commonancestorsheads is not."""
	if b == nullrev:			if b == nullrev:
	return True			return True
	elif a == b:			elif a == b:
	return True			return True
				elif a < b:
				return False
	return b in self._commonancestorsheads(a, b)			return b in self._commonancestorsheads(a, b)

	def commonancestorsheads(self, a, b):			def commonancestorsheads(self, a, b):
	"""calculate all the heads of the common ancestors of nodes a and b"""			"""calculate all the heads of the common ancestors of nodes a and b"""
	a, b = self.rev(a), self.rev(b)			a, b = self.rev(a), self.rev(b)
	ancs = self._commonancestorsheads(a, b)			ancs = self._commonancestorsheads(a, b)
	return pycompat.maplist(self.node, ancs)			return pycompat.maplist(self.node, ancs)