This is an archive of the discontinued Mercurial Phabricator instance.

	orderednodes = list(reversed(self._toposort(ancestors)))			orderednodes = list(reversed(self._toposort(ancestors)))
	if len(nohistory) > 0:			if len(nohistory) > 0:
	ui.debug('repackdata: %d nodes without history\n' %			ui.debug('repackdata: %d nodes without history\n' %
	len(nohistory))			len(nohistory))
	orderednodes.extend(sorted(nohistory))			orderednodes.extend(sorted(nohistory))

	# Filter orderednodes to just the nodes we want to serialize (it			# Filter orderednodes to just the nodes we want to serialize (it
	# currently also has the edge nodes' ancestors).			# currently also has the edge nodes' ancestors).
	orderednodes = filter(lambda node: node in nodes, orderednodes)			orderednodes = list(filter(lambda node: node in nodes,
				orderednodes))

	# Garbage collect old nodes:			# Garbage collect old nodes:
	if self.garbagecollect:			if self.garbagecollect:
	neworderednodes = []			neworderednodes = []
	for node in orderednodes:			for node in orderednodes:
	# If the node is old and is not in the keepset, we skip it,			# If the node is old and is not in the keepset, we skip it,
	# and mark as garbage collected			# and mark as garbage collected
	if ((filename, node) not in self.keepkeys and			if ((filename, node) not in self.keepkeys and

py3: listify filter() to call len() on itClosedPublic