CurryInfo: redblacktree-3.0.0 / Data.Set.RBTree.insertMulti
definition: 
|
insertMulti :: Eq a => a -> SetRBT a -> SetRBT a
insertMulti e = RBT.setInsertEquivalence (==)
. RBT.update e
. RBT.setInsertEquivalence (\ _ _ -> False)
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Inserts an element into a multiset. Thus, the same element can have several occurrences in the multiset. |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> {.._#lambda508}}
|
|
name:
|
insertMulti |
|
precedence:
|
no precedence defined |
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
Prelude.Eq a => a -> Data.RedBlackTree.RedBlackTree a -> Data.RedBlackTree.RedBlackTree a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
possibly non-reducible on same data term |