a simple implementation for the least recently used caching algorithm (LRU)
Project description
A simple python implementation for the least recently used caching algorithm.
Hello, world
A simple use for LRU:
from lru_py import LRU lru_cache = LRU(max_size = 2) lru_cache['hello'] = 'world' lru_cache['world'] = 'hello' lru_cache['hello'] = 'world' print "The first item now is: " + lru_cache.top() print "The value of the key 'world' now is: " + lru_cache['world'] print "The first item now after retrieving the key 'world' is: " +lru_cache.top()
How To:
Initializing an object:
lru_cache = LRU(max_size = 2)
Setting a value, regular assigningment with the square bracket operator [ ]:
lru_cache[‘hello’] = ‘world’
Retrieving a value, using square bracket operator [ ]:
lru_cache[‘hello’]
Deletin, using the del and using square bracket operators:
del lru_cache[‘hello’]
Retrieving the most recently used item:
lru_cache.top()
Installation
Automatic installation:
pip install lru_py
Manual installation: Download the latest source from GitHub.
tar xvzf lru_py-[VERSION].tar.gz cd lru_py-[VERSION] python setup.py build sudo python setup.py install
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
lru_py-0.1.tar.gz
(2.4 kB
view hashes)