Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key val

   lrucache	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.

2. 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.

3. 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.

4. fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key val

   lrucache	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.

5. fromList :: [a] -> AList a

   monad-par-extras	Control.Monad.Par.AList

   O(1) convert an ordinary list to an AList

6. fromList :: (Ord k, MonoidNull v) => [(k, v)] -> MonoidMap k v

   monoidmap-internal	Data.MonoidMap.Internal

   Constructs a MonoidMap from a list of key-value pairs. If the list contains more than one value for the same key, values are combined together in the order that they appear with the (<>) operator. Satisfies the following property for all possible keys k:

   get k (fromList kvs) ==
   foldMap snd (filter ((== k) . fst) kvs)
   

   Satisfies the following round-trip property:

   fromList (toList m) == m
   

   Examples

   With String values:

   >>> fromList [(1,"a"), (2,"x"), (1,"b"), (2,"y"), (1,"c"), (2,"z")]
   fromList [(1,"abc"), (2,"xyz")]
   

7. fromList :: Ord k => [(k, v)] -> Map k v

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

8. fromList :: [Int] -> IntMultiSet

   multiset	Data.IntMultiSet

   O(t*min(n,W)). Create a multiset from a list of elements.

9. fromList :: Ord a => [a] -> MultiSet a

   multiset	Data.MultiSet

   O(t*log t). Create a multiset from a list of elements.

10. fromList :: HeadedParsec Void Text FromClause

    postgresql-syntax	PostgresqlSyntax.Parsing

    No documentation available.

Page 23 of many | Previous | Next