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.
foldl1 :: (Char -> Char -> Char) -> ByteString -> Charbytestring Data.ByteString.Char8 foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings.
foldl1' :: (Char -> Char -> Char) -> ByteString -> Charbytestring Data.ByteString.Char8 A strict version of foldl1
foldl' :: (a -> Word8 -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy foldl1 :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8bytestring Data.ByteString.Lazy foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings.
foldl1' :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8bytestring Data.ByteString.Lazy foldlChunks :: (a -> StrictByteString -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy Consume the chunks of a lazy ByteString with a strict, tail-recursive, accumulating left fold.
foldl' :: (a -> Char -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy.Char8 foldl' is like foldl, but strict in the accumulator.
foldl1 :: (Char -> Char -> Char) -> ByteString -> Charbytestring Data.ByteString.Lazy.Char8 foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings.
foldl1' :: (Char -> Char -> Char) -> ByteString -> Charbytestring Data.ByteString.Lazy.Char8 foldlChunks :: (a -> StrictByteString -> a) -> a -> ByteString -> abytestring Data.ByteString.Lazy.Internal Consume the chunks of a lazy ByteString with a strict, tail-recursive, accumulating left fold.