|
definition:
|
genEither :: SearchTree a -> SearchTree b -> SearchTree (Either a b)
genEither genx geny = genCons1 Left genx ||| genCons1 Right geny
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Generates a search tree for `Either` values where the search tree for
--- the possible elements is given as a parameter.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {Or}}
|
|
name:
|
genEither
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Or}
|
|
signature:
|
Control.SearchTree.SearchTree a -> Control.SearchTree.SearchTree b
-> Control.SearchTree.SearchTree (Prelude.Either a b)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|