This is an archive of the discontinued Mercurial Phabricator instance.

	return tree and tree[0] in ('range', 'rangepre', 'rangepost', 'rangeall')			return tree and tree[0] in ('range', 'rangepre', 'rangepost', 'rangeall')

	def revpair(repo, revs):			def revpair(repo, revs):
	if not revs:			if not revs:
	return repo['.'], repo[None]			return repo['.'], repo[None]

	l = revrange(repo, revs)			l = revrange(repo, revs)

				if not l:
				raise error.Abort(_('empty revision range'))

	first = l.first()			first = l.first()
	second = l.last()			second = l.last()

	if first is None:
	raise error.Abort(_('empty revision range'))
	if (first == second and len(revs) >= 2			if (first == second and len(revs) >= 2
	and not all(revrange(repo, [r]) for r in revs)):			and not all(revrange(repo, [r]) for r in revs)):
	raise error.Abort(_('empty revision on one side of range'))			raise error.Abort(_('empty revision on one side of range'))

	# if top-level is range expression, the result must always be a pair			# if top-level is range expression, the result must always be a pair
	if first == second and len(revs) == 1 and not _pairspec(revs[0]):			if first == second and len(revs) == 1 and not _pairspec(revs[0]):
	return repo[first], repo[None]			return repo[first], repo[None]

revpair: clarify check for empty revsetClosedPublic