repoze.lru

0.6 BSD License    
  UNRATED

  165 downloads

A tiny LRU cache implementation and decorator

description

download

specs

changelog

repoze.lru is a LRU (least recently used) cache implementation and decorator. 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.

API

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:

cache.clear()

Decorator

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.
read more   
Last updated on July 14th, 2012

0 User reviews so far.

SUBMIT

#tiny LRU #cache implementation #cache decorator #tiny #LRU #cache #decorator