Scala Standard Library 2.13.15 - scala.collection.SortedMapOps.KeySortedSet (original) (raw)

class KeySortedSet extends SortedSet[K] with GenKeySet with GenKeySortedSet

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. KeySortedSet
2. GenKeySortedSet
3. GenKeySet
4. SortedSet
5. SortedSetFactoryDefaults
6. SortedSetOps
7. SortedOps
8. Set
9. Equals
10. SetOps
11. Function1
12. Iterable
13. IterableFactoryDefaults
14. IterableOps
15. IterableOnceOps
16. IterableOnce
17. AnyRef
18. 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

Instance Constructors

1.  new KeySortedSet()

Value Members

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

Deprecated Value Members

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

Inherited from GenKeySortedSet

Inherited from SortedMapOps.GenKeySet

Inherited from SortedSet[K]

Inherited from SortedSetFactoryDefaults[K, SortedSet, Set]

Inherited from SortedSetOps[K, SortedSet, SortedSet[K]]

Inherited from SortedOps[K, SortedSet[K]]

Inherited from Set[K]

Inherited from Equals

Inherited from SetOps[K, Set, SortedSet[K]]

Inherited from (K) => Boolean

Inherited from Iterable[K]

Inherited from IterableFactoryDefaults[K, [x]Set[x]]

Inherited from IterableOps[K, [_]Set[_], SortedSet[K]]

Inherited from IterableOnceOps[K, [_]Set[_], SortedSet[K]]

Inherited from IterableOnce[K]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromKeySortedSet to IterableOnceExtensionMethods[K]

Inherited by implicit conversion any2stringadd fromKeySortedSet to any2stringadd[KeySortedSet]

Inherited by implicit conversion StringFormat fromKeySortedSet to StringFormat[KeySortedSet]

Inherited by implicit conversion Ensuring fromKeySortedSet to Ensuring[KeySortedSet]

Inherited by implicit conversion ArrowAssoc fromKeySortedSet to ArrowAssoc[KeySortedSet]

Ungrouped