Safe Haskell | None |
---|---|
Language | Haskell2010 |
Data.Cache.Eviction.LRU
Synopsis
- data SeqLRU k
- newSeqLRU :: SeqLRU k
- data LRU k
- newLRU :: LRU k
- newtype LRUContentsOnlyEq k = LRUContentsOnlyEq (LRU k)
Documentation
This is a naive and terribly slow version of an LRU cache
An optimized version of an LRU cache. The least recently used element in the cache is evicted once the cache fills up.
newtype LRUContentsOnlyEq k Source #
Constructors
LRUContentsOnlyEq (LRU k) |
Instances
(Hashable k, Ord k) => Eq (LRUContentsOnlyEq k) Source # | |
Defined in Data.Cache.Eviction.LRU Methods (==) :: LRUContentsOnlyEq k -> LRUContentsOnlyEq k -> Bool # (/=) :: LRUContentsOnlyEq k -> LRUContentsOnlyEq k -> Bool # | |
Show k => Show (LRUContentsOnlyEq k) Source # | |
Defined in Data.Cache.Eviction.LRU Methods showsPrec :: Int -> LRUContentsOnlyEq k -> ShowS # show :: LRUContentsOnlyEq k -> String # showList :: [LRUContentsOnlyEq k] -> ShowS # |