Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldl :: Context b => (a -> b -> a) -> a -> Matrix b -> amatrices Data.Matrix.Storable No documentation available.
foldl :: Context b => (a -> b -> a) -> a -> Matrix b -> amatrices Data.Matrix.Unboxed No documentation available.
foldl :: (a -> b -> a) -> a -> MonoidalIntMap b -> amonoidal-containers Data.IntMap.Monoidal No documentation available.
foldl :: (a -> b -> a) -> a -> MonoidalIntMap b -> amonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
foldl :: forall k a b . (a -> b -> a) -> a -> MonoidalMap k b -> amonoidal-containers Data.Map.Monoidal No documentation available.
foldl :: forall k a b . (a -> b -> a) -> a -> MonoidalMap k b -> amonoidal-containers Data.Map.Monoidal.Strict No documentation available.
foldl :: (a -> b -> a) -> a -> MultiMap k b -> amultimap Data.MultiMap Fold the values in the map using the given left-associative binary operator.
foldl :: (a -> b -> a) -> a -> NEIntMap b -> anonempty-containers Data.IntMap.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 -> NEIntMap b -> anonempty-containers Data.IntMap.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 -> Key -> a) -> a -> NEIntSet -> anonempty-containers Data.IntSet.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