A tiny LRU cache implementation and decorator
repoze.lru is a LRU (least recently used) cache implementation. Keys and values that are not used frequently will be evicted from the cache faster than keys and values that are used frequently. It works under Python 2.5, Python 2.6, Python 2.7, and Python 3.2.
Creating an LRUCache object:
from repoze.lru import LRUCache cache = LRUCache(100) # 100 max length
Retrieving from an LRUCache object:
cache.get('nonexisting', 'foo') # will return 'foo' cache.get('nonexisting') # will return None cache.get('existing') # will return the value for existing
Adding to an LRUCache object:
cache.put('key', 'value') # will add the key 'key' with the value 'value'
Clearing an LRUCache:
A lru_cache decorator exists. All values passed to the decorated function must be hashable. It does not support keyword arguments:
from repoze.lru import lru_cache @lru_cache(500) def expensive_function(*arg): pass
Each function decorated with the lru_cache decorator uses its own cache related to that function.
- Moved to GitHub (https://github.com/repoze/repoze.lru).
- Added Python 3.2 support.
- Python 2.4 no longer supported.
- Added tox.ini for easier testing.
- Add a thread lock around clear logic.
- Add a clear method.
- Initial release.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size repoze.lru-0.4.tar.gz (7.2 kB)||File type Source||Python version None||Upload date||Hashes View|