This is an archive of the discontinued Mercurial Phabricator instance.

Status	Author	Revision
Closed	dsp	D1499 hbisect: use a defaultdict to avoid large allocations for a large changelogs
Closed	dsp	D1498 hbisect: use a revset for ancestor calculation
Closed	dsp	D1497 hbisect: pass repo into hbisect.bisect

Diff 3805

	"""			"""

	changelog = repo.changelog			changelog = repo.changelog
	clparents = changelog.parentrevs			clparents = changelog.parentrevs
	skip = set([changelog.rev(n) for n in state['skip']])			skip = set([changelog.rev(n) for n in state['skip']])

	def buildancestors(bad, good):			def buildancestors(bad, good):
	badrev = min([changelog.rev(n) for n in bad])			badrev = min([changelog.rev(n) for n in bad])
	ancestors = [None] * (len(changelog) + 1)			ancestors = collections.defaultdict(lambda: None)
	for rev in repo.revs("descendants(%ln) - ancestors(%ln)", good, good):			for rev in repo.revs("descendants(%ln) - ancestors(%ln)", good, good):
	ancestors[rev] = []			ancestors[rev] = []
	if ancestors[badrev] is None:			if ancestors[badrev] is None:
	return badrev, None			return badrev, None
	return badrev, ancestors			return badrev, ancestors

	good = False			good = False
	badrev, ancestors = buildancestors(state['bad'], state['good'])			badrev, ancestors = buildancestors(state['bad'], state['good'])