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 :: MultiMap m k v => [(k, Set v)] -> m k v

   monoidmap-examples	Data.MonoidMap.Examples.MultiMap.Class

   Constructs a multimap from a list of key to value set mappings. Removing empty sets from the input list does not affect the result:

   fromList ≡ fromList . filter ((/= Set.empty) . snd)
   

2. fromList :: Ord a => [(a, Natural)] -> MultiSet a

   monoidmap-examples	Data.MonoidMap.Examples.MultiSet

   No documentation available.

3. fromList :: forall (c :: Type -> Type) v k . (Collection c, IsList (c v), Item (c v) ~ v, Ord k) => [(k, v)] -> Multimap c k v

   more-containers	Data.Multimap

   O(n * log n) Builds a multimap from a list of key, value tuples. The values are in the same order as in the original list.

4. fromList :: Ord v => [v] -> Multiset v

   more-containers	Data.Multiset

   O(n * log n) Builds a multiset from values.

5. fromList :: [Char] -> CharSet

   parser-regex	Data.CharSet

   Create a set from Chars in a list.

6. fromList :: [Char] -> CharSet

   parser-regex	Regex.Internal.CharSet

   Create a set from Chars in a list.

7. fromList :: [(Text, Text)] -> Labels

   prometheus	System.Metrics.Prometheus.MetricId

   No documentation available.

8. fromList :: Ord a => [a] -> Set a

   protobuf-simple	Data.ProtoBufInt

   Create a set from a list of elements. If the elements are ordered, a linear-time implementation is used.

9. fromList :: Storable a => [a] -> Vector a

   qchas	QC

   No documentation available.

10. fromList :: [a] -> Queue a

    queues	Queue

    Construct a queue from a list. The head of the list corresponds to the front of the queue.

Page 32 of many | Previous | Next