This is an archive of the discontinued Mercurial Phabricator instance.

	# a branchhead as ancestor.			# a branchhead as ancestor.
	# - In all other cases, the parents on different branches			# - In all other cases, the parents on different branches
	# could have a branchhead as ancestor. Those parents are			# could have a branchhead as ancestor. Those parents are
	# kept in the "uncertain" set. If all branchheads are also			# kept in the "uncertain" set. If all branchheads are also
	# topological heads, they can't have descendants and further			# topological heads, they can't have descendants and further
	# checks can be skipped. Otherwise, the ancestors of the			# checks can be skipped. Otherwise, the ancestors of the
	# "uncertain" set are removed from branchheads.			# "uncertain" set are removed from branchheads.
	# This computation is heavy and avoided if at all possible.			# This computation is heavy and avoided if at all possible.
	bheads = self._entries.setdefault(branch, [])			bheads = self._entries.get(branch, [])
	bheadset = {cl.rev(node) for node in bheads}			bheadset = {cl.rev(node) for node in bheads}
	uncertain = set()			uncertain = set()
	for newrev in sorted(newheadrevs):			for newrev in sorted(newheadrevs):
	if newrev in obsrevs:			if newrev in obsrevs:
	# We ignore obsolete changesets as they shouldn't be			# We ignore obsolete changesets as they shouldn't be
	# considered heads.			# considered heads.
	continue			continue

	if uncertain:			if uncertain:
	if topoheads is None:			if topoheads is None:
	topoheads = set(cl.headrevs())			topoheads = set(cl.headrevs())
	if bheadset - topoheads:			if bheadset - topoheads:
	floorrev = min(bheadset)			floorrev = min(bheadset)
	if floorrev <= max(uncertain):			if floorrev <= max(uncertain):
	ancestors = set(cl.ancestors(uncertain, floorrev))			ancestors = set(cl.ancestors(uncertain, floorrev))
	bheadset -= ancestors			bheadset -= ancestors
	bheadrevs = sorted(bheadset)			if bheadset:
	self[branch] = [cl.node(rev) for rev in bheadrevs]			self[branch] = [cl.node(rev) for rev in sorted(bheadset)]
	tiprev = max(newheadrevs)			tiprev = max(newheadrevs)
	if tiprev > ntiprev:			if tiprev > ntiprev:
	ntiprev = tiprev			ntiprev = tiprev

	if ntiprev > self.tiprev:			if ntiprev > self.tiprev:
	self.tiprev = ntiprev			self.tiprev = ntiprev
	self.tipnode = cl.node(ntiprev)			self.tipnode = cl.node(ntiprev)

Diff	ID	Description	Created	Lint	Unit
Base		Base
Diff 1	32079		Feb 7 2022, 1:40 AM	★	★
Diff 2	32084	rHG8b393f40a5e665a579c6a8ac655785eeb41357a4	Feb 6 2022, 11:31 AM	★	★

This is an archive of the discontinued Mercurial Phabricator instance.

branchmap: don't add branch entries if there are no headsClosedPublic

Details

Diff Detail

Event Timeline

Revision ContentsChangeset List

Diff 32079

mercurial/branchmap.py

branchmap: don't add branch entries if there are no heads
ClosedPublic

Revision Contents
Changeset List