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