CurryInfo: base-3.4.0 / Control.Search.Unsafe.allValues
definition: 
|
allValues :: a -> [a] #ifdef __KICS2__ allValues e = ST.allValuesDFS (ST.someSearchTree e) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Returns all values of an expression. Conceptually, the value is computed on a copy of the expression, i.e., the evaluation of the expression does not share any results. In PAKCS, the evaluation suspends as long as the expression contains unbound variables or the computed value contains 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:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> _}
|
|
name:
|
allValues |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
a -> [a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |