| definition: |
splitSet :: [a] -> ([a],[a]) splitSet [] = ([],[]) splitSet (x:xs) = let (u,v) = splitSet xs in (x:u,v) ? (u,x:v) |
| demand: |
argument 1 |
| deterministic: |
possibly non-deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({[]}) |-> {(,)} || ({:}) |-> {(,)}}
|
| name: |
splitSet |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
[a] -> ([a], [a]) |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |