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

trait StrictOptimizedSortedSetOps[A, +CC[X] <: SortedSet[X], +C <: SortedSetOps[A, CC, C]] extends SortedSetOps[A, CC, C] with StrictOptimizedSetOps[A, Set, C]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

Inherited from StrictOptimizedSetOps[A, Set, C]

Inherited from StrictOptimizedIterableOps[A, Set, C]

Inherited from SortedSetOps[A, CC, C]

Inherited from SortedOps[A, C]

Inherited from SetOps[A, Set, C]

Inherited from (A) => Boolean

Inherited from IterableOps[A, Set, C]

Inherited from IterableOnceOps[A, Set, C]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion any2stringadd fromStrictOptimizedSortedSetOps[A, CC, C] to any2stringadd[StrictOptimizedSortedSetOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedSortedSetOps[A, CC, C] to StringFormat[StrictOptimizedSortedSetOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedSortedSetOps[A, CC, C] to Ensuring[StrictOptimizedSortedSetOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedSortedSetOps[A, CC, C] to ArrowAssoc[StrictOptimizedSortedSetOps[A, CC, C]]

Ungrouped