definition: |
solutionOf :: Data a => (a -> Bool) -> a solutionOf pred = pred x &> x where x free |
demand: |
argument 2 |
deterministic: |
possibly non-deterministic operation |
documentation: |
`solutionOf p` returns (non-deterministically) a solution of predicate `p`. This operation is useful to test solutions of predicates. |
failfree: |
<FAILING> |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,_) |-> _} |
name: |
solutionOf |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
Prelude.Data a => (a -> Prelude.Bool) -> a |
solution-complete: |
operation might suspend on free variables |
terminating: |
possibly non-terminating |
totally-defined: |
possibly non-reducible on same data term |