Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. fromList :: Collection el coll => [el] -> coll

   Agda	Agda.Termination.CallGraph

   No documentation available.

2. fromList :: Ord a => [a] -> Bag a

   Agda	Agda.Utils.Bag

   fromList = unions . map singleton
   

3. fromList :: (Ord k, Ord (Tag v), HasTag v) => [(k, v)] -> BiMap k v

   Agda	Agda.Utils.BiMap

   Conversion from lists of pairs. Later entries take precedence over earlier ones. O(n log n). Precondition: See fromListPrecondition.

4. fromList :: [Bool] -> BoolSet

   Agda	Agda.Utils.BoolSet

   No documentation available.

5. fromList :: PartialOrd a => [a] -> Favorites a

   Agda	Agda.Utils.Favorites

   Construct favorites from elements of a partial order. The result depends on the order of the list if it contains equal elements, since earlier seen elements are favored over later seen equals. The first element of the list is seen first.

6. fromList :: IsList l => [Item l] -> l

   Agda	Agda.Utils.List1

   The fromList function constructs the structure l from the given list of Item l

7. fromList :: Collection el coll => [el] -> coll

   Agda	Agda.Utils.Singleton

   No documentation available.

8. fromList :: SmallSetElement a => [a] -> SmallSet a

   Agda	Agda.Utils.SmallSet

   Time O(n).

9. fromList :: [Key] -> IntSet

   Agda	Agda.Utils.VarSet

   Create a set from a list of integers.

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

    Blammo	Data.Aeson.Compat

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

Page 26 of many | Previous | Next