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/mutable/SortedSetOps.html below:

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