O(n) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right. Subject to fusion.
O(n) A strict version of foldl. Subject to fusion.
O(n) A variant of foldl that has no starting value argument, and thus must be applied to a non-empty Text. Subject to fusion.
O(n) A strict version of foldl1. Subject to fusion.
Consume the chunks of a lazy Text with a strict, tail-recursive, accumulating left fold.