# foldl' -package:base

foldl' is like foldl, but strict in the accumulator.

*O(n)*. A strict version of

foldl. Each application of the
operator is evaluated before using the result in the next application.
This function is strict in the starting value.

*O(n)*. A strict version of

foldl. Each application of the
operator is evaluated before using the result in the next application.
This function is strict in the starting value.

*O(n)*. A strict version of

foldl. Each application of the
operator is evaluated before using the result in the next application.
This function is strict in the starting value.

*O(n)*. A strict version of

foldl. Each application of the
operator is evaluated before using the result in the next application.
This function is strict in the starting value.

*O(n)* A strict version of

foldl.

*O(n)* Left fold with strict accumulator

Left fold with strict accumulator

Left fold with a strict accumulator

Left fold with a strict accumulator

*O(n)* Left fold with strict accumulator

*O(n)* Pure left fold with strict accumulator.

*O(n)* Pure left fold with strict accumulator.

*O(n)* Left fold with strict accumulator

*O(n)* Pure left fold with strict accumulator.

*O(n)* Left fold with strict accumulator

*O(n)* Pure left fold with strict accumulator.

*O(n)* Left fold with strict accumulator

*O(n)* Pure left fold with strict accumulator.

Reduce this map by applying a binary operator to all
elements, using the given starting value (typically the left-identity
of the operator). Each application of the operator is evaluated before
using the result in the next application. This function is strict in
the starting value.