| definition: |
isEmpty :: RedBlackTree _ -> Bool isEmpty (RedBlackTree _ _ _ Empty) = True isEmpty (RedBlackTree _ _ _ (Tree _ _ _ _)) = False |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
Test on emptyness |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({RedBlackTree}) |-> {False,True}}
|
| name: |
isEmpty |
| precedence: |
no precedence defined |
| result-values: |
{False,True}
|
| signature: |
RedBlackTree a -> Prelude.Bool |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |