CurryInfo: redblacktree-3.0.0 / Data.Table.RBTree.isEmpty

definition:
isEmpty :: TableRBT _ _ -> Bool
isEmpty = RBT.isEmpty
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- tests whether a given table is empty
failfree:
()
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{() |-> {isEmpty}}
name:
isEmpty
precedence:
no precedence defined
result-values:
{isEmpty}
signature:
Data.RedBlackTree.RedBlackTree (a, b) -> Prelude.Bool
solution-complete:
operationally complete operation
terminating:
yes
totally-defined:
reducible on all ground data terms