CurryInfo: redblacktree-3.0.0 / Data.Set.RBTree.union
definition: 
|
union :: SetRBT a -> SetRBT a -> SetRBT a union s1 s2 = foldr insert s2 (toList s1) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Computes the union of two (red-black tree) sets. This is done by inserting all elements of the first set into the second set. |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
union |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Data.RedBlackTree.RedBlackTree a -> Data.RedBlackTree.RedBlackTree a -> Data.RedBlackTree.RedBlackTree a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
possibly non-reducible on same data term |