Data.Cache.Eviction.LFU

Documentation

data LFU k

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.

Instances

EvictionStrategy LFU

Methods

recordLookup :: (Eq k, Hashable k, Ord k) => k -> LFU k -> LFU k

evict :: (Eq k, Hashable k, Ord k) => LFU k -> (LFU k, Maybe k)

(Ord k, Hashable k) => Eq (LFU k)

Methods

(==) :: LFU k -> LFU k -> Bool

(/=) :: LFU k -> LFU k -> Bool

Show k => Show (LFU k)

Methods

showsPrec :: Int -> LFU k -> ShowS

show :: LFU k -> String

showList :: [LFU k] -> ShowS

newLFU :: LFU k

For testing

newtype LFUContentsOnlyEq k

Constructors

LFUContentsOnlyEq (LFU k)

Instances

(Hashable k, Ord k) => Eq (LFUContentsOnlyEq k)

Methods

(==) :: LFUContentsOnlyEq k -> LFUContentsOnlyEq k -> Bool

(/=) :: LFUContentsOnlyEq k -> LFUContentsOnlyEq k -> Bool

Show k => Show (LFUContentsOnlyEq k)

Methods

showsPrec :: Int -> LFUContentsOnlyEq k -> ShowS

show :: LFUContentsOnlyEq k -> String

showList :: [LFUContentsOnlyEq k] -> ShowS