Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
intern Data.Interned.IntSet O(n). Convert the set to a list of elements.
fromList :: [Item (KVITable v)] -> KVITable vkvitable Data.KVITable Converts a list of ([(Key,Val)], Value) tuples to a KVI table.
toList :: KVITable v -> [Item (KVITable v)]kvitable Data.KVITable Converts a KVI table to a list of ([(Key,Val)], Value) tuples.
fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key vallrucache Data.Cache.LRU Build a new LRU from the given maximum size and list of contents, in order from most recently accessed to least recently accessed.
toList :: Ord key => LRU key val -> [(key, val)]lrucache Data.Cache.LRU Retrieve a list view of an LRU. The items are returned in order from most recently accessed to least recently accessed.
fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)lrucache Data.Cache.LRU.IO Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.
toList :: Ord key => AtomicLRU key val -> IO [(key, val)]lrucache Data.Cache.LRU.IO Retrieve a list view of an AtomicLRU. See toList for the semantics.
fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)lrucache Data.Cache.LRU.IO.Internal Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.
toList :: Ord key => AtomicLRU key val -> IO [(key, val)]lrucache Data.Cache.LRU.IO.Internal Retrieve a list view of an AtomicLRU. See toList for the semantics.
fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key vallrucache Data.Cache.LRU.Internal Build a new LRU from the given maximum size and list of contents, in order from most recently accessed to least recently accessed.