| definition: |
delete :: key -> TableRBT key a -> TableRBT key a delete key = RBT.delete (key,failed) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {delete}}
|
| name: |
delete |
| precedence: |
no precedence defined |
| result-values: |
{delete}
|
| signature: |
a -> Data.RedBlackTree.RedBlackTree (a, b) -> Data.RedBlackTree.RedBlackTree (a, b) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |