26
26
class _LRUNode(object):
27
27
"""This maintains the linked-list which is the lru internals."""
29
__slots__ = ('prev', 'next_key', 'key', 'value', 'cleanup', 'size')
29
__slots__ = ('prev', 'next_key', 'key', 'value')
31
def __init__(self, key, value, cleanup=None):
31
def __init__(self, key, value):
33
33
self.next_key = _null_key
36
self.cleanup = cleanup
37
# TODO: We could compute this 'on-the-fly' like we used to, and remove
38
# one pointer from this object, we just need to decide if it
39
# actually costs us much of anything in normal usage
42
37
def __repr__(self):
43
38
if self.prev is None:
47
42
return '%s(%r n:%r p:%r)' % (self.__class__.__name__, self.key,
48
43
self.next_key, prev_key)
50
def run_cleanup(self):
52
if self.cleanup is not None:
53
self.cleanup(self.key, self.value)
55
# cleanup might raise an exception, but we want to make sure
56
# to break refcycles, etc
61
46
class LRUCache(object):
62
47
"""A class which manages a cache of entries, removing unused ones."""
64
def __init__(self, max_cache=100, after_cleanup_count=None,
65
after_cleanup_size=symbol_versioning.DEPRECATED_PARAMETER):
66
if symbol_versioning.deprecated_passed(after_cleanup_size):
67
symbol_versioning.warn('LRUCache.__init__(after_cleanup_size) was'
68
' deprecated in 1.11. Use'
69
' after_cleanup_count instead.',
71
after_cleanup_count = after_cleanup_size
49
def __init__(self, max_cache=100, after_cleanup_count=None):
73
51
# The "HEAD" of the lru linked list
74
52
self._most_recently_used = None
113
91
def __len__(self):
114
92
return len(self._cache)
117
"""Walk the LRU list, only meant to be used in tests."""
118
node = self._most_recently_used
120
if node.prev is not None:
121
raise AssertionError('the _most_recently_used entry is not'
122
' supposed to have a previous entry'
124
while node is not None:
125
if node.next_key is _null_key:
126
if node is not self._least_recently_used:
127
raise AssertionError('only the last node should have'
128
' no next value: %s' % (node,))
131
node_next = self._cache[node.next_key]
132
if node_next.prev is not node:
133
raise AssertionError('inconsistency found, node.next.prev'
134
' != node: %s' % (node,))
135
if node.prev is None:
136
if node is not self._most_recently_used:
137
raise AssertionError('only the _most_recently_used should'
138
' not have a previous node: %s'
141
if node.prev.next_key != node.key:
142
raise AssertionError('inconsistency found, node.prev.next'
143
' != node: %s' % (node,))
94
@symbol_versioning.deprecated_method(
95
symbol_versioning.deprecated_in((2, 5, 0)))
147
96
def add(self, key, value, cleanup=None):
148
"""Add a new value to the cache.
150
Also, if the entry is ever removed from the cache, call
153
:param key: The key to store it under
154
:param value: The object to store
155
:param cleanup: None or a function taking (key, value) to indicate
156
'value' should be cleaned up.
97
if cleanup is not None:
98
raise ValueError("Per-node cleanup functions no longer supported")
99
return self.__setitem__(key, value)
101
def __setitem__(self, key, value):
102
"""Add a new value to the cache"""
158
103
if key is _null_key:
159
104
raise ValueError('cannot use _null_key as a key')
160
105
if key in self._cache:
161
106
node = self._cache[key]
165
# Maintain the LRU properties, even if cleanup raises an
168
node.cleanup = cleanup
169
self._record_access(node)
108
self._record_access(node)
171
node = _LRUNode(key, value, cleanup=cleanup)
110
node = _LRUNode(key, value)
172
111
self._cache[key] = node
173
112
self._record_access(node)
199
138
return self._cache.keys()
202
"""Get the key:value pairs as a dict."""
141
"""Get a new dict with the same key:value pairs as the cache"""
203
142
return dict((k, n.value) for k, n in self._cache.iteritems())
144
items = symbol_versioning.deprecated_method(
145
symbol_versioning.deprecated_in((2, 5, 0)))(as_dict)
205
147
def cleanup(self):
206
148
"""Clear the cache until it shrinks to the requested size.
212
154
while len(self._cache) > self._after_cleanup_count:
213
155
self._remove_lru()
215
def __setitem__(self, key, value):
216
"""Add a value to the cache, there will be no cleanup function."""
217
self.add(key, value, cleanup=None)
219
157
def _record_access(self, node):
220
158
"""Record that key was accessed."""
221
159
# Move 'node' to the front of the queue
249
187
# If we have removed all entries, remove the head pointer as well
250
188
if self._least_recently_used is None:
251
189
self._most_recently_used = None
255
# cleanup might raise an exception, but we want to make sure to
256
# maintain the linked list
257
if node.prev is not None:
258
node.prev.next_key = node.next_key
259
if node.next_key is not _null_key:
260
node_next = self._cache[node.next_key]
261
node_next.prev = node.prev
262
# And remove this node's pointers
264
node.next_key = _null_key
190
if node.prev is not None:
191
node.prev.next_key = node.next_key
192
if node.next_key is not _null_key:
193
node_next = self._cache[node.next_key]
194
node_next.prev = node.prev
195
# And remove this node's pointers
197
node.next_key = _null_key
266
199
def _remove_lru(self):
267
200
"""Remove one entry from the lru, and handle consequences.
324
257
self._update_max_size(max_size, after_cleanup_size=after_cleanup_size)
325
258
LRUCache.__init__(self, max_cache=max(int(max_size/512), 1))
327
def add(self, key, value, cleanup=None):
328
"""Add a new value to the cache.
330
Also, if the entry is ever removed from the cache, call
333
:param key: The key to store it under
334
:param value: The object to store
335
:param cleanup: None or a function taking (key, value) to indicate
336
'value' should be cleaned up.
260
def __setitem__(self, key, value):
261
"""Add a new value to the cache"""
338
262
if key is _null_key:
339
263
raise ValueError('cannot use _null_key as a key')
340
264
node = self._cache.get(key, None)
349
273
if node is not None:
350
274
# We won't be replacing the old node, so just remove it
351
275
self._remove_node(node)
352
if cleanup is not None:
356
node = _LRUNode(key, value, cleanup=cleanup)
278
node = _LRUNode(key, value)
357
279
self._cache[key] = node
359
self._value_size -= node.size
360
node.size = value_len
281
self._value_size -= self._compute_size(node.value)
361
282
self._value_size += value_len
362
283
self._record_access(node)
376
297
self._remove_lru()
378
299
def _remove_node(self, node):
379
self._value_size -= node.size
300
self._value_size -= self._compute_size(node.value)
380
301
LRUCache._remove_node(self, node)
382
303
def resize(self, max_size, after_cleanup_size=None):
added
removed
bzrlib/lru_cache.py
