mercurial/revset.py

20707:1d5d6f622b94

    def __sub__(self, x):
        return lazyset(self, lambda r: r not in x)

    def __add__(self, x):
        return lazyset(addset(self, x))

    def __nonzero__(self):
        for r in self:
            return True
        return False

    def reverse(self):
        self._subset.reverse()
        self._ascending = not self._ascending

class addset(object):
    """Wrapper structure for lazily adding two structures without losing much
    performance on the __contains__ method
    """
    def __init__(self, revs1, revs2):
        self._r1 = revs1
        self._r2 = revs2
        self._iter = None

            return orderedlazyset(self, lambda r: r not in x)
        else:
            return orderedlazyset(self, lambda r: r not in x, ascending=False)

    def __add__(self, x):
        return lazyset(addset(self, x))

    def __len__(self):
        if not self._hiddenrevs:
            return abs(self._end - self._start)
        else:

20708:17c89e5a5627

    def __sub__(self, x):
        return lazyset(self, lambda r: r not in x)

    def __add__(self, x):
        return lazyset(_addset(self, x))

    def __nonzero__(self):
        for r in self:
            return True
        return False

    def reverse(self):
        self._subset.reverse()
        self._ascending = not self._ascending

class _addset(object):
    """Represent the addition of two sets

    Wrapper structure for lazily adding two structures without losing much
    performance on the __contains__ method

    This class does not duck-type baseset and it's only supposed to be used
    internally
    """
    def __init__(self, revs1, revs2):
        self._r1 = revs1
        self._r2 = revs2
        self._iter = None

            return orderedlazyset(self, lambda r: r not in x)
        else:
            return orderedlazyset(self, lambda r: r not in x, ascending=False)

    def __add__(self, x):
        return lazyset(_addset(self, x))

    def __len__(self):
        if not self._hiddenrevs:
            return abs(self._end - self._start)
        else: