BSD-3-Clause licensed by Moritz Kiefer
Maintained by [email protected]
This version can be pinned in stack with:lrucaching-0.3.3@sha256:ca831e94c8bad99c6a56ec515b86b5e6835975c20721706bf609602a12318449,2010

Module documentation for 0.3.3


Build Status Hackage

An implementation of lrucaches based on a blogpost by Jasper Van der Jeugt.

This package has no relation to lrucache. I created it because there were bugs in lrucache and the maintainer was not responding to issues.


The easiest way to use this library is to use Data.LruCache.IO. This wraps the cache in a Data.IORef, a mutable varible in the IO monad.

e.g. To create a 1000-item cache, keyed by Integer, storing String:

import qualified Data.LruCache.IO as LRU

newCache :: IO (LRU.LruHandle Integer String)
newCache = LRU.newLruHandle 1000

cachedLookup cache key = LRU.cached cache key $
    -- insert some something expensive
    return $ show key

main :: IO ()
main = do
    cache <- newCache
    cachedLookup cache 123 >>= putStrLn



  • Drop support for GHC 7.8
  • Bump QuickCheck upper bound


  • Bump QuickCheck upper bound


  • Allow vector == 0.12.*
  • Do not use hspec-discover. This allows building the tests using cabal new-build.


  • Add Data.LruCache.IO.Finalizer for automatically running finalizer when evicting cache entrvies.
  • Rename newStripedHandle to newStripedLruHandle


  • Fix build with GHC 7.8


  • Don’t clear cache on clock overflow. This means that elements are never evicted without notifying the user via insertView.


Initial release.