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

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