|
definition:
|
anyorder :: [a] -> [a]
anyorder [] = []
anyorder (x:xs) = insert (anyorder xs)
where insert [] = [x]
insert (y:ys) = x:y:ys ? y : insert ys
|
|
demand:
|
argument 1
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- The operation `anyorder` returns all permutations of the input list.
--- It can be used in a pattern to match XML structures with the given
--- elements in arbitrary order, as in
---
--- getNamePhone
--- (xml "entry"
--- (with (anyorder [xml "name" [xtxt name],
--- xml "phone" [xtxt phone]]))) = name ++ ": " ++ phone
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({[]}) |-> {[]} || ({:}) |-> {:}}
|
|
name:
|
anyorder
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{:,[]}
|
|
signature:
|
[a] -> [a]
|
|
solution-complete:
|
operationally complete operation
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|