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

trait StrictOptimizedSetOps[A, +CC[_], +C <: SetOps[A, CC, C]] extends SetOps[A, CC, C] with StrictOptimizedIterableOps[A, CC, C]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. StrictOptimizedSetOps
2. StrictOptimizedIterableOps
3. SetOps
4. Function1
5. IterableOps
6. IterableOnceOps
7. IterableOnce
8. AnyRef
9. 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 diff(that: Set[A]): C
4.  abstract def fromSpecific(coll: IterableOnce[A]): C
5.  abstract def iterableFactory: IterableFactory[CC]
6.  abstract def iterator: Iterator[A]
7.  abstract def newSpecificBuilder: Builder[A, C]
8.  abstract def toIterable: Iterable[A]

Concrete Value Members

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

Deprecated Value Members

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

Inherited from StrictOptimizedIterableOps[A, CC, C]

Inherited from 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 fromStrictOptimizedSetOps[A, CC, C] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromStrictOptimizedSetOps[A, CC, C] to any2stringadd[StrictOptimizedSetOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedSetOps[A, CC, C] to StringFormat[StrictOptimizedSetOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedSetOps[A, CC, C] to Ensuring[StrictOptimizedSetOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedSetOps[A, CC, C] to ArrowAssoc[StrictOptimizedSetOps[A, CC, C]]

Ungrouped