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 :: (a -> b -> a) -> a -> NEMap k b -> anonempty-containers Data.Map.NonEmpty O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
elemsList = reverse . foldl (flip (:)) []
let f len a = len + (length a) foldl f 0 (fromList ((5,"a") :| [(3,"bbb")])) == 4
foldl :: (a -> b -> a) -> a -> NEMap k b -> anonempty-containers Data.Map.NonEmpty.Internal O(n). Fold the values in the map using the given left-associative binary operator, such that foldl f z == foldl f z . elems.
elemsList = reverse . foldl (flip (:)) []
let f len a = len + (length a) foldl f 0 (fromList ((5,"a") :| [(3,"bbb")])) == 4
foldl :: (a -> b -> a) -> a -> NESet b -> anonempty-containers Data.Set.NonEmpty O(n). Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList. For example,
descElemsList set = foldl (flip (:)) [] set
foldl :: (a -> b -> a) -> a -> NESet b -> anonempty-containers Data.Set.NonEmpty.Internal O(n). Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList. For example,
descElemsList set = foldl (flip (:)) [] set
foldl :: (a -> b -> a) -> a -> [b] -> aprelude-compat Data.List2010 No documentation available.
foldl :: (a -> b -> a) -> a -> [b] -> aprelude-compat Prelude2010 No documentation available.
foldl :: (a -> b -> a) -> a -> Vector b -> arebase Rebase.Data.Vector No documentation available.
foldl :: Monad m => (a -> b -> a) -> a -> Stream m b -> m arebase Rebase.Data.Vector.Fusion.Stream.Monadic Left fold
foldl :: Vector v b => (a -> b -> a) -> a -> v b -> arebase Rebase.Data.Vector.Generic No documentation available.
foldl :: (PrimMonad m, MVector v a) => (b -> a -> b) -> b -> v (PrimState m) a -> m brebase Rebase.Data.Vector.Generic.Mutable No documentation available.