python-cachey

Cachey tries to hold on to values that have the following characteristics

Expensive to recompute (in seconds)
Cheap to store (in bytes)
Frequently used
Recenty used

It accomplishes this by adding the following to each items score on each access
score += compute_time / num_bytes * (1 + eps) ** tick_time


For some small value of epsilon (which determines the memory halflife). This
has units of inverse bandwidth, has exponential decay of old results and
roughly linear amplification of repeated results.

          

---

License: BSD-3-Clause
URL: http://github.com/mrocklin/cachey/