|
definition:
|
set1With :: Strategy b -> (a1 -> b) -> a1 -> Values b
set1With s f x = allVs s (\_ -> f x)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Combinator to transform a unary function into a corresponding set function
--- that uses a given strategy to compute its values.
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {Values}}
|
|
name:
|
set1With
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Values}
|
|
signature:
|
(Control.Search.SearchTree.SearchTree a
-> Control.Search.SearchTree.ValueSequence a) -> (b -> a) -> b -> Values a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|