Hoogle Search

Within LTS Haskell 24.21 (ghc-9.10.3)

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

Exact lookup

1. 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.

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

   containers	Data.Map.Strict

   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.

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

   containers	Data.Map.Strict.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.

4. foldl' :: (a -> b -> a) -> a -> Set b -> a

   containers	Data.Set

   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 -> Set b -> a

   containers	Data.Set.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' :: (b -> a -> b) -> b -> KeyMap a -> b

   aeson	Data.Aeson.KeyMap

   No documentation available.

7. foldl' :: (a -> v -> a) -> a -> HashMap k v -> a

   unordered-containers	Data.HashMap.Internal

   Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

8. foldl' :: (b -> a -> b) -> b -> Array a -> b

   unordered-containers	Data.HashMap.Internal.Array

   No documentation available.

9. foldl' :: (a -> v -> a) -> a -> HashMap k v -> a

   unordered-containers	Data.HashMap.Internal.Strict

   Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

10. foldl' :: (a -> v -> a) -> a -> HashMap k v -> a

    unordered-containers	Data.HashMap.Lazy

    Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

Page 3 of many | Previous | Next