caching-0: Cache combinators.

Safe HaskellNone
LanguageHaskell2010

Data.Cache.LRU

Documentation

data LRUCache m (s :: Strategy) p k t v Source #

data Strategy Source #

Constructors

FIFO

Priority is set on entry and not changed. | LIFO -- ^ A generally bad policy where the most recent thing is evicted.

LRU

Every lookup generates a new priority.

LFU

Priority is number of times looked up (tie breaker of order inserted?).