**all** +text

*O(n)* all p t determines whether all characters in the Text t satisify the predicate p. Subject to fusion.
*O(n+m)* Find all non-overlapping instances of needle in haystack. Each element of the returned list consists of a pair:
* The entire string prior to the *k*th match (i.e. the prefix)
* The *k*th match, followed by the remainder of the string
Examples:
> breakOnAll "::" ""
> ==> []
> breakOnAll "/" "a/b/c/"
> ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
In (unlikely) bad cases, this function's time complexity degrades towards *O(n*m)*.
The needle parameter may not be empty.

*O(n+m)* Find all non-overlapping instances of needle in haystack. Each element of the returned list consists of a pair:
* The entire string prior to the *k*th match (i.e. the prefix)
* The *k*th match, followed by the remainder of the string
Examples:
> breakOnAll "::" ""
> ==> []
> breakOnAll "/" "a/b/c/"
> ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
This function is strict in its first argument, and lazy in its second.
In (unlikely) bad cases, this function's time complexity degrades towards *O(n*m)*.
The needle parameter may not be empty.

Currently set to 128 bytes, less the memory management overhead.