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 :: [(Key, a)] -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Create a map from a list of key/value pairs.

   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 :: [(Key, a)] -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Lazy

   Create a map from a list of key/value pairs.

   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 :: [(Key, a)] -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Strict

   Create a map from a list of key/value pairs.

   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 :: [(Key, a)] -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Strict.Internal

   Create a map from a list of key/value pairs.

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

5. fromList :: [Key] -> Word64Set

   ghc-lib-parser	GHC.Data.Word64Set

   Create a set from a list of integers.

6. fromList :: [Key] -> Word64Set

   ghc-lib-parser	GHC.Data.Word64Set.Internal

   Create a set from a list of integers.

7. fromList :: [(TargetPath, FileInfo)] -> FileMap

   hackage-security	Hackage.Security.TUF.FileMap

   No documentation available.

8. fromList :: Ord k => [(k, v)] -> OMap k v

   ordered-containers	Data.Map.Ordered

   If a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.

9. fromList :: Ord k => [(k, v)] -> OMap k v

   ordered-containers	Data.Map.Ordered.Strict

   If a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.

10. fromList :: Ord a => [a] -> OSet a

    ordered-containers	Data.Set.Ordered

    If a value occurs multiple times, only the first occurrence is used.

Page 13 of many | Previous | Next