mercurial/util.py

39563:b31b01f93b11

        self._head = head = _lrucachenode()
        head.prev = head
        head.next = head
        self._size = 1
        self._capacity = max

    def __len__(self):
        return len(self._cache)

    def __contains__(self, k):

        if node is not None:
            node.value = v
            self._movetohead(node)
            return

        if self._size < self._capacity:
            node = self._addcapacity()
        else:
            # Grab the last/oldest item.
            node = self._head.prev

            n = n.next

        self._cache.clear()

    def copy(self):
        result = lrucachedict(self._capacity)

        # We copy entries by iterating in oldest-to-newest order so the copy
        # has the correct ordering.

        # Find the first non-empty entry.

39564:5d75a3c16193

        self._head = head = _lrucachenode()
        head.prev = head
        head.next = head
        self._size = 1
        self.capacity = max

    def __len__(self):
        return len(self._cache)

    def __contains__(self, k):

        if node is not None:
            node.value = v
            self._movetohead(node)
            return

        if self._size < self.capacity:
            node = self._addcapacity()
        else:
            # Grab the last/oldest item.
            node = self._head.prev

            n = n.next

        self._cache.clear()

    def copy(self):
        result = lrucachedict(self.capacity)

        # We copy entries by iterating in oldest-to-newest order so the copy
        # has the correct ordering.

        # Find the first non-empty entry.