Safe Haskell	None
Language	Haskell2010

Data.Cache

Synopsis

Documentation

data Cache k v s Source #

Arguments

:: (Hashable k, NFData v, EvictionStrategy s, Eq k, Ord k)
=> Int	The maximum cache size
-> s k	The evictionStrategy
-> Cache k v (s k)

Minimal complete definition

Methods

Arguments

:: (Eq k, Hashable k, Ord k)
=> k	The key to lookup
-> s k	The strategy (containing any state necessary)
-> s k	The strategy + state folloiwng adding the key

evict :: (Eq k, Hashable k, Ord k) => s k -> (s k, Maybe k) Source #

Instances

EvictionStrategy LFU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> LFU k -> LFU k Source # evict :: (Eq k, Hashable k, Ord k) => LFU k -> (LFU k, Maybe k) Source #
EvictionStrategy LRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> LRU k -> LRU k Source # evict :: (Eq k, Hashable k, Ord k) => LRU k -> (LRU k, Maybe k) Source #
EvictionStrategy SeqLRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> SeqLRU k -> SeqLRU k Source # evict :: (Eq k, Hashable k, Ord k) => SeqLRU k -> (SeqLRU k, Maybe k) Source #
EvictionStrategy MRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> MRU k -> MRU k Source # evict :: (Eq k, Hashable k, Ord k) => MRU k -> (MRU k, Maybe k) Source #
EvictionStrategy RR Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> RR k -> RR k Source # evict :: (Eq k, Hashable k, Ord k) => RR k -> (RR k, Maybe k) Source #

This is a naive and terribly slow version of an LRU cache

Instances

EvictionStrategy SeqLRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> SeqLRU k -> SeqLRU k Source # evict :: (Eq k, Hashable k, Ord k) => SeqLRU k -> (SeqLRU k, Maybe k) Source #
Eq k => Eq (SeqLRU k) Source #
Methods (==) :: SeqLRU k -> SeqLRU k -> Bool # (/=) :: SeqLRU k -> SeqLRU k -> Bool #
Show k => Show (SeqLRU k) Source #
Methods showsPrec :: Int -> SeqLRU k -> ShowS # show :: SeqLRU k -> String # showList :: [SeqLRU k] -> ShowS #

An optimized version of an LRU cache

Instances

EvictionStrategy LRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> LRU k -> LRU k Source # evict :: (Eq k, Hashable k, Ord k) => LRU k -> (LRU k, Maybe k) Source #
(Ord k, Hashable k) => Eq (LRU k) Source #
Methods (==) :: LRU k -> LRU k -> Bool # (/=) :: LRU k -> LRU k -> Bool #
Show k => Show (LRU k) Source #
Methods showsPrec :: Int -> LRU k -> ShowS # show :: LRU k -> String # showList :: [LRU k] -> ShowS #

Instances

EvictionStrategy MRU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> MRU k -> MRU k Source # evict :: (Eq k, Hashable k, Ord k) => MRU k -> (MRU k, Maybe k) Source #
(Ord k, Hashable k) => Eq (MRU k) Source #
Methods (==) :: MRU k -> MRU k -> Bool # (/=) :: MRU k -> MRU k -> Bool #
Show k => Show (MRU k) Source #
Methods showsPrec :: Int -> MRU k -> ShowS # show :: MRU k -> String # showList :: [MRU k] -> ShowS #

Random Replacement cache. The seed is fixed to an StdGen since its both easily accessible & good enough for this purpose.

Instances

EvictionStrategy RR Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> RR k -> RR k Source # evict :: (Eq k, Hashable k, Ord k) => RR k -> (RR k, Maybe k) Source #
Eq k => Eq (RR k) Source #
Methods (==) :: RR k -> RR k -> Bool # (/=) :: RR k -> RR k -> Bool #
Show k => Show (RR k) Source #
Methods showsPrec :: Int -> RR k -> ShowS # show :: RR k -> String # showList :: [RR k] -> ShowS #

Least Frequently Used Cache

Instances

EvictionStrategy LFU Source #
Methods recordLookup :: (Eq k, Hashable k, Ord k) => k -> LFU k -> LFU k Source # evict :: (Eq k, Hashable k, Ord k) => LFU k -> (LFU k, Maybe k) Source #
(Ord k, Hashable k) => Eq (LFU k) Source #
Methods (==) :: LFU k -> LFU k -> Bool # (/=) :: LFU k -> LFU k -> Bool #
Show k => Show (LFU k) Source #
Methods showsPrec :: Int -> LFU k -> ShowS # show :: LFU k -> String # showList :: [LFU k] -> ShowS #