| definition: |
newTreeLike :: RedBlackTree a -> RedBlackTree a newTreeLike (RedBlackTree eqIns eqLk lt _) = RedBlackTree eqIns eqLk lt Empty |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
Creates a new empty red black tree from with the same ordering as a give one. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({RedBlackTree}) |-> {RedBlackTree}}
|
| name: |
newTreeLike |
| precedence: |
no precedence defined |
| result-values: |
{RedBlackTree}
|
| signature: |
RedBlackTree a -> RedBlackTree a |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |