Instance Constructors
-
new
WrappedSet(underlying: Set[T])
Value Members
-
-
final
def
##(): Int
-
-
-
def
+(elem1: T, elem2: T, elems: T*): WrappedSet[T]
-
-
-
-
-
-
-
def
+=(value: T): WrappedSet.this.type
-
def
+=(elem1: T, elem2: T, elems: T*): WrappedSet.this.type
-
def
-(elem1: T, elem2: T, elems: T*): WrappedSet[T]
-
-
-
-
def
-=(key: T): WrappedSet.this.type
-
def
-=(elem1: T, elem2: T, elems: T*): WrappedSet.this.type
-
def
->[B](y: B): (WrappedSet[T], B)
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
-
-
def
add(elem: T): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A
-
def
apply(key: T): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
def
clear(): Unit
-
-
-
-
-
def
compose[A](g: (A) ⇒ T): (A) ⇒ Boolean
-
def
contains(value: T): Boolean
-
def
copyToArray[B >: T](xs: scala.Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: T](xs: scala.Array[B]): Unit
-
def
copyToArray[B >: T](xs: scala.Array[B], start: Int): Unit
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
-
def
count(p: (T) ⇒ Boolean): Int
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
-
-
def
foreach[U](f: (T) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (T) ⇒ K): collection.immutable.Map[K, WrappedSet[T]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: T
-
def
headOption: Option[T]
-
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
last: T
-
def
lastOption: Option[T]
-
def
map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[WrappedSet[T], B, That]): That
-
def
mapResult[NewTo](f: (WrappedSet[T]) ⇒ NewTo): Builder[T, NewTo]
-
def
max[B >: T](implicit cmp: Ordering[B]): T
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
min[B >: T](implicit cmp: Ordering[B]): T
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
parCombiner: Combiner[T, ParSet[T]]
-
-
def
product[B >: T](implicit num: Numeric[B]): B
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
-
def
remove(elem: T): Boolean
-
-
-
def
retain(p: (T) ⇒ Boolean): Unit
-
def
reversed: List[T]
-
def
sameElements[B >: T](that: GenIterable[B]): Boolean
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[WrappedSet[T], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[WrappedSet[T], B, That]): That
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[WrappedSet[T], B, That]): That
-
-
def
size(): Int
-
-
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
-
-
-
-
-
def
stringPrefix: String
-
-
-
-
def
sum[B >: T](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): scala.Array[B]
-
def
toBuffer[A1 >: T]: Buffer[A1]
-
-
-
-
-
def
toList: List[T]
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): collection.immutable.Map[T, U]
-
def
toParArray: ParArray[T]
-
-
def
toSet[B >: T]: collection.immutable.Set[B]
-
def
toStream: collection.immutable.Stream[T]
-
def
toString(): String
-
-
def
toVector: Vector[T]
-
-
-
-
-
def
update(elem: T, included: Boolean): Unit
-
def
view(from: Int, until: Int): IterableView[T, WrappedSet[T]]
-
def
view: IterableView[T, WrappedSet[T]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[WrappedSet[T], (A1, B), That]): That
-
def
zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[WrappedSet[T], (A1, B), That]): That
-
def
zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[WrappedSet[T], (A1, Int), That]): That
-
-
def
→[B](y: B): (WrappedSet[T], B)
Shadowed Implicit Value Members
-
def
+(other: String): String
-
-
-
-
Deprecated Value Members
-
def
<<(cmd: Message[T]): Unit
Inherited by implicit conversion CollectionsHaveToParArray from
WrappedSet[T] to CollectionsHaveToParArray[WrappedSet[T], T]
Inherited by implicit conversion MonadOps from
WrappedSet[T] to MonadOps[T]
Inherited by implicit conversion alternateImplicit from
WrappedSet[T] to ForceImplicitAmbiguity
Wrapper to use a js.Set as a scala.mutable.Set