This is an archive of the discontinued Mercurial Phabricator instance.

Status	Author	Revision
Closed	durin42	D2370 narrowchangegroup: remove backwards compatibility with old hg
Closed	durin42	D2369 narrowbundle2: replace map() with equivalent list comprehension
Closed	durin42	D2368 narrowbundle2: this dict contains native strings, look kws up as such
Closed	durin42	D2367 narrowcommands: add some missing strkwargs calls for py3
Closed	durin42	D2366 narrowwirepeer: add some strkwargs to fix a crash on py3
Closed	durin42	D2365 tests: port extension in test-narrow-expanddirstate.t to Python 3
Closed	durin42	D2364 py3: use list comprehensions instead of filter where we need to eagerly filter
Closed	durin42	D2363 narrow: use list comprehension instead of filter for filtering lists

Diff 5949

	if j not in ellipsisroots or len(ellipsisroots[j]) < 2:			if j not in ellipsisroots or len(ellipsisroots[j]) < 2:
	return j, (nr1, nr2)			return j, (nr1, nr2)
	raise error.Abort('Failed to split up ellipsis node! head: %d, '			raise error.Abort('Failed to split up ellipsis node! head: %d, '
	'roots: %d %d %d' % (head, r1, r2, r3))			'roots: %d %d %d' % (head, r1, r2, r3))

	missing = list(cl.findmissingrevs(common=commonrevs, heads=headsrevs))			missing = list(cl.findmissingrevs(common=commonrevs, heads=headsrevs))
	visit = reversed(missing)			visit = reversed(missing)
	relevant_nodes = set()			relevant_nodes = set()
	visitnodes = map(cl.node, missing)			visitnodes = [cl.node(m) for m in missing]
	required = set(headsrevs) \| known			required = set(headsrevs) \| known
	for rev in visit:			for rev in visit:
	clrev = cl.changelogrevision(rev)			clrev = cl.changelogrevision(rev)
	ps = cldag.parents(rev)			ps = cldag.parents(rev)
	if depth is not None:			if depth is not None:
	curdepth = revdepth[rev]			curdepth = revdepth[rev]
	for p in ps:			for p in ps:
	revdepth[p] = min(curdepth + 1, revdepth.get(p, depth + 1))			revdepth[p] = min(curdepth + 1, revdepth.get(p, depth + 1))