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

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

   Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'.

   let f key new_value old_value = show key ++ ":" ++ new_value ++ "|" ++ old_value
   fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "3:a|b"), (5, "5:c|5:b|a")]
   fromListWithKey f [] == empty
   

2. fromListWith :: (a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Create a map from a list of key/value pairs with a combining function. See also fromAscListWith.

   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "ab"), (5, "cba")]
   fromListWith (++) [] == empty
   

3. fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'.

   let f key new_value old_value = show key ++ ":" ++ new_value ++ "|" ++ old_value
   fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "3:a|b"), (5, "5:c|5:b|a")]
   fromListWithKey f [] == empty
   

4. fromListWith :: (a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Create a map from a list of key/value pairs with a combining function. See also fromAscListWith.

   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
   fromListWith (++) [] == empty
   

5. fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'.

   let f key new_value old_value = show key ++ ":" ++ new_value ++ "|" ++ old_value
   fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "3:a|b"), (5, "5:c|5:b|a")]
   fromListWithKey f [] == empty
   

6. fromListWith :: (a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Create a map from a list of key/value pairs with a combining function. See also fromAscListWith.

   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
   fromListWith (++) [] == empty
   

7. fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> Word64Map a

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

   Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'.

   let f key new_value old_value = show key ++ ":" ++ new_value ++ "|" ++ old_value
   fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "3:a|b"), (5, "5:c|5:b|a")]
   fromListWithKey f [] == empty
   

8. fromListUniqueSet :: [Unique] -> UniqueSet

   ghc-lib-parser	GHC.Types.Unique.Set

   No documentation available.

9. fromListN :: Steppable (->) t (XNor a) => Int -> [a] -> t

   yaya	Yaya.Applied

   An implementation of fromListN for Steppable fixed-points of XNor. This should return an empty structure if the Int is negative. If the target structure isn’t Steppable or the target structure is Corecursive (i.e., unsafeFromList isn’t used), then the default definition for fromListN should suffice.

10. fromListMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => [a] -> m (Mutable arr (PrimState m) a)

    contiguous	Data.Primitive.Contiguous

    Convert a list into a mutable array of the given length.

Page 48 of many | Previous | Next