Scala Standard Library 2.13.1 - scala.collection.immutable.SetOps (original) (raw)

trait SetOps[A, +CC[X], +C <: SetOps[A, CC, C]] extends collection.SetOps[A, CC, C]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. SetOps
2. SetOps
3. Function1
4. IterableOps
5. IterableOnceOps
6. IterableOnce
7. AnyRef
8. Any

Implicitly

1. by iterableOnceExtensionMethods

2. by any2stringadd

3. by StringFormat

4. by Ensuring

5. by ArrowAssoc

6. Hide All

7. Show All

Visibility

1. Public
2. Protected

Abstract Value Members

1.  abstract def coll: C
2.  abstract def contains(elem: A): Boolean
3.  abstract def excl(elem: A): C
4.  abstract def fromSpecific(coll: IterableOnce[A]): C
5.  abstract def incl(elem: A): C
6.  abstract def iterableFactory: IterableFactory[CC]
7.  abstract def iterator: Iterator[A]
8.  abstract def newSpecificBuilder: Builder[A, C]
9.  abstract def toIterable: collection.Iterable[A]

Concrete Value Members

1.  final def !=(arg0: Any): Boolean
2.  final def ##(): Int
3.  final def &(that: collection.Set[A]): C
4.  final def &~(that: collection.Set[A]): C
5.  final def +(elem: A): C
6.  final def ++(that: IterableOnce[A]): C
7.  final def ++[B >: A](suffix: IterableOnce[B]): CC[B]
8.  final def -(elem: A): C
9.  final def --(that: IterableOnce[A]): C
10.  def ->[B](y: B): (SetOps[A, CC, C], B)
11.  final def ==(arg0: Any): Boolean
12.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder
13.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
14.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
15.  def andThen[A](g: (Boolean) => A): (A) => A
16.  final def apply(elem: A): Boolean
17.  final def asInstanceOf[T0]: T0
18.  def clone(): AnyRef
19.  def collect[B](pf: PartialFunction[A, B]): CC[B]
20.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
21.  def compose[A](g: (A) => A): (A) => Boolean
22.  def concat(that: IterableOnce[A]): C
23.  def concat[B >: A](suffix: IterableOnce[B]): CC[B]
24.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
25.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
26.  def copyToArray[B >: A](xs: Array[B]): Int
27.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
28.  def count(p: (A) => Boolean): Int
29.  def diff(that: collection.Set[A]): C
30.  def drop(n: Int): C
31.  def dropRight(n: Int): C
32.  def dropWhile(p: (A) => Boolean): C
33.  def empty: C
34.  def ensuring(cond: (SetOps[A, CC, C]) => Boolean, msg: => Any): SetOps[A, CC, C]
35.  def ensuring(cond: (SetOps[A, CC, C]) => Boolean): SetOps[A, CC, C]
36.  def ensuring(cond: Boolean, msg: => Any): SetOps[A, CC, C]
37.  def ensuring(cond: Boolean): SetOps[A, CC, C]
38.  final def eq(arg0: AnyRef): Boolean
39.  def equals(arg0: AnyRef): Boolean
40.  def exists(p: (A) => Boolean): Boolean
41.  def filter(pred: (A) => Boolean): C
42.  def filterNot(pred: (A) => Boolean): C
43.  def finalize(): Unit
44.  def find(p: (A) => Boolean): Option[A]
45.  def flatMap[B](f: (A) => IterableOnce[B]): CC[B]
46.  def flatten[B](implicit asIterable: (A) => IterableOnce[B]): CC[B]
47.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
48.  def foldLeft[B](z: B)(op: (B, A) => B): B
49.  def foldRight[B](z: B)(op: (A, B) => B): B
50.  def forall(p: (A) => Boolean): Boolean
51.  def foreach[U](f: (A) => U): Unit
52.  def formatted(fmtstr: String): String
53.  final def getClass(): Class[_ <: AnyRef]
54.  def groupBy[K](f: (A) => K): Map[K, C]
55.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, CC[B]]
56.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
57.  def grouped(size: Int): Iterator[C]
58.  def hashCode(): Int
59.  def head: A
60.  def headOption: Option[A]
61.  def init: C
62.  def inits: Iterator[C]
63.  def intersect(that: collection.Set[A]): C
64.  def isEmpty: Boolean
65.  final def isInstanceOf[T0]: Boolean
66.  def isTraversableAgain: Boolean
67.  def knownSize: Int
68.  def last: A
69.  def lastOption: Option[A]
70.  def map[B](f: (A) => B): CC[B]
71.  def max[B >: A](implicit ord: math.Ordering[B]): A
72.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
73.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
74.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
75.  def min[B >: A](implicit ord: math.Ordering[B]): A
76.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
77.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
78.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
79.  final def mkString: String
80.  final def mkString(sep: String): String
81.  final def mkString(start: String, sep: String, end: String): String
82.  final def ne(arg0: AnyRef): Boolean
83.  def nonEmpty: Boolean
84.  final def notify(): Unit
85.  final def notifyAll(): Unit
86.  def partition(p: (A) => Boolean): (C, C)
87.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
88.  def product[B >: A](implicit num: math.Numeric[B]): B
89.  def reduce[B >: A](op: (B, B) => B): B
90.  def reduceLeft[B >: A](op: (B, A) => B): B
91.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
92.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
93.  def reduceRight[B >: A](op: (A, B) => B): B
94.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
95.  def removedAll(that: IterableOnce[A]): C
96.  def reversed: collection.Iterable[A]
97.  def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
98.  def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
99.  def scanRight[B](z: B)(op: (A, B) => B): CC[B]
100.  def size: Int
101.  def sizeCompare(that: collection.Iterable[_]): Int
102.  def sizeCompare(otherSize: Int): Int
103.  final def sizeIs: SizeCompareOps
104.  def slice(from: Int, until: Int): C
105.  def sliding(size: Int, step: Int): Iterator[C]
106.  def sliding(size: Int): Iterator[C]
107.  def span(p: (A) => Boolean): (C, C)
108.  def splitAt(n: Int): (C, C)
109.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
110.  def subsetOf(that: collection.Set[A]): Boolean
111.  def subsets(): Iterator[C]
112.  def subsets(len: Int): Iterator[C]
113.  def sum[B >: A](implicit num: math.Numeric[B]): B
114.  final def synchronized[T0](arg0: => T0): T0
115.  def tail: C
116.  def tails: Iterator[C]
117.  def take(n: Int): C
118.  def takeRight(n: Int): C
119.  def takeWhile(p: (A) => Boolean): C
120.  def tapEach[U](f: (A) => U): C
121.  def to[C1](factory: Factory[A, C1]): C1
122.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
123.  final def toBuffer[B >: A]: Buffer[B]
124.  def toIndexedSeq: IndexedSeq[A]
125.  def toList: List[A]
126.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
127.  def toSeq: Seq[A]
128.  def toSet[B >: A]: Set[B]
129.  def toString(): String
130.  def toVector: Vector[A]
131.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): CC[CC[B]]
132.  final def union(that: collection.Set[A]): C
133.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (CC[A1], CC[A2])
134.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
135.  def view: View[A]
136.  final def wait(): Unit
137.  final def wait(arg0: Long, arg1: Int): Unit
138.  final def wait(arg0: Long): Unit
139.  def withFilter(p: (A) => Boolean): WithFilter[A, CC]
140.  def zip[B](that: IterableOnce[B]): CC[(A, B)]
141.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
142.  def zipWithIndex: CC[(A, Int)]
143.  final def |(that: collection.Set[A]): C

