| definition: |
printAllValuesWith :: Show a => Strategy a -> a -> IO () printAllValuesWith strategy exp = getAllValuesWith strategy exp >>= mapM_ print |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Prints all values of an expression w.r.t. a search strategy. A search strategy is an operation to traverse a search tree and collect all values, e.g., 'dfsStrategy' or 'bfsStrategy'. Conceptually, all printed values are computed on a copy of the expression, i.e., the evaluation of the expression does not share any results. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
printAllValuesWith |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Show a => (SearchTree a -> ValueSequence a) -> a -> Prelude.IO () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |