| definition: |
insert :: a -> SetRBT a -> SetRBT a insert = RBT.update |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Inserts an element into a set if it is not already there. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {update}}
|
| name: |
insert |
| precedence: |
no precedence defined |
| result-values: |
{update}
|
| signature: |
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 |