Creates a new Set
as an O(N) operation unless elem
is already contained.
Creates a new Set
as an O(N) operation unless elem
is already contained.
Creates a new Set
as an O(N) operation unless elem
is not contained.
Creates a new Set
as an O(N) operation unless elem
is not contained.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(eqSet: StringAdd).+(other)
(eqSet: MonadOps[K]).filter(p)
(eqSet: MonadOps[K]).flatMap(f)
(eqSet: MonadOps[K]).map(f)
(eqSet: StringAdd).self
(eqSet: StringFormat).self
(eqSet: MonadOps[K]).withFilter(p)
(Since version 2.10.0) use fold instead
(eqSet: ArrowAssoc[EqSet[K]]).x
(Since version 2.10.0) Use leftOfArrow
instead
(eqSet: Ensuring[EqSet[K]]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Wrapper class mimicking a
scala.collection.immutable.Set
without copying the contents of the underlyingEqHashMap
.