Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. foldlWithKey :: (a -> Key -> b -> a) -> a -> IntMap b -> a

   containers	Data.IntMap.Strict.Internal

   Fold the keys and values in the map using the given left-associative binary operator, such that foldlWithKey f z == foldl (\z' (kx, x) -> f z' kx x) z . toAscList. For example,

   keys = reverse . foldlWithKey (\ks k x -> k:ks) []
   

   let f result k a = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
   foldlWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (3:b)(5:a)"
   

2. foldlWithKey' :: (a -> Key -> b -> a) -> a -> IntMap b -> a

   containers	Data.IntMap.Strict.Internal

   A strict version of foldlWithKey. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

3. foldl' :: (a -> Key -> a) -> a -> IntSet -> a

   containers	Data.IntSet

   A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

4. foldl' :: (a -> Key -> a) -> a -> IntSet -> a

   containers	Data.IntSet.Internal

   A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

5. foldl' :: (a -> b -> a) -> a -> Map k b -> a

   containers	Data.Map.Internal

   A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

6. foldl'Stack :: (b -> k -> a -> Map k a -> b) -> b -> Stack k a -> b

   containers	Data.Map.Internal

   No documentation available.

7. foldlWithKey :: (a -> k -> b -> a) -> a -> Map k b -> a

   containers	Data.Map.Internal

   Fold the keys and values in the map using the given left-associative binary operator, such that foldlWithKey f z == foldl (\z' (kx, x) -> f z' kx x) z . toAscList. For example,

   keys = reverse . foldlWithKey (\ks k x -> k:ks) []
   

   let f result k a = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
   foldlWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (3:b)(5:a)"
   

8. foldlWithKey' :: (a -> k -> b -> a) -> a -> Map k b -> a

   containers	Data.Map.Internal

   A strict version of foldlWithKey. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

9. foldl' :: (a -> b -> a) -> a -> Map k b -> a

   containers	Data.Map.Lazy

   A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

10. foldlWithKey :: (a -> k -> b -> a) -> a -> Map k b -> a

    containers	Data.Map.Lazy

    Fold the keys and values in the map using the given left-associative binary operator, such that foldlWithKey f z == foldl (\z' (kx, x) -> f z' kx x) z . toAscList. For example,

    keys = reverse . foldlWithKey (\ks k x -> k:ks) []
    

    let f result k a = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
    foldlWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (3:b)(5:a)"
    

Page 28 of many | Previous | Next