Deprecated Value Members

1.  def +(elem1: A, elem2: A, elems: A*): C
2.  def ++:[B >: A](that: IterableOnce[B]): CC[B]
3.  def -(elem1: A, elem2: A, elems: A*): C
4.  def /:[B](z: B)(op: (B, A) => B): B
5.  final def /:[B](z: B)(op: (B, A) => B): B
6.  def :\[B](z: B)(op: (A, B) => B): B
7.  final def :\[B](z: B)(op: (A, B) => B): B
8.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
9.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
10.  def companion: IterableFactory[CC]
11.  def copyToBuffer(dest: Buffer[A]): Unit
12.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
13.  def count(f: (A) => Boolean): Int
14.  def exists(f: (A) => Boolean): Boolean
15.  def filter(f: (A) => Boolean): Iterator[A]
16.  def find(p: (A) => Boolean): Option[A]
17.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
18.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
19.  def foldLeft[B](z: B)(op: (B, A) => B): B
20.  def foldRight[B](z: B)(op: (A, B) => B): B
21.  def forall(f: (A) => Boolean): Boolean
22.  def foreach[U](f: (A) => U): Unit
23.  def hasDefiniteSize: Boolean
24.  def isEmpty: Boolean
25.  def map[B](f: (A) => B): IterableOnce[B]
26.  def max(implicit ord: math.Ordering[A]): A
27.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
28.  def min(implicit ord: math.Ordering[A]): A
29.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
30.  def mkString: String
31.  def mkString(sep: String): String
32.  def mkString(start: String, sep: String, end: String): String
33.  def nonEmpty: Boolean
34.  def product(implicit num: math.Numeric[A]): A
35.  def reduce(f: (A, A) => A): A
36.  def reduceLeft(f: (A, A) => A): A
37.  def reduceLeftOption(f: (A, A) => A): Option[A]
38.  def reduceOption(f: (A, A) => A): Option[A]
39.  def reduceRight(f: (A, A) => A): A
40.  def reduceRightOption(f: (A, A) => A): Option[A]
41.  final def repr: C
42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
43.  def size: Int
44.  def sum(implicit num: math.Numeric[A]): A
45.  def to[C1](factory: Factory[A, C1]): C1
46.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
47.  def toBuffer[B >: A]: Buffer[B]
48.  def toIndexedSeq: collection.IndexedSeq[A]
49.  final def toIterable: collection.Iterable[A]
50.  def toIterator: Iterator[A]
51.  final def toIterator: Iterator[A]
52.  def toList: List[A]
53.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
54.  def toSeq: Seq[A]
55.  def toSet[B >: A]: Set[B]
56.  def toStream: Stream[A]
57.  final def toStream: Stream[A]
58.  final def toTraversable: collection.Traversable[A]
59.  final def toTraversable: collection.Traversable[A]
60.  def toVector: Vector[A]
61.  def view(from: Int, until: Int): View[A]
62.  def withFilter(f: (A) => Boolean): Iterator[A]
63.  def →[B](y: B): (SetOps[A, CC, C], B)

Inherited from collection.SetOps[A, CC, C]

Inherited from (A) => Boolean

Inherited from IterableOps[A, CC, C]

Inherited from IterableOnceOps[A, CC, C]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromSetOps[A, CC, C] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromSetOps[A, CC, C] to any2stringadd[SetOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromSetOps[A, CC, C] to StringFormat[SetOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromSetOps[A, CC, C] to Ensuring[SetOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromSetOps[A, CC, C] to ArrowAssoc[SetOps[A, CC, C]]

Ungrouped