Hoogle Search

Within LTS Haskell 24.4 (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

   miso	Miso.String

   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 :: Iso (alpha, beta) alpha -> Iso (alpha, [beta]) alpha

   partial-isomorphisms	Control.Isomorphism.Partial.Derived

   No documentation available.

3. foldl :: (b -> a -> b) -> b -> Patricia a -> b

   radix-tree	Data.Patricia.Word.Lazy

   Fold the tree left-to-right.

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

   radix-tree	Data.Patricia.Word.Strict

   Fold the tree left-to-right.

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

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Fold the tree left-to-right.

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

   radix-tree	Data.Radix1Tree.Word8.Strict

   Fold the tree left-to-right.

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

   radix-tree	Data.RadixTree.Word8.Lazy

   Fold the tree left-to-right.

8. foldl :: (b -> a -> b) -> b -> RadixTree a -> b

   radix-tree	Data.RadixTree.Word8.Strict

   Fold the tree left-to-right.

9. foldl :: (a -> Range -> Color -> a) -> a -> Zebra -> a

   radix-tree	Data.Zebra.Word

   Fold left-to-right over the ranges.

10. foldl :: forall b a (n :: Nat) . (b -> a -> b) -> b -> Tree n a -> b

    ral	Data.RAVec.Tree

    >>> foldl (flip (:)) [] $ Node (Leaf True) (Leaf False)
    [False,True]
    

Page 18 of many | Previous | Next