CurryInfo: redblacktree-3.0.0 / Data.Set.RBTree.delete

definition:
delete :: a -> SetRBT a -> SetRBT a
delete = RBT.delete
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- delete an element from a set.
--- Deletes only a single element from a multi set
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{() |-> {delete}}
name:
delete
precedence:
no precedence defined
result-values:
{delete}
signature:
a -> Data.RedBlackTree.RedBlackTree a -> Data.RedBlackTree.RedBlackTree a
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term