comparison mercurial/revset.py @ 22829:36e09c25f870

baseset: explicitly track order of the baseset

A baseset starts without an explicit order. But as soon as a sort is requested,
we simply register that the baseset has an order and use the ordered version of
the list to behave accordingly.

We will want to properly record the order at creation time in the future. This
would unlock more optimisation and avoid some sorting.

22828:966860f7a1a8

    def __nonzero__(self):
        return bool(self._list)

    def sort(self, reverse=False):
        self._list.sort(reverse=reverse)

    def reverse(self):
        self._list.reverse()

    def __len__(self):
        return len(self._list)

    def __sub__(self, other):

        This is part of the mandatory API for smartset."""
        return self._ascending is not None and not self._ascending

    def first(self):
        if self:
            return self._list[0]
        return None

    def last(self):
        if self:
            return self._list[-1]
        return None

class filteredset(abstractsmartset):
    """Duck type for baseset class which iterates lazily over the revisions in
    the subset and contains a function which tests for membership in the

22829:36e09c25f870

    def __nonzero__(self):
        return bool(self._list)

    def sort(self, reverse=False):
        self._ascending = not bool(reverse)

    def reverse(self):
        if self._ascending is None:
            self._list.reverse()
        else:
            self._ascending = not self._ascending

    def __len__(self):
        return len(self._list)

    def __sub__(self, other):

        This is part of the mandatory API for smartset."""
        return self._ascending is not None and not self._ascending

    def first(self):
        if self:
            if self._ascending is None:
                return self._list[0]
            elif self._ascending:
                return self._asclist[0]
            else:
                return self._asclist[-1]
        return None

    def last(self):
        if self:
            if self._ascending is None:
                return self._list[-1]
            elif self._ascending:
                return self._asclist[-1]
            else:
                return self._asclist[0]
        return None

class filteredset(abstractsmartset):
    """Duck type for baseset class which iterates lazily over the revisions in
    the subset and contains a function which tests for membership in the