Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

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

2. foldl' :: (b -> a -> b) -> b -> KeyMap a -> b

   aeson	Data.Aeson.KeyMap

   No documentation available.

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

4. foldlWithKey :: (a -> k -> 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).

5. foldlWithKey' :: (a -> k -> 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.

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

   unordered-containers	Data.HashMap.Internal.Array

   No documentation available.

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

8. foldlWithKey :: (a -> k -> 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).

9. foldlWithKey' :: (a -> k -> 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 30 of many | Previous | Next