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

Scala Standard Library 2.13.10 - scala.collection.mutable.SetOps

trait SetOps[A, +CC[X], +C <: SetOps[A, CC, C]] extends collection.SetOps[A, CC, C] with IterableOps[A, CC, C] with Cloneable[C] with Builder[A, C] with Growable[A] with Shrinkable[A]



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