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 -> v -> a) -> a -> HashMap k v -> a

   unordered-containers	Data.HashMap.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.

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

   unordered-containers	Data.HashSet

   Reduce this set 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 before using the result in the next application. This function is strict in the starting value.

3. foldl' :: (a -> b -> a) -> a -> HashSet b -> a

   unordered-containers	Data.HashSet.Internal

   Reduce this set 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 before using the result in the next application. This function is strict in the starting value.

4. foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b

   hedgehog	Hedgehog.Internal.Prelude

   Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. sum). For a general Foldable structure this should be semantically identical to,

   foldl' f z = foldl' f z . toList
   

5. foldl' :: (a -> b -> a) -> a -> Word64Map b -> a

   ghc	GHC.Data.Word64Map.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' :: (a -> b -> a) -> a -> Word64Map b -> a

   ghc	GHC.Data.Word64Map.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.

7. foldl' :: (a -> b -> a) -> a -> Word64Map b -> a

   ghc	GHC.Data.Word64Map.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.

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

   ghc	GHC.Data.Word64Map.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.

9. foldl' :: (a -> Key -> a) -> a -> Word64Set -> a

   ghc	GHC.Data.Word64Set

   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. foldl' :: (a -> Key -> a) -> a -> Word64Set -> a

    ghc	GHC.Data.Word64Set.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.

Page 4 of many | Previous | Next