CurryInfo: redblacktree-3.0.0 / Data.Set.RBTree.emptyOrd
definition: 
|
emptyOrd :: Ord a => SetRBT a emptyOrd = empty (<) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Returns an empty set that uses the Ord's ordering predicate. |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> _}
|
|
name:
|
emptyOrd |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Prelude.Ord a => Data.RedBlackTree.RedBlackTree a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |