This is an archive of the discontinued Mercurial Phabricator instance.

Status	Author	Revision
Closed	pacien	D12212 revlog: use rust rank computation if available
Closed	pacien	D12211 rust: expose rank computation function to python
Closed	pacien	D12210 rust: implement vcsgraph::RankedGraph for Index
Closed	pacien	D12209 revlog: implement fast_rank retrieval in C
Closed	pacien	D12208 revlog: return 0 for the fast_rank of nullrev

Diff 32456

	if self._format_version == CHANGELOGV2:			if self._format_version == CHANGELOGV2:
	if (p1r, p2r) == (nullrev, nullrev):			if (p1r, p2r) == (nullrev, nullrev):
	rank = 1			rank = 1
	elif p1r != nullrev and p2r == nullrev:			elif p1r != nullrev and p2r == nullrev:
	rank = 1 + self.fast_rank(p1r)			rank = 1 + self.fast_rank(p1r)
	elif p1r == nullrev and p2r != nullrev:			elif p1r == nullrev and p2r != nullrev:
	rank = 1 + self.fast_rank(p2r)			rank = 1 + self.fast_rank(p2r)
	else: # merge node			else: # merge node
				if rustdagop is not None and self.index.rust_ext_compat:
				rank = rustdagop.rank(self.index, p1r, p2r)
				else:
	pmin, pmax = sorted((p1r, p2r))			pmin, pmax = sorted((p1r, p2r))
	rank = 1 + self.fast_rank(pmax)			rank = 1 + self.fast_rank(pmax)
	rank += sum(1 for _ in self.findmissingrevs([pmax], [pmin]))			rank += sum(1 for _ in self.findmissingrevs([pmax], [pmin]))

	e = revlogutils.entry(			e = revlogutils.entry(
	flags=flags,			flags=flags,
	data_offset=offset,			data_offset=offset,
	data_compressed_length=deltainfo.deltalen,			data_compressed_length=deltainfo.deltalen,
	data_uncompressed_length=textlen,			data_uncompressed_length=textlen,
	data_compression_mode=compression_mode,			data_compression_mode=compression_mode,
	data_delta_base=deltainfo.base,			data_delta_base=deltainfo.base,