|
definition:
|
empty :: (a -> a -> Bool) -> (a -> a -> Bool) -> (a -> a -> Bool)
-> RedBlackTree a
empty eqInsert eqLookUp lessThan = RedBlackTree eqInsert eqLookUp lessThan Empty
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {RedBlackTree}}
|
|
name:
|
empty
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{RedBlackTree}
|
|
signature:
|
(a -> a -> Prelude.Bool) -> (a -> a -> Prelude.Bool) -> (a -> a -> Prelude.Bool)
-> RedBlackTree a
|
|
solution-complete:
|
operationally complete operation
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|