| definition: |
break :: (a -> Bool) -> [a] -> ([a], [a]) break p = span (not . p) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- `break p xs` is equivalent to --- `(takeWhile (not . p) xs, dropWhile (not . p) xs)`. --- Thus, it breaks a list at the first occurrence of an element satisfying p. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {span}}
|
| name: |
break |
| precedence: |
no precedence defined |
| result-values: |
{span}
|
| signature: |
(a -> Bool) -> [a] -> ([a], [a]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |