Copyright | (c) Moritz Kiefer 2016 (c) Jasper Van der Jeugt 2015 |
---|---|
License | BSD3 |
Maintainer | moritz.kiefer@purelyfunctional.org |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
This module contains internal datastructures. No guarantees are made as to the stability of this module and violating invariants can result in unspecified behavior.
Documentation
LRU cache based on hashing.
Instances
Foldable (LruCache k) Source # | |
Defined in Data.LruCache.Internal fold :: Monoid m => LruCache k m -> m # foldMap :: Monoid m => (a -> m) -> LruCache k a -> m # foldMap' :: Monoid m => (a -> m) -> LruCache k a -> m # foldr :: (a -> b -> b) -> b -> LruCache k a -> b # foldr' :: (a -> b -> b) -> b -> LruCache k a -> b # foldl :: (b -> a -> b) -> b -> LruCache k a -> b # foldl' :: (b -> a -> b) -> b -> LruCache k a -> b # foldr1 :: (a -> a -> a) -> LruCache k a -> a # foldl1 :: (a -> a -> a) -> LruCache k a -> a # toList :: LruCache k a -> [a] # null :: LruCache k a -> Bool # length :: LruCache k a -> Int # elem :: Eq a => a -> LruCache k a -> Bool # maximum :: Ord a => LruCache k a -> a # minimum :: Ord a => LruCache k a -> a # | |
Traversable (LruCache k) Source # | |
Defined in Data.LruCache.Internal | |
Functor (LruCache k) Source # | |
(Show k, Show v) => Show (LruCache k v) Source # | |
(NFData k, NFData v) => NFData (LruCache k v) Source # | |
Defined in Data.LruCache.Internal | |
(Eq v, Hashable k, Ord k) => Eq (LruCache k v) Source # | |