| definition: |
update :: a -> RedBlackTree a -> RedBlackTree a
update e (RedBlackTree eqIns eqLk lt t) =
RedBlackTree eqIns eqLk lt (updateTree eqIns lt e t)
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
Updates/inserts an element into a RedBlackTree. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{RedBlackTree}) |-> {RedBlackTree}}
|
| name: |
update |
| precedence: |
no precedence defined |
| result-values: |
{RedBlackTree}
|
| signature: |
a -> RedBlackTree a -> RedBlackTree a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |