Xavier Morel
1b30a78beb
That's pretty much the entire point of OrderedDict's existence. Also removed the iteration methods: they're not used and they're not thread-safe, since they're written as generators they "return" instantaneously when called immediately unlocking, then the iteration itself is unprotected, so the entire thing is useless. They could be reimplemented with explicit locking (a `with self._lock` internally) if there's ever a use case for it, but that doesn't seem to be the case at the moment. closes odoo/odoo#46061 Signed-off-by: Xavier Morel (xmo) <xmo@odoo.com>
60 lines
1.3 KiB
Python
60 lines
1.3 KiB
Python
# -*- coding: utf-8 -*-
|
|
import collections
|
|
import threading
|
|
|
|
from .func import synchronized
|
|
|
|
__all__ = ['LRU']
|
|
|
|
class LRU(object):
|
|
"""
|
|
Implementation of a length-limited O(1) LRU map.
|
|
|
|
Original Copyright 2003 Josiah Carlson, later rebuilt on OrderedDict.
|
|
"""
|
|
def __init__(self, count, pairs=()):
|
|
self._lock = threading.RLock()
|
|
self.count = max(count, 1)
|
|
self.d = collections.OrderedDict()
|
|
for key, value in pairs:
|
|
self[key] = value
|
|
|
|
@synchronized()
|
|
def __contains__(self, obj):
|
|
return obj in self.d
|
|
|
|
def get(self, obj, val=None):
|
|
try:
|
|
return self[obj]
|
|
except KeyError:
|
|
return val
|
|
|
|
@synchronized()
|
|
def __getitem__(self, obj):
|
|
a = self.d[obj]
|
|
self.d.move_to_end(obj, last=False)
|
|
return a
|
|
|
|
@synchronized()
|
|
def __setitem__(self, obj, val):
|
|
self.d[obj] = val
|
|
self.d.move_to_end(obj, last=False)
|
|
while len(self.d) > self.count:
|
|
self.d.popitem(last=True)
|
|
|
|
@synchronized()
|
|
def __delitem__(self, obj):
|
|
del self.d[obj]
|
|
|
|
@synchronized()
|
|
def __len__(self):
|
|
return len(self.d)
|
|
|
|
@synchronized()
|
|
def pop(self,key):
|
|
return self.d.pop(key)
|
|
|
|
@synchronized()
|
|
def clear(self):
|
|
self.d.clear()
|