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.
foldl1Elems :: (a -> a -> a) -> Array i a -> abase GHC.Arr A left fold over the elements with no starting value
foldlElems :: (b -> a -> b) -> b -> Array i a -> bbase GHC.Arr A left fold over the elements
foldlElems' :: (b -> a -> b) -> b -> Array i a -> bbase GHC.Arr A strict left fold over the elements
foldl' :: forall a b . (b -> a -> b) -> b -> [a] -> bbase GHC.List A strict version of foldl.
foldl1 :: HasCallStack => (a -> a -> a) -> [a] -> abase GHC.List foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty lists. Note that unlike foldl, the accumulated value must be of the same type as the list elements.
>>> foldl1 (+) [1..4] 10 >>> foldl1 (+) [] *** Exception: Prelude.foldl1: empty list >>> foldl1 (-) [1..4] -8 >>> foldl1 (&&) [True, False, True, True] False >>> foldl1 (||) [False, False, True, True] True >>> foldl1 (+) [1..] * Hangs forever *
foldl1' :: HasCallStack => (a -> a -> a) -> [a] -> abase GHC.List A strict version of foldl1.
foldl' :: (a -> Word8 -> a) -> a -> ByteString -> abytestring Data.ByteString foldl1 :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8bytestring Data.ByteString foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings. An exception will be thrown in the case of an empty ByteString.
foldl1' :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8bytestring Data.ByteString foldl1' is like foldl1, but strict in the accumulator. An exception will be thrown in the case of an empty ByteString.
foldl' :: (a -> Char -> a) -> a -> ByteString -> abytestring Data.ByteString.Char8 foldl' is like foldl, but strict in the accumulator.