A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/immutable/SortedSetOps.html below:

Scala Standard Library 2.13.10 - scala.collection.immutable.SortedSetOps

trait SortedSetOps[A, +CC[X] <: SortedSet[X], +C <: SortedSetOps[A, CC, C]] extends SetOps[A, Set, C] with collection.SortedSetOps[A, CC, C]



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

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4