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

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

trait Set[A] extends Iterable[A] with collection.Set[A] with SetOps[A, Set, Set[A]] with IterableFactoryDefaults[A, Set]



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Set
  2. SetOps
  3. Shrinkable
  4. Builder
  5. Growable
  6. Clearable
  7. Cloneable
  8. Cloneable
  9. Set
  10. Equals
  11. SetOps
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableFactoryDefaults
  16. IterableOps
  17. IterableOnceOps
  18. IterableOnce
  19. AnyRef
  20. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Abstract Value Members
  1.  abstract def addOne(elem: A): Set.this.type
  2.  abstract def clear(): Unit
  3.  abstract def contains(elem: A): Boolean
  4.  abstract def iterator: Iterator[A]
  5.  abstract def subtractOne(elem: A): Set.this.type
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def &(that: collection.Set[A]): Set[A]
  4.  final def &~(that: collection.Set[A]): Set[A]
  5.  final def ++(that: IterableOnce[A]): Set[A]
  6.  final def ++[B >: A](suffix: IterableOnce[B]): Set[B]
  7.  final def ++=(xs: IterableOnce[A]): Set.this.type
  8.  final def +=(elem: A): Set.this.type
  9.  final def --=(xs: IterableOnce[A]): Set.this.type
  10.  final def -=(elem: A): Set.this.type
  11.  def ->[B](y: B): (Set[A], B)
  12.  final def ==(arg0: Any): Boolean
  13.  def add(elem: A): Boolean
  14.  def addAll(xs: IterableOnce[A]): Set.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 canEqual(that: Any): Boolean
  22.  def className: String
  23.  def clone(): Set[A]
  24.  final def coll: Set.this.type
  25.  def collect[B](pf: PartialFunction[A, B]): Set[B]
  26.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  27.  def compose[A](g: (A) => A): (A) => Boolean
  28.  def concat(that: IterableOnce[A]): Set[A]
  29.  def concat[B >: A](suffix: IterableOnce[B]): Set[B]
  30.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  31.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  32.  def copyToArray[B >: A](xs: Array[B]): Int
  33.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  34.  def count(p: (A) => Boolean): Int
  35.  def diff(that: collection.Set[A]): Set[A]
  36.  def drop(n: Int): Set[A]
  37.  def dropRight(n: Int): Set[A]
  38.  def dropWhile(p: (A) => Boolean): Set[A]
  39.  def empty: Set[A]
  40.  def ensuring(cond: (Set[A]) => Boolean, msg: => Any): Set[A]
  41.  def ensuring(cond: (Set[A]) => Boolean): Set[A]
  42.  def ensuring(cond: Boolean, msg: => Any): Set[A]
  43.  def ensuring(cond: Boolean): Set[A]
  44.  final def eq(arg0: AnyRef): Boolean
  45.  def equals(that: Any): Boolean
  46.  def exists(p: (A) => Boolean): Boolean
  47.  def filter(pred: (A) => Boolean): Set[A]
  48.  def filterInPlace(p: (A) => Boolean): Set.this.type
  49.  def filterNot(pred: (A) => Boolean): Set[A]
  50.  def finalize(): Unit
  51.  def find(p: (A) => Boolean): Option[A]
  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.  def fromSpecific(coll: IterableOnce[A]): Set[A]
  60.  final def getClass(): Class[_ <: AnyRef]
  61.  def groupBy[K](f: (A) => K): immutable.Map[K, Set[A]]
  62.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, Set[B]]
  63.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  64.  def grouped(size: Int): Iterator[Set[A]]
  65.  def hashCode(): Int
  66.  def head: A
  67.  def headOption: Option[A]
  68.  def init: Set[A]
  69.  def inits: Iterator[Set[A]]
  70.  def intersect(that: collection.Set[A]): Set[A]
  71.  def isEmpty: Boolean
  72.  final def isInstanceOf[T0]: Boolean
  73.  def isTraversableAgain: Boolean
  74.  def iterableFactory: IterableFactory[Set]
  75.  def knownSize: Int
  76.  def last: A
  77.  def lastOption: Option[A]
  78.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Set.this.type]
  79.  def map[B](f: (A) => B): Set[B]
  80.  def mapResult[NewTo](f: (Set[A]) => NewTo): Builder[A, NewTo]
  81.  def max[B >: A](implicit ord: math.Ordering[B]): 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: math.Ordering[B]): A
  86.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  87.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  88.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  89.  final def mkString: String
  90.  final def mkString(sep: String): String
  91.  final def mkString(start: String, sep: String, end: String): String
  92.  final def ne(arg0: AnyRef): Boolean
  93.  def newSpecificBuilder: Builder[A, Set[A]]
  94.  def nonEmpty: Boolean
  95.  final def notify(): Unit
  96.  final def notifyAll(): Unit
  97.  def partition(p: (A) => Boolean): (Set[A], Set[A])
  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 reduce[B >: A](op: (B, B) => B): B
  101.  def reduceLeft[B >: A](op: (B, A) => B): B
  102.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  103.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  104.  def reduceRight[B >: A](op: (A, B) => B): B
  105.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  106.  def remove(elem: A): Boolean
  107.  def result(): Set[A]
  108.  def reversed: collection.Iterable[A]
  109.  def scan[B >: A](z: B)(op: (B, B) => B): Set[B]
  110.  def scanLeft[B](z: B)(op: (B, A) => B): Set[B]
  111.  def scanRight[B](z: B)(op: (A, B) => B): Set[B]
  112.  def size: Int
  113.  def sizeCompare(that: collection.Iterable[_]): Int
  114.  def sizeCompare(otherSize: Int): Int
  115.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  116.  def sizeHint(size: Int): Unit
  117.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  118.  final def sizeIs: SizeCompareOps
  119.  def slice(from: Int, until: Int): Set[A]
  120.  def sliding(size: Int, step: Int): Iterator[Set[A]]
  121.  def sliding(size: Int): Iterator[Set[A]]
  122.  def span(p: (A) => Boolean): (Set[A], Set[A])
  123.  def splitAt(n: Int): (Set[A], Set[A])
  124.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
  125.  def stringPrefix: String
  126.  def subsetOf(that: collection.Set[A]): Boolean
  127.  def subsets(): Iterator[Set[A]]
  128.  def subsets(len: Int): Iterator[Set[A]]
  129.  def subtractAll(xs: IterableOnce[A]): Set.this.type
  130.  def sum[B >: A](implicit num: math.Numeric[B]): B
  131.  final def synchronized[T0](arg0: => T0): T0
  132.  def tail: Set[A]
  133.  def tails: Iterator[Set[A]]
  134.  def take(n: Int): Set[A]
  135.  def takeRight(n: Int): Set[A]
  136.  def takeWhile(p: (A) => Boolean): Set[A]
  137.  def tapEach[U](f: (A) => U): Set[A]
  138.  def to[C1](factory: Factory[A, C1]): C1
  139.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  140.  final def toBuffer[B >: A]: Buffer[B]
  141.  def toIndexedSeq: immutable.IndexedSeq[A]
  142.  def toList: immutable.List[A]
  143.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  144.  def toSeq: immutable.Seq[A]
  145.  def toSet[B >: A]: immutable.Set[B]
  146.  def toString(): String
  147.  def toVector: immutable.Vector[A]
  148.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Set[Set[B]]
  149.  final def union(that: collection.Set[A]): Set[A]
  150.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Set[A1], Set[A2])
  151.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
  152.  def update(elem: A, included: Boolean): Unit
  153.  def view: View[A]
  154.  final def wait(): Unit
  155.  final def wait(arg0: Long, arg1: Int): Unit
  156.  final def wait(arg0: Long): Unit
  157.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]Set[_]]
  158.  def zip[B](that: IterableOnce[B]): Set[(A, B)]
  159.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
  160.  def zipWithIndex: Set[(A, Int)]
  161.  final def |(that: collection.Set[A]): Set[A]
Deprecated Value Members
  1.  def +(elem1: A, elem2: A, elems: A*): Set[A]
  2.  def +(elem: A): Set[A]
  3.  def ++:[B >: A](that: IterableOnce[B]): Set[B]
  4.  final def +=(elem1: A, elem2: A, elems: A*): Set.this.type
  5.  def -(elem1: A, elem2: A, elems: A*): Set[A]
  6.  def -(elem: A): Set[A]
  7.  def --(that: IterableOnce[A]): Set[A]
  8.  def -=(elem1: A, elem2: A, elems: A*): Set.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 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: Set[A]
  48.  final def retain(p: (A) => Boolean): Unit
  49.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  50.  def seq: Set.this.type
  51.  def size: Int
  52.  def sum(implicit num: math.Numeric[A]): A
  53.  def to[C1](factory: Factory[A, C1]): C1
  54.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  55.  def toBuffer[B >: A]: Buffer[B]
  56.  def toIndexedSeq: collection.IndexedSeq[A]
  57.  final def toIterable: collection.Iterable[A]
  58.  final def toIterable: Set.this.type
  59.  def toIterator: Iterator[A]
  60.  final def toIterator: Iterator[A]
  61.  def toList: immutable.List[A]
  62.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  63.  def toSeq: immutable.Seq[A]
  64.  def toSet[B >: A]: immutable.Set[B]
  65.  def toStream: immutable.Stream[A]
  66.  final def toStream: immutable.Stream[A]
  67.  final def toTraversable: collection.Traversable[A]
  68.  final def toTraversable: collection.Traversable[A]
  69.  def toVector: immutable.Vector[A]
  70.  def view(from: Int, until: Int): View[A]
  71.  def withFilter(f: (A) => Boolean): Iterator[A]
  72.  def →[B](y: B): (Set[A], B)
Inherited by implicit conversion Ensuring fromSet[A] to Ensuring[Set[A]]

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