Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromList :: [(Key, v)] -> KeyMap vaeson Data.Aeson.KeyMap Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.
>>> fromList [("a", 'x'), ("a", 'y')] fromList [("a",'y')]fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k vunordered-containers Data.HashMap.Internal Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.
fromList :: Int -> [a] -> Array aunordered-containers Data.HashMap.Internal.Array No documentation available.
fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k vunordered-containers Data.HashMap.Internal.Strict Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.
fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k vunordered-containers Data.HashMap.Lazy Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.
fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k vunordered-containers Data.HashMap.Strict Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.
fromList :: (Eq a, Hashable a) => [a] -> HashSet aunordered-containers Data.HashSet Construct a set from a list of elements.
fromList :: (Eq a, Hashable a) => [a] -> HashSet aunordered-containers Data.HashSet.Internal Construct a set from a list of elements.
-
lens Control.Lens.Internal.Deque O(n) amortized. Construct a Deque from a list of values.
>>> fromList [1,2] BD 1 [1] 1 [2]
fromList :: HasCallStack => [a] -> NonEmpty abase-compat Data.List.NonEmpty.Compat Converts a normal list to a NonEmpty stream. Raises an error if given an empty list.
Page 1 of many | Next