CurryInfo: base-3.4.0 / Control.Search.SetFunctions.set2With
definition: 
|
set2With :: Strategy b -> (a1 -> a2 -> b) -> a1 -> a2 -> Values b set2With s f x1 x2 = allVs s (\_ -> f x1 x2) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Combinator to transform a binary 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:
|
set2With |
|
precedence:
|
no precedence defined |
|
result-values:
|
{Values}
|
|
signature:
|
(Control.Search.SearchTree.SearchTree a -> Control.Search.SearchTree.ValueSequence a) -> (b -> c -> a) -> b -> c -> Values a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |