1478             node = self._cache.pop(k)

  1478             node = self._cache.pop(k)

  1479         except KeyError:

  1479         except KeyError:

  1480             if default is _notset:

  1480             if default is _notset:

  1481                 raise

  1481                 raise

  1482             return default

  1482             return default

  1483         value = node.value

  1485         value = node.value

  1484         self.totalcost -= node.cost

  1486         self.totalcost -= node.cost

  1485         node.markempty()

  1487         node.markempty()

  1486 

  1488 

  1487         # Temporarily mark as newest item before re-adjusting head to make

  1489         # Temporarily mark as newest item before re-adjusting head to make

  1564         # Walk the linked list backwards starting at tail node until we hit

  1566         # Walk the linked list backwards starting at tail node until we hit

  1565         # a non-empty node.

  1567         # a non-empty node.

  1566         n = self._head.prev

  1568         n = self._head.prev

  1567         while n.key is _notset:

  1569         while n.key is _notset:

  1568             n = n.prev

  1570             n = n.prev

  1569 

  1573 

  1570         key, value = n.key, n.value

  1574         key, value = n.key, n.value

  1571 

  1575 

  1572         # And remove it from the cache and mark it as empty.

  1576         # And remove it from the cache and mark it as empty.

  1573         del self._cache[n.key]

  1577         del self._cache[n.key]