This project contains a dictionary (key/value) type cache. The cache has two limiting strategies that limit the amount of objects in storage and two purge strategies that specify what needs to be done when the cache grows too large (hits the limits).

Available limiting strategies:

  • Limit by number of items
  • Limit by estimated memory usage

Available purge strategies:

  • Remove least used item(s)
  • Remove least recently used item(s)

KeyedCache is hosted on GitHub

The reference manual is here