| definition: |
empty :: Eq a => (a -> a -> Bool) -> SetRBT a empty = RBT.empty (==) (==) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Returns an empty set, i.e., an empty red-black tree augmented with an order predicate. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {empty}}
|
| name: |
empty |
| precedence: |
no precedence defined |
| result-values: |
{empty}
|
| signature: |
Prelude.Eq a => (a -> a -> Prelude.Bool) -> Data.RedBlackTree.RedBlackTree a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |