Hoogle Search

Within LTS Haskell 22.24 (ghc-9.6.5)

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

Exact lookup

1. foldl' :: (a -> Char -> a) -> a -> Text -> a

   text	Data.Text

   O(n) A strict version of foldl.

2. foldl' :: (b -> Char -> b) -> b -> Stream Char -> b

   text	Data.Text.Internal.Fusion.Common

   A strict version of foldl. Properties

   foldl' f z0 . stream = foldl' f z0
   

3. foldl' :: (a -> Char -> a) -> a -> Text -> a

   text	Data.Text.Lazy

   O(n) A strict version of foldl.

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

   containers	Data.IntMap.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 -> IntMap b -> a

   containers	Data.IntMap.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.

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

   containers	Data.IntMap.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.

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

   containers	Data.IntMap.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.

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

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

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

Page 2 of many | Previous | Next