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.
foldl :: forall a b (n :: Nat) . SNatI n => (b -> a -> b) -> b -> Tree n a -> bral Data.RAVec.Tree.DF Left fold.
foldl :: (a -> Word8 -> a) -> a -> ByteString -> arawfilepath Data.ByteString.RawFilePath foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from left to right.
foldl :: (a -> Char -> a) -> a -> Rope -> arope-utf16-splay Data.Rope.UTF16 Fold left
foldl :: (a -> Char -> a) -> a -> Rope -> arope-utf16-splay Data.Rope.UTF16.Internal Fold left
foldl :: Unboxable b => (a -> b -> a) -> a -> Vector b -> aunboxing-vector Data.Vector.Unboxing No documentation available.
foldl :: (b -> a -> b) -> b -> IntervalMap k a -> bIntervalMap Data.IntervalMap.Generic.Lazy O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
foldl :: (b -> a -> b) -> b -> IntervalMap k a -> bIntervalMap Data.IntervalMap.Generic.Strict O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
foldl :: (b -> a -> b) -> b -> IntervalMap k a -> bIntervalMap Data.IntervalMap.Lazy O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
foldl :: (b -> a -> b) -> b -> IntervalMap k a -> bIntervalMap Data.IntervalMap.Strict O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
foldl :: (b -> k -> b) -> b -> IntervalSet k -> bIntervalMap Data.IntervalSet O(n). Fold the values in the set using the given left-associative binary operator, such that foldl f z == foldl f z . elems.