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 :: IsSequence seq => [Element seq] -> seq

   mono-traversable	Data.Sequences

   Convert a list to a sequence.

   > fromList [a, b, c] :: Text
   "abc"
   

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

   autodocodec	Autodocodec.Aeson.Compat

   No documentation available.

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

   rio	RIO.HashMap

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

4. fromList :: (Eq a, Hashable a) => [a] -> HashSet a

   rio	RIO.HashSet

   Construct a set from a list of elements.

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

   rio	RIO.Map

   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")]
   

6. fromList :: HasCallStack => [a] -> NonEmpty a

   rio	RIO.NonEmpty.Partial

   Converts a normal list to a NonEmpty stream. Raises an error if given an empty list.

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

   rio	RIO.Seq

   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.

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

   rio	RIO.Set

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

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

   rio	RIO.Vector

   No documentation available.

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

    rio	RIO.Vector.Boxed

    No documentation available.

Page 6 of many | Previous | Next