| definition: |
(|||) :: SearchTree a -> SearchTree a -> SearchTree a x ||| y = Or x y |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Constructs an alternative of two search trees. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixr |
| iotype: |
{(_,_) |-> {Or}}
|
| name: |
||| |
| precedence: |
1 |
| result-values: |
{Or}
|
| signature: |
Control.SearchTree.SearchTree a -> Control.SearchTree.SearchTree a -> Control.SearchTree.SearchTree a |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |