lrucache
Version 1.1.1.3 revision 0 uploaded by CarlHowells.
Package meta
- Synopsis
- a simple, pure LRU cache
- Description
This package contains a simple, pure LRU cache, implemented in terms of Data.Map.
It also contains a mutable IO wrapper providing atomic updates to an LRU cache.
Version History:
1.1.3 - Test for containers >= 0.5, rather than GHC >= 7.6
1.1.2 - Make actually compatible with containers 0.5 - fix strictness issue
1.1.1 - Fix containers upper bound for GHC 7.6.
1.1 - Add an additional modification function for AtomicLRUCache.
1.0.1 - Update containers constraint to allow containers from ghc-7
1 - Add a Functor instance for LRUCache. Add a generic modification function for AtomicLRUCache.
0 - Breaking API changes: 1) The newLRU smart constructor now makes the maximum size optional. 2) The delete function now returns the value removed, if one was. Additionally, a function was added to remove the least-recently used element in the LRU.
3 - Added a Show instance for LRU. (Requested by Ben Lee)
2.0.1 - Increase strictness slightly. Remove cabal target for test executable. (Just include test sources instead.)
2 - Added an Eq instance for LRU. Added strictness to eliminate space leaks in common use patterns.
1.1 - Add the Data.Cache.LRU.IO.Internal module. Clean up build warnings on GHC 6.12.1.
1.0.1 - Minor refactoring
1 - First release
- Author
- Carl Howells
- Bug reports
- n/a
- Category
- Data
- Copyright
- Carl Howells, 2010
- Homepage
- http://github.com/chowells79/lrucache
- Maintainer
- chowells79@gmail.com
- Package URL
- n/a
- Stability
- Experimental