| hg-reviewers |
So others can query it. Useful for operations that may want to verify
the cache has capacity for N items before it performs an operation that
may cause cache eviction.
| Automatic diff as part of commit; lint not applicable. |
| Automatic diff as part of commit; unit tests not applicable. |
| """ | """ | ||||
| def __init__(self, max): | def __init__(self, max): | ||||
| self._cache = {} | self._cache = {} | ||||
| self._head = head = _lrucachenode() | self._head = head = _lrucachenode() | ||||
| head.prev = head | head.prev = head | ||||
| head.next = head | head.next = head | ||||
| self._size = 1 | self._size = 1 | ||||
| self._capacity = max | self.capacity = max | ||||
| def __len__(self): | def __len__(self): | ||||
| return len(self._cache) | return len(self._cache) | ||||
| def __contains__(self, k): | def __contains__(self, k): | ||||
| return k in self._cache | return k in self._cache | ||||
| def __iter__(self): | def __iter__(self): | ||||
| def __setitem__(self, k, v): | def __setitem__(self, k, v): | ||||
| node = self._cache.get(k) | node = self._cache.get(k) | ||||
| # Replace existing value and mark as newest. | # Replace existing value and mark as newest. | ||||
| if node is not None: | if node is not None: | ||||
| node.value = v | node.value = v | ||||
| self._movetohead(node) | self._movetohead(node) | ||||
| return | return | ||||
| if self._size < self._capacity: | if self._size < self.capacity: | ||||
| node = self._addcapacity() | node = self._addcapacity() | ||||
| else: | else: | ||||
| # Grab the last/oldest item. | # Grab the last/oldest item. | ||||
| node = self._head.prev | node = self._head.prev | ||||
| # At capacity. Kill the old entry. | # At capacity. Kill the old entry. | ||||
| if node.key is not _notset: | if node.key is not _notset: | ||||
| del self._cache[node.key] | del self._cache[node.key] | ||||
| n = self._head | n = self._head | ||||
| while n.key is not _notset: | while n.key is not _notset: | ||||
| n.markempty() | n.markempty() | ||||
| n = n.next | n = n.next | ||||
| self._cache.clear() | self._cache.clear() | ||||
| def copy(self): | def copy(self): | ||||
| result = lrucachedict(self._capacity) | result = lrucachedict(self.capacity) | ||||
| # We copy entries by iterating in oldest-to-newest order so the copy | # We copy entries by iterating in oldest-to-newest order so the copy | ||||
| # has the correct ordering. | # has the correct ordering. | ||||
| # Find the first non-empty entry. | # Find the first non-empty entry. | ||||
| n = self._head.prev | n = self._head.prev | ||||
| while n.key is _notset and n is not self._head: | while n.key is _notset and n is not self._head: | ||||
| n = n.prev | n = n.prev | ||||
| from __future__ import absolute_import, print_function | from __future__ import absolute_import, print_function | ||||
| import unittest | import unittest | ||||
| import silenttestrunner | import silenttestrunner | ||||
| from mercurial import ( | from mercurial import ( | ||||
| util, | util, | ||||
| ) | ) | ||||
| class testlrucachedict(unittest.TestCase): | class testlrucachedict(unittest.TestCase): | ||||
| def testsimple(self): | def testsimple(self): | ||||
| d = util.lrucachedict(4) | d = util.lrucachedict(4) | ||||
| self.assertEqual(d.capacity, 4) | |||||
| d['a'] = 'va' | d['a'] = 'va' | ||||
| d['b'] = 'vb' | d['b'] = 'vb' | ||||
| d['c'] = 'vc' | d['c'] = 'vc' | ||||
| d['d'] = 'vd' | d['d'] = 'vd' | ||||
| self.assertEqual(d['a'], 'va') | self.assertEqual(d['a'], 'va') | ||||
| self.assertEqual(d['b'], 'vb') | self.assertEqual(d['b'], 'vb') | ||||
| self.assertEqual(d['c'], 'vc') | self.assertEqual(d['c'], 'vc') | ||||