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