This is an archive of the discontinued Mercurial Phabricator instance.

Status	Author	Revision
Closed	mharbison72	D8407 revset: mark `extinct()` experimental
Closed	mharbison72	D8406 revset: mark `successors()` experimental
Closed	mharbison72	D8405 revset: mark `obsolete()` experimental
Closed	mharbison72	D8404 revset: import `unstable()` from the evolve extension

Diff 21045

	tonode = cl.node			tonode = cl.node
	result = {torev(n) for n in f(tonode(r) for r in s)}			result = {torev(n) for n in f(tonode(r) for r in s)}
	result.discard(None)			result.discard(None)
	return smartset.baseset(result - repo.changelog.filteredrevs)			return smartset.baseset(result - repo.changelog.filteredrevs)


	@predicate(b'successors(set)', safe=True)			@predicate(b'successors(set)', safe=True)
	def successors(repo, subset, x):			def successors(repo, subset, x):
	"""All successors for set, including the given set themselves"""			"""All successors for set, including the given set themselves.
				(EXPERIMENTAL)"""
	s = getset(repo, fullreposet(repo), x)			s = getset(repo, fullreposet(repo), x)
	f = lambda nodes: obsutil.allsuccessors(repo.obsstore, nodes)			f = lambda nodes: obsutil.allsuccessors(repo.obsstore, nodes)
	d = _mapbynodefunc(repo, s, f)			d = _mapbynodefunc(repo, s, f)
	return subset & d			return subset & d


	def _substringmatcher(pattern, casesensitive=True):			def _substringmatcher(pattern, casesensitive=True):
	kind, pattern, matcher = stringutil.stringmatcher(			kind, pattern, matcher = stringutil.stringmatcher(