Safe Haskell | None |
---|---|
Language | Haskell2010 |
Data.Cache.Eviction.LFU
Synopsis
- data LFU k
- newLFU :: LFU k
- newtype LFUContentsOnlyEq k = LFUContentsOnlyEq (LFU k)
Documentation
Evict the least frequently used element from the cache. This means as an element is accessed, its "score" increases and the element is more likely to survive eviction once the cache fills up.
For testing
newtype LFUContentsOnlyEq k Source #
Constructors
LFUContentsOnlyEq (LFU k) |
Instances
(Hashable k, Ord k) => Eq (LFUContentsOnlyEq k) Source # | |
Defined in Data.Cache.Eviction.LFU Methods (==) :: LFUContentsOnlyEq k -> LFUContentsOnlyEq k -> Bool # (/=) :: LFUContentsOnlyEq k -> LFUContentsOnlyEq k -> Bool # | |
Show k => Show (LFUContentsOnlyEq k) Source # | |
Defined in Data.Cache.Eviction.LFU Methods showsPrec :: Int -> LFUContentsOnlyEq k -> ShowS # show :: LFUContentsOnlyEq k -> String # showList :: [LFUContentsOnlyEq k] -> ShowS # |