comparison mercurial/revset.py @ 20739:1b4f2399f3c4

revset: add documentation and comment for _generatorset

(clean up some old irrelevant comment in the process)

20738:33943add5d65

    This class does not duck-type baseset and it's only supposed to be used
    internally
    """
    def __init__(self, gen):
        self._gen = gen
        self._iter = iter(gen)
        self._cache = {}
        self._genlist = baseset([])
        self._iterated = False

    def __contains__(self, x):
        if x in self._cache:
            return self._cache[x]

        for l in self:
            if l == x:
                return True

        self._finished = True
        self._cache[x] = False
        return False

    def __iter__(self):
        if self._iterated:
            for l in self._genlist:
                yield l
        else:
            self._iterated = True

        for item in self._gen:
            self._cache[item] = True
            self._genlist.append(item)
            yield item

        self._finished = True

    def set(self):
        return self

    def sort(self, reverse=False):
        # Basic implementation to be changed in future patches
        if not self._finished:
            for i in self:
                continue
        self._genlist.sort(reverse=reverse)

20739:1b4f2399f3c4

    This class does not duck-type baseset and it's only supposed to be used
    internally
    """
    def __init__(self, gen):
        """
        gen: a generator producing the values for the generatorset.
        """
        self._gen = gen
        self._iter = iter(gen)
        self._cache = {}
        self._genlist = baseset([])
        self._iterated = False

    def __contains__(self, x):
        if x in self._cache:
            return self._cache[x]

        # Use __iter__ which caches values and stores them into self._genlist
        for l in self:
            if l == x:
                return True

        self._finished = True
        self._cache[x] = False
        return False

    def __iter__(self):
        if self._iterated:
            # At least a part of the list should be cached if iteration has
            # started over the generatorset.
            for l in self._genlist:
                yield l
        else:
            # Starting iteration over the generatorset.
            self._iterated = True

        for item in self._gen:
            self._cache[item] = True
            self._genlist.append(item)
            yield item

        # Iteration over the generator has finished. Whole value list should be
        # cached in self._genlist
        self._finished = True

    def set(self):
        return self

    def sort(self, reverse=False):
        if not self._finished:
            for i in self:
                continue
        self._genlist.sort(reverse=reverse)