mercurial/revlog.py

4977:6cb30bc4ca32

            if not ret:
                self.p.loadindex(i)
                ret = self.p.index[i]
            if isinstance(ret, str):
                ret = struct.unpack(indexformatng, ret)
            yield ret[-1]
    def __getitem__(self, key):
        try:
            return self.p.map[key]
        except KeyError:
            try:

        if inline:
            self.chunkcache = (0, data)
        while off + s <= l:
            e = struct.unpack(indexformatng, data[off:off + s])
            index.append(e)
            nodemap[e[-1]] = n
            n += 1
            off += s
            if inline:
                if e[1] < 0:
                    break

    def _inline(self): return self.version & REVLOGNGINLINEDATA

    def tip(self): return self.node(len(self.index) - 1)
    def count(self): return len(self.index)
    def node(self, rev):
        return rev == nullrev and nullid or self.index[rev][-1]
    def rev(self, node):
        try:
            return self.nodemap[node]
        except KeyError:
            raise LookupError(_('%s: no node %s') % (self.indexfile, hex(node)))
    def linkrev(self, node):
        return (node == nullid) and nullrev or self.index[self.rev(node)][-4]
    def parents(self, node):
        if node == nullid: return (nullid, nullid)
        r = self.rev(node)
        d = self.index[r][-3:-1]
        return (self.node(d[0]), self.node(d[1]))
    def parentrevs(self, rev):
        if rev == nullrev:
            return (nullrev, nullrev)
        d = self.index[rev][-3:-1]
        return d
    def start(self, rev):
        if rev == nullrev:
            return 0
        return getoffset(self.index[rev][0])

            return self.index[rev][1]
    def base(self, rev):
        if (rev == nullrev):
            return nullrev
        else:
            return self.index[rev][-5]

    def reachable(self, node, stop=None):
        """return a hash of all nodes ancestral to a given node, including
         the node itself, stopping when stop is matched"""
        reachable = {}

        # When stripping away a revision, we need to make sure it
        # does not actually belong to an older changeset.
        # The minlink parameter defines the oldest revision
        # we're allowed to strip away.
        while minlink > self.index[rev][-4]:
            rev += 1
            if rev >= self.count():
                return

        # first truncate the files on disk

4978:93d48a8fa496

            if not ret:
                self.p.loadindex(i)
                ret = self.p.index[i]
            if isinstance(ret, str):
                ret = struct.unpack(indexformatng, ret)
            yield ret[7]
    def __getitem__(self, key):
        try:
            return self.p.map[key]
        except KeyError:
            try:

        if inline:
            self.chunkcache = (0, data)
        while off + s <= l:
            e = struct.unpack(indexformatng, data[off:off + s])
            index.append(e)
            nodemap[e[7]] = n
            n += 1
            off += s
            if inline:
                if e[1] < 0:
                    break

    def _inline(self): return self.version & REVLOGNGINLINEDATA

    def tip(self): return self.node(len(self.index) - 1)
    def count(self): return len(self.index)
    def node(self, rev):
        return rev == nullrev and nullid or self.index[rev][7]
    def rev(self, node):
        try:
            return self.nodemap[node]
        except KeyError:
            raise LookupError(_('%s: no node %s') % (self.indexfile, hex(node)))
    def linkrev(self, node):
        return (node == nullid) and nullrev or self.index[self.rev(node)][4]
    def parents(self, node):
        if node == nullid: return (nullid, nullid)
        r = self.rev(node)
        d = self.index[r][5:7]
        return (self.node(d[0]), self.node(d[1]))
    def parentrevs(self, rev):
        if rev == nullrev:
            return (nullrev, nullrev)
        d = self.index[rev][5:7]
        return d
    def start(self, rev):
        if rev == nullrev:
            return 0
        return getoffset(self.index[rev][0])

            return self.index[rev][1]
    def base(self, rev):
        if (rev == nullrev):
            return nullrev
        else:
            return self.index[rev][3]

    def reachable(self, node, stop=None):
        """return a hash of all nodes ancestral to a given node, including
         the node itself, stopping when stop is matched"""
        reachable = {}

        # When stripping away a revision, we need to make sure it
        # does not actually belong to an older changeset.
        # The minlink parameter defines the oldest revision
        # we're allowed to strip away.
        while minlink > self.index[rev][4]:
            rev += 1
            if rev >= self.count():
                return

        # first truncate the files on disk