| definition: |
getAllSolutions :: Data a => (a -> Bool) -> IO [a] #ifdef __KICS2__ getAllSolutions c = getAllValues (let x free in (x,c x)) >>= return . map fst |
| demand: |
no demanded arguments |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- Gets all solutions to a constraint (currently, via an incomplete --- depth-first left-to-right strategy). Conceptually, all solutions --- are computed on a copy of the constraint, i.e., the evaluation --- of the constraint does not share any results. Moreover, this --- evaluation suspends if the constraints contain unbound variables. --- Similar to Prolog's findall. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
getAllSolutions |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Data a => (a -> Prelude.Bool) -> Prelude.IO [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |