This is an archive of the discontinued Mercurial Phabricator instance.

Diff	ID	Description	Created	Lint	Unit
Base		Base
Diff 1	32087		Feb 7 2022, 12:25 PM	★	★
Diff 2	32168		Feb 14 2022, 12:06 PM	★	★
Diff 3	32201	rHGd5121df04808691b19e994e8b2ba078abf14fef7	Jan 28 2022, 5:35 AM	★	★

Commit	Parents	Author	Summary	Date
338308ab1a57	89d201c11e03	Pierre-Yves David		Jan 28 2022, 5:35 AM

Status	Author	Revision
Closed	pacien	D12143 rank: compute property incrementally
Closed	pacien	D12142 rank: add test with golden values
Closed	pacien	D12141 rank: add minimal test
Closed	pacien	D12140 rank: add context and template keyword
Closed	pacien	D12139 rank: naive rank property computation and retrieval

Diff 32087

	def tags(self):			def tags(self):
	"""Return a list of byte tag names"""			"""Return a list of byte tag names"""
	return self._repo.nodetags(self._node)			return self._repo.nodetags(self._node)

	def bookmarks(self):			def bookmarks(self):
	"""Return a list of byte bookmark names."""			"""Return a list of byte bookmark names."""
	return self._repo.nodebookmarks(self._node)			return self._repo.nodebookmarks(self._node)

				def fast_rank(self):
				repo = self._repo
				if self._maybe_filtered:
				cl = repo.changelog
				else:
				cl = repo.unfiltered().changelog
				return cl.fast_rank(self._rev)

	def phase(self):			def phase(self):
	return self._repo._phasecache.phase(self._repo, self._rev)			return self._repo._phasecache.phase(self._repo, self._rev)

	def hidden(self):			def hidden(self):
	return self._rev in repoview.filterrevs(self._repo, b'visible')			return self._rev in repoview.filterrevs(self._repo, b'visible')

	def isinmemory(self):			def isinmemory(self):
	return False			return False

	return _hybrid(			return _hybrid(
	f,			f,
	extras,			extras,
	makemap,			makemap,
	lambda k: b'%s=%s' % (k, stringutil.escapestr(extras[k])),			lambda k: b'%s=%s' % (k, stringutil.escapestr(extras[k])),
	)			)


				@templatekeyword(b'_fast_rank', requires={b'ctx'})
				def fast_rank(context, mapping):
				"""the rank of a changeset if cached

				The rank of a revision is the size of sub-graph it defines as a head. In
				other words, the rank of X is the size of `ancestors(X)` (X included).
				"""
				ctx = context.resource(mapping, b'ctx')
				rank = ctx.fast_rank()
				if rank is None:
				return None
				return b"%d" % rank


	def _getfilestatus(context, mapping, listall=False):			def _getfilestatus(context, mapping, listall=False):
	ctx = context.resource(mapping, b'ctx')			ctx = context.resource(mapping, b'ctx')
	revcache = context.resource(mapping, b'revcache')			revcache = context.resource(mapping, b'revcache')
	if b'filestatus' not in revcache or revcache[b'filestatusall'] < listall:			if b'filestatus' not in revcache or revcache[b'filestatusall'] < listall:
	stat = ctx.p1().status(			stat = ctx.p1().status(
	ctx, listignored=listall, listclean=listall, listunknown=listall			ctx, listignored=listall, listclean=listall, listunknown=listall
	)			)
	revcache[b'filestatus'] = stat			revcache[b'filestatus'] = stat