h* g !      0.3.4(c) Moritz Kiefer, 2016 (c) Jasper Van der Jeugt, 2015BSD3"moritz.kiefer@purelyfunctional.org Safe-Inferred9:;e lrucachingLRU cache based on hashing. lrucaching+The maximum number of elements in the queue lrucaching+The current number of elements in the queue lrucachingThe next logical time lrucachingUnderlying priority queue lrucaching3Logical time at which an element was last accessed.(c) Moritz Kiefer, 2016 (c) Jasper Van der Jeugt, 2015BSD3"moritz.kiefer@purelyfunctional.org Safe-Inferred9:;M  lrucachingCreate an empty  of the given size.! lrucachingRestore 1 invariants returning the evicted element if any." lrucachingRestore 2 invariants. For performance reasons this is not  snd . trim'. lrucachingInsert an element into the . lrucachingInsert an element into the ' returning the evicted element if any.When the logical clock reaches its maximum value and all values are evicted # is returned. lrucachingLookup an element in an - and mark it as the least recently accessed.  (c) Moritz Kiefer, 2016 (c) Jasper Van der Jeugt, 2015BSD3"moritz.kiefer@purelyfunctional.org Safe-Inferred lrucachingUsing a stripe of multiple handles can improve the performance in the case of concurrent accesses since several handles can be accessed in parallel. lrucachingStore a LRU cache in an 'IORef to be able to conveniently update it. lrucaching)Create a new LRU cache of the given size. lrucachingReturn the cached result of the action or, in the case of a cache miss, execute the action and insert it in the cache. lrucaching Create a new  StripedHandle with the given number of stripes and the given capacity for each stripe. lrucachingStriped version of . lrucaching finalizer  lrucaching finalizer (c) Moritz Kiefer, 2016 (c) Jasper Van der Jeugt, 2015BSD3"moritz.kiefer@purelyfunctional.org Safe-Inferred  lrucachingUsing a stripe of multiple handles can improve the performance in the case of concurrent accesses since several handles can be accessed in parallel. lrucachingStore a LRU cache in an 'IORef to be able to conveniently update it. lrucaching)Create a new LRU cache of the given size. lrucachingReturn the cached result of the action or, in the case of a cache miss, execute the action and insert it in the cache. lrucaching Create a new  StripedHandle with the given number of stripes and the given capacity for each stripe.  lrucachingStriped version of .  $      !'lrucaching-0.3.4-BVoMuPNiY0AGfiaKpbSRBlData.LruCache.Internal Data.LruCacheData.LruCache.IO.FinalizerData.LruCache.IO lrucachingLruCache lruCapacitylruSizelruTicklruQueuePriority$fNFDataLruCache $fEqLruCache$fShowLruCache$fFunctorLruCache$fFoldableLruCache$fTraversableLruCacheemptyinsert insertViewlookupStripedLruHandle LruHandle newLruHandlecachednewStripedLruHandle stripedCachedtrim'trimbase GHC.MaybeNothing