CurryInfo: base-3.4.0 / Control.Search.SearchTree.getAllValuesWith
definition: 
|
getAllValuesWith :: Strategy a -> a -> IO [a] getAllValuesWith strategy exp = do t <- getSearchTree exp return (vsToList (strategy t)) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Gets 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 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:
|
getAllValuesWith |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(SearchTree a -> ValueSequence a) -> a -> Prelude.IO [a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |