Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right.

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

   text	Data.Text.Internal.Fusion.Common

   foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Stream, reduces the Stream using the binary operator, from left to right. Properties

   foldl f z0 . stream = foldl f z0
   

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

   text	Data.Text.Lazy

   O(n) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right.

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

   containers	Data.IntMap.Internal

   Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,

   elems = reverse . foldl (flip (:)) []
   

   let f len a = len + (length a)
   foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
   

5. foldl :: (a -> b -> a) -> a -> IntMap b -> a

   containers	Data.IntMap.Lazy

   Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,

   elems = reverse . foldl (flip (:)) []
   

   let f len a = len + (length a)
   foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
   

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

   containers	Data.IntMap.Strict

   Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,

   elems = reverse . foldl (flip (:)) []
   

   let f len a = len + (length a)
   foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
   

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

   containers	Data.IntMap.Strict.Internal

   Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,

   elems = reverse . foldl (flip (:)) []
   

   let f len a = len + (length a)
   foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
   

8. foldl :: (a -> Key -> a) -> a -> IntSet -> a

   containers	Data.IntSet

   Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList. For example,

   toDescList set = foldl (flip (:)) [] set
   

9. foldl :: (a -> Key -> a) -> a -> IntSet -> a

   containers	Data.IntSet.Internal

   Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList. For example,

   toDescList set = foldl (flip (:)) [] set
   

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

    containers	Data.Map.Internal

    Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems. For example,

    elems = reverse . foldl (flip (:)) []
    

    let f len a = len + (length a)
    foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
    

Page 2 of many | Previous | Next