comparison mercurial/changelog.py @ 26061:be8a4e0800d8

reachableroots: use baseset lazy sorting

smartset sorting is lazy (so faster in some case) and better (informs that the
set is sorted allowing some optimisation). So we rely on it directly.

Some test output are updated because we now have more information (ordering).

26060:4ee2af2194d4

        # XXX need filtering too
        self.rev(self.node(0))
        return self._nodecache

    def reachableroots(self, minroot, heads, roots, includepath=False):
        return revset.baseset(sorted(
            self.index.reachableroots2(minroot, heads, roots, includepath)))

    def headrevs(self):
        if self.filteredrevs:
            try:
                return self.index.headrevsfiltered(self.filteredrevs)

26061:be8a4e0800d8

        # XXX need filtering too
        self.rev(self.node(0))
        return self._nodecache

    def reachableroots(self, minroot, heads, roots, includepath=False):
        rroots = self.index.reachableroots2(minroot, heads, roots, includepath)
        rroots = revset.baseset(rroots)
        rroots.sort()
        return rroots

    def headrevs(self):
        if self.filteredrevs:
            try:
                return self.index.headrevsfiltered(self.filteredrevs)