| definition: |
allSolutions :: Data a => (a -> Bool) -> [a] allSolutions p = allValues (invertPred p) |
| demand: |
no demanded arguments |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- Returns all values satisfying a predicate, i.e., all arguments such that --- the predicate applied to the argument can be evaluated to `True` --- (currently, via an incomplete depth-first strategy). --- In PAKCS, the evaluation suspends as long as the predicate expression --- contains unbound variables or the computed --- values contain unbound variables. --- --- Note that this operation is not purely declarative since the ordering --- of the computed values depends on the ordering of the program rules. |
| failfree: |
<FAILING> |
| indeterministic: |
might be indeterministic |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
allSolutions |
| 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: |
reducible on all ground data terms |