comparison mercurial/revset.py @ 20512:659b8d8ddf19

revset: added cache to lazysets

This allows __contains__ to return faster when asked for same value twice.

20511:5840da876235

    revset
    """
    def __init__(self, subset, condition):
        self._subset = subset
        self._condition = condition

    def __contains__(self, x):
        return x in self._subset and self._condition(x)

    def __iter__(self):
        cond = self._condition
        for x in self._subset:
            if cond(x):

20512:659b8d8ddf19

    revset
    """
    def __init__(self, subset, condition):
        self._subset = subset
        self._condition = condition
        self._cache = {}

    def __contains__(self, x):
        c = self._cache
        if x not in c:
            c[x] = x in self._subset and self._condition(x)
        return c[x]

    def __iter__(self):
        cond = self._condition
        for x in self._subset:
            if cond(x):