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.2/scala/collection/immutable/Set.html below:

Scala Standard Library 2.13.2 - scala.collection.immutable.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. Set
  4. Equals
  5. SetOps
  6. Function1
  7. Iterable
  8. Iterable
  9. IterableFactoryDefaults
  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
Abstract Value Members
  1.  abstract def contains(elem: A): Boolean
  2.  abstract def excl(elem: A): Set[A]
  3.  abstract def incl(elem: A): Set[A]
  4.  abstract def iterator: Iterator[A]
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 +(elem: A): Set[A]
  6.  final def ++(that: IterableOnce[A]): Set[A]
  7.  final def ++[B >: A](suffix: IterableOnce[B]): Set[B]
  8.  final def -(elem: A): Set[A]
  9.  final def --(that: IterableOnce[A]): Set[A]
  10.  def ->[B](y: B): (Set[A], B)
  11.  final def ==(arg0: Any): Boolean
  12.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder
  13.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
  14.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
  15.  def andThen[A](g: (Boolean) => A): (A) => A
  16.  final def apply(elem: A): Boolean
  17.  final def asInstanceOf[T0]: T0
  18.  def canEqual(that: Any): Boolean
  19.  def className: String
  20.  def clone(): AnyRef
  21.  final def coll: Set.this.type
  22.  def collect[B](pf: PartialFunction[A, B]): Set[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]): Set[A]
  26.  def concat[B >: A](suffix: IterableOnce[B]): Set[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]): Set[A]
  33.  def drop(n: Int): Set[A]
  34.  def dropRight(n: Int): Set[A]
  35.  def dropWhile(p: (A) => Boolean): Set[A]
  36.  def empty: Set[A]
  37.  def ensuring(cond: (Set[A]) => Boolean, msg: => Any): Set[A]
  38.  def ensuring(cond: (Set[A]) => Boolean): Set[A]
  39.  def ensuring(cond: Boolean, msg: => Any): Set[A]
  40.  def ensuring(cond: Boolean): Set[A]
  41.  final def eq(arg0: AnyRef): Boolean
  42.  def equals(that: Any): Boolean
  43.  def exists(p: (A) => Boolean): Boolean
  44.  def filter(pred: (A) => Boolean): Set[A]
  45.  def filterNot(pred: (A) => Boolean): Set[A]
  46.  def finalize(): Unit
  47.  def find(p: (A) => Boolean): Option[A]
  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.  def formatted(fmtstr: String): String
  56.  def fromSpecific(coll: IterableOnce[A]): Set[A]
  57.  final def getClass(): Class[_ <: AnyRef]
  58.  def groupBy[K](f: (A) => K): Map[K, Set[A]]
  59.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Set[B]]
  60.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
  61.  def grouped(size: Int): Iterator[Set[A]]
  62.  def hashCode(): Int
  63.  def head: A
  64.  def headOption: Option[A]
  65.  def init: Set[A]
  66.  def inits: Iterator[Set[A]]
  67.  def intersect(that: collection.Set[A]): Set[A]
  68.  def isEmpty: Boolean
  69.  final def isInstanceOf[T0]: Boolean
  70.  def isTraversableAgain: Boolean
  71.  def iterableFactory: IterableFactory[Set]
  72.  def knownSize: Int
  73.  def last: A
  74.  def lastOption: Option[A]
  75.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Set.this.type]
  76.  def map[B](f: (A) => B): Set[B]
  77.  def max[B >: A](implicit ord: math.Ordering[B]): A
  78.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  79.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  80.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  81.  def min[B >: A](implicit ord: math.Ordering[B]): 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 newSpecificBuilder: Builder[A, Set[A]]
  90.  def nonEmpty: Boolean
  91.  final def notify(): Unit
  92.  final def notifyAll(): Unit
  93.  def partition(p: (A) => Boolean): (Set[A], Set[A])
  94.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Set[A1], Set[A2])
  95.  def product[B >: A](implicit num: math.Numeric[B]): B
  96.  def reduce[B >: A](op: (B, B) => B): B
  97.  def reduceLeft[B >: A](op: (B, A) => B): B
  98.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  99.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  100.  def reduceRight[B >: A](op: (A, B) => B): B
  101.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  102.  def removedAll(that: IterableOnce[A]): Set[A]
  103.  def reversed: collection.Iterable[A]
  104.  def scan[B >: A](z: B)(op: (B, B) => B): Set[B]
  105.  def scanLeft[B](z: B)(op: (B, A) => B): Set[B]
  106.  def scanRight[B](z: B)(op: (A, B) => B): Set[B]
  107.  def size: Int
  108.  def sizeCompare(that: collection.Iterable[_]): Int
  109.  def sizeCompare(otherSize: Int): Int
  110.  final def sizeIs: SizeCompareOps
  111.  def slice(from: Int, until: Int): Set[A]
  112.  def sliding(size: Int, step: Int): Iterator[Set[A]]
  113.  def sliding(size: Int): Iterator[Set[A]]
  114.  def span(p: (A) => Boolean): (Set[A], Set[A])
  115.  def splitAt(n: Int): (Set[A], Set[A])
  116.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
  117.  def stringPrefix: String
  118.  def subsetOf(that: collection.Set[A]): Boolean
  119.  def subsets(): Iterator[Set[A]]
  120.  def subsets(len: Int): Iterator[Set[A]]
  121.  def sum[B >: A](implicit num: math.Numeric[B]): B
  122.  final def synchronized[T0](arg0: => T0): T0
  123.  def tail: Set[A]
  124.  def tails: Iterator[Set[A]]
  125.  def take(n: Int): Set[A]
  126.  def takeRight(n: Int): Set[A]
  127.  def takeWhile(p: (A) => Boolean): Set[A]
  128.  def tapEach[U](f: (A) => U): Set[A]
  129.  def to[C1](factory: Factory[A, C1]): C1
  130.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  131.  final def toBuffer[B >: A]: Buffer[B]
  132.  def toIndexedSeq: IndexedSeq[A]
  133.  final def toIterable: Set.this.type
  134.  def toList: List[A]
  135.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  136.  def toSeq: Seq[A]
  137.  def toSet[B >: A]: Set[B]
  138.  def toString(): String
  139.  def toVector: Vector[A]
  140.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Set[Set[B]]
  141.  final def union(that: collection.Set[A]): Set[A]
  142.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Set[A1], Set[A2])
  143.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
  144.  def view: View[A]
  145.  final def wait(): Unit
  146.  final def wait(arg0: Long, arg1: Int): Unit
  147.  final def wait(arg0: Long): Unit
  148.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]Set[_]]
  149.  def zip[B](that: IterableOnce[B]): Set[(A, B)]
  150.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
  151.  def zipWithIndex: Set[(A, Int)]
  152.  final def |(that: collection.Set[A]): Set[A]
Deprecated Value Members
  1.  def +(elem1: A, elem2: A, elems: A*): Set[A]
  2.  def ++:[B >: A](that: IterableOnce[B]): Set[B]
  3.  def -(elem1: A, elem2: A, elems: A*): Set[A]
  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 copyToBuffer(dest: Buffer[A]): Unit
  12.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  13.  def count(f: (A) => Boolean): Int
  14.  def exists(f: (A) => Boolean): Boolean
  15.  def filter(f: (A) => Boolean): Iterator[A]
  16.  def find(p: (A) => Boolean): Option[A]
  17.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
  18.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  19.  def foldLeft[B](z: B)(op: (B, A) => B): B
  20.  def foldRight[B](z: B)(op: (A, B) => B): B
  21.  def forall(f: (A) => Boolean): Boolean
  22.  def foreach[U](f: (A) => U): Unit
  23.  def hasDefiniteSize: Boolean
  24.  def isEmpty: Boolean
  25.  def map[B](f: (A) => B): IterableOnce[B]
  26.  def max(implicit ord: math.Ordering[A]): A
  27.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  28.  def min(implicit ord: math.Ordering[A]): A
  29.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  30.  def mkString: String
  31.  def mkString(sep: String): String
  32.  def mkString(start: String, sep: String, end: String): String
  33.  def nonEmpty: Boolean
  34.  def product(implicit num: math.Numeric[A]): A
  35.  def reduce(f: (A, A) => A): A
  36.  def reduceLeft(f: (A, A) => A): A
  37.  def reduceLeftOption(f: (A, A) => A): Option[A]
  38.  def reduceOption(f: (A, A) => A): Option[A]
  39.  def reduceRight(f: (A, A) => A): A
  40.  def reduceRightOption(f: (A, A) => A): Option[A]
  41.  final def repr: Set[A]
  42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  43.  def seq: Set.this.type
  44.  def size: Int
  45.  def sum(implicit num: math.Numeric[A]): A
  46.  def to[C1](factory: Factory[A, C1]): C1
  47.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  48.  def toBuffer[B >: A]: Buffer[B]
  49.  def toIndexedSeq: collection.IndexedSeq[A]
  50.  final def toIterable: collection.Iterable[A]
  51.  def toIterator: Iterator[A]
  52.  final def toIterator: Iterator[A]
  53.  def toList: List[A]
  54.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  55.  def toSeq: Seq[A]
  56.  def toSet[B >: A]: Set[B]
  57.  def toStream: Stream[A]
  58.  final def toStream: Stream[A]
  59.  final def toTraversable: collection.Traversable[A]
  60.  final def toTraversable: collection.Traversable[A]
  61.  def toVector: Vector[A]
  62.  def view(from: Int, until: Int): View[A]
  63.  def withFilter(f: (A) => Boolean): Iterator[A]
  64.  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