|
definition:
|
genPair :: SearchTree a -> SearchTree b -> SearchTree (a,b)
genPair = genCons2 (\x y -> (x,y))
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Generates a search tree for pair of values where the search tree generators
--- for the components types are given as parameters.
|
|
failfree:
|
()
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{() |-> {genCons2}}
|
|
name:
|
genPair
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{genCons2}
|
|
signature:
|
Control.SearchTree.SearchTree a -> Control.SearchTree.SearchTree b
-> Control.SearchTree.SearchTree (a, b)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|