Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

Exact lookup

1. fromList :: Ord k => [(k, a)] -> Map k a

   containers	Data.Map.Lazy

   Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained. If the keys of the list are ordered, a linear-time implementation is used.

   fromList [] == empty
   fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
   fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
   

2. fromList :: Ord k => [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained. If the keys of the list are ordered, a linear-time implementation is used.

   fromList [] == empty
   fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
   fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
   

3. fromList :: Ord k => [(k, a)] -> Map k a

   containers	Data.Map.Strict.Internal

   Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained. If the keys of the list are ordered, a linear-time implementation is used.

   fromList [] == empty
   fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
   fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
   

4. fromList :: [a] -> Seq a

   containers	Data.Sequence

   Create a sequence from a finite list of elements. There is a function toList in the opposite direction for all instances of the Foldable class, including Seq.

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

   containers	Data.Sequence.Internal

   Create a sequence from a finite list of elements. There is a function toList in the opposite direction for all instances of the Foldable class, including Seq.

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

   containers	Data.Set

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

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

   containers	Data.Set.Internal

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

8. fromList :: [(Key, v)] -> KeyMap v

   aeson	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')]
   

9. fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.

10. fromList :: Int -> [a] -> Array a

    unordered-containers	Data.HashMap.Internal.Array

    No documentation available.

Page 2 of many | Previous | Next