mercurial/revlog.py

38782:7eba8f83129b

    def __contains__(self, rev):
        return 0 <= rev < len(self)
    def __len__(self):
        return len(self.index) - 1
    def __iter__(self):
        return iter(xrange(len(self)))
    def revs(self, start=0, stop=None):
        """iterate over all rev in this revlog (from start to stop)"""
        step = 1
        length = len(self)
        if stop is not None:

            stop += step
            if stop > length:
                stop = length
        else:
            stop = length
        return xrange(start, stop, step)

    @util.propertycache
    def nodemap(self):
        self.rev(self.node(0))
        return self._nodecache

            p = self._nodepos
            if p is None:
                p = len(i) - 2
            else:
                assert p < len(i)
            for r in xrange(p, -1, -1):
                v = i[r][7]
                n[v] = r
                if v == node:
                    self._nodepos = r - 1
                    return r

        # then reset internal state in memory to forget those revisions
        self._cache = None
        self._chaininfocache = {}
        self._chunkclear()
        for x in xrange(rev, len(self)):
            del self.nodemap[self.node(x)]

        del self.index[rev:-1]
        self._nodepos = None

38783:e7aa113b14f7

    def __contains__(self, rev):
        return 0 <= rev < len(self)
    def __len__(self):
        return len(self.index) - 1
    def __iter__(self):
        return iter(pycompat.xrange(len(self)))
    def revs(self, start=0, stop=None):
        """iterate over all rev in this revlog (from start to stop)"""
        step = 1
        length = len(self)
        if stop is not None:

            stop += step
            if stop > length:
                stop = length
        else:
            stop = length
        return pycompat.xrange(start, stop, step)

    @util.propertycache
    def nodemap(self):
        self.rev(self.node(0))
        return self._nodecache

            p = self._nodepos
            if p is None:
                p = len(i) - 2
            else:
                assert p < len(i)
            for r in pycompat.xrange(p, -1, -1):
                v = i[r][7]
                n[v] = r
                if v == node:
                    self._nodepos = r - 1
                    return r

        # then reset internal state in memory to forget those revisions
        self._cache = None
        self._chaininfocache = {}
        self._chunkclear()
        for x in pycompat.xrange(rev, len(self)):
            del self.nodemap[self.node(x)]

        del self.index[rev:-1]
        self._nodepos = None