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

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

final class HashSet[A] extends AbstractSet[A] with StrictOptimizedSetOps[A, HashSet, HashSet[A]] with IterableFactoryDefaults[A, HashSet] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashSet
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedSetOps
  5. StrictOptimizedSetOps
  6. StrictOptimizedIterableOps
  7. AbstractSet
  8. Set
  9. SetOps
  10. Iterable
  11. AbstractSet
  12. Set
  13. Equals
  14. SetOps
  15. Function1
  16. AbstractIterable
  17. Iterable
  18. IterableFactoryDefaults
  19. IterableOps
  20. IterableOnceOps
  21. IterableOnce
  22. AnyRef
  23. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new HashSet()
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def &(that: collection.Set[A]): HashSet[A]
  4.  final def &~(that: collection.Set[A]): HashSet[A]
  5.  final def +(elem: A): HashSet[A]
  6.  final def ++(that: IterableOnce[A]): HashSet[A]
  7.  final def ++[B >: A](suffix: IterableOnce[B]): HashSet[B]
  8.  final def -(elem: A): HashSet[A]
  9.  final def --(that: IterableOnce[A]): HashSet[A]
  10.  def ->[B](y: B): (HashSet[A], 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 canEqual(that: Any): Boolean
  19.  def className: String
  20.  def clone(): AnyRef
  21.  final def coll: HashSet.this.type
  22.  def collect[B](pf: PartialFunction[A, B]): HashSet[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]): HashSet[A]
  26.  def concat[B >: A](suffix: IterableOnce[B]): HashSet[B]
  27.  def contains(element: A): Boolean
  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]): HashSet[A]
  34.  def drop(n: Int): HashSet[A]
  35.  def dropRight(n: Int): HashSet[A]
  36.  def dropWhile(p: (A) => Boolean): HashSet[A]
  37.  def empty: HashSet[A]
  38.  def ensuring(cond: (HashSet[A]) => Boolean, msg: => Any): HashSet[A]
  39.  def ensuring(cond: (HashSet[A]) => Boolean): HashSet[A]
  40.  def ensuring(cond: Boolean, msg: => Any): HashSet[A]
  41.  def ensuring(cond: Boolean): HashSet[A]
  42.  final def eq(arg0: AnyRef): Boolean
  43.  def equals(that: Any): Boolean
  44.  def excl(element: A): HashSet[A]
  45.  def exists(p: (A) => Boolean): Boolean
  46.  def filter(pred: (A) => Boolean): HashSet[A]
  47.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): HashSet[A]
  48.  def filterNot(pred: (A) => Boolean): HashSet[A]
  49.  def finalize(): Unit
  50.  def find(p: (A) => Boolean): Option[A]
  51.  def flatMap[B](f: (A) => IterableOnce[B]): HashSet[B]
  52.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): HashSet[B]
  53.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  54.  def foldLeft[B](z: B)(op: (B, A) => B): B
  55.  def foldRight[B](z: B)(op: (A, B) => B): B
  56.  def forall(p: (A) => Boolean): Boolean
  57.  def foreach[U](f: (A) => U): Unit
  58.  def fromSpecific(coll: IterableOnce[A]): HashSet[A]
  59.  final def getClass(): Class[_ <: AnyRef]
  60.  def groupBy[K](f: (A) => K): Map[K, HashSet[A]]
  61.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, HashSet[B]]
  62.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
  63.  def grouped(size: Int): Iterator[HashSet[A]]
  64.  def hashCode(): Int
  65.  def head: A
  66.  def headOption: Option[A]
  67.  def incl(element: A): HashSet[A]
  68.  def init: HashSet[A]
  69.  def inits: Iterator[HashSet[A]]
  70.  def intersect(that: collection.Set[A]): HashSet[A]
  71.  def isEmpty: Boolean
  72.  final def isInstanceOf[T0]: Boolean
  73.  def isTraversableAgain: Boolean
  74.  def iterableFactory: IterableFactory[HashSet]
  75.  def iterator: Iterator[A]
  76.  def knownSize: Int
  77.  def last: A
  78.  def lastOption: Option[A]
  79.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, HashSet.this.type]
  80.  def map[B](f: (A) => B): HashSet[B]
  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, HashSet[A]]
  94.  def nonEmpty: Boolean
  95.  final def notify(): Unit
  96.  final def notifyAll(): Unit
  97.  def partition(p: (A) => Boolean): (HashSet[A], HashSet[A])
  98.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (HashSet[A1], HashSet[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 removedAll(that: IterableOnce[A]): HashSet[A]
  107.  def reverseIterator: Iterator[A]
  108.  def reversed: collection.Iterable[A]
  109.  def scan[B >: A](z: B)(op: (B, B) => B): HashSet[B]
  110.  def scanLeft[B](z: B)(op: (B, A) => B): HashSet[B]
  111.  def scanRight[B](z: B)(op: (A, B) => B): HashSet[B]
  112.  def size: Int
  113.  def sizeCompare(that: collection.Iterable[_]): Int
  114.  def sizeCompare(otherSize: Int): Int
  115.  final def sizeIs: SizeCompareOps
  116.  def slice(from: Int, until: Int): HashSet[A]
  117.  def sliding(size: Int, step: Int): Iterator[HashSet[A]]
  118.  def sliding(size: Int): Iterator[HashSet[A]]
  119.  def span(p: (A) => Boolean): (HashSet[A], HashSet[A])
  120.  def splitAt(n: Int): (HashSet[A], HashSet[A])
  121.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  122.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  123.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  124.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  125.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  126.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  127.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  128.  def stringPrefix: String
  129.  def subsetOf(that: Set[A]): Boolean
  130.  def subsetOf(that: collection.Set[A]): Boolean
  131.  def subsets(): Iterator[HashSet[A]]
  132.  def subsets(len: Int): Iterator[HashSet[A]]
  133.  def sum[B >: A](implicit num: math.Numeric[B]): B
  134.  final def synchronized[T0](arg0: => T0): T0
  135.  def tail: HashSet[A]
  136.  def tails: Iterator[HashSet[A]]
  137.  def take(n: Int): HashSet[A]
  138.  def takeRight(n: Int): HashSet[A]
  139.  def takeWhile(p: (A) => Boolean): HashSet[A]
  140.  def tapEach[U](f: (A) => U): HashSet[A]
  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: IndexedSeq[A]
  145.  def toList: List[A]
  146.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  147.  def toSeq: Seq[A]
  148.  def toSet[B >: A]: Set[B]
  149.  def toString(): String
  150.  def toVector: Vector[A]
  151.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): HashSet[HashSet[B]]
  152.  final def union(that: collection.Set[A]): HashSet[A]
  153.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (HashSet[A1], HashSet[A2])
  154.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (HashSet[A1], HashSet[A2], HashSet[A3])
  155.  def view: View[A]
  156.  final def wait(): Unit
  157.  final def wait(arg0: Long, arg1: Int): Unit
  158.  final def wait(arg0: Long): Unit
  159.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]HashSet[_]]
  160.  def writeReplace(): AnyRef
  161.  def zip[B](that: IterableOnce[B]): HashSet[(A, B)]
  162.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): HashSet[(A1, B)]
  163.  def zipWithIndex: HashSet[(A, Int)]
  164.  final def |(that: collection.Set[A]): HashSet[A]
Deprecated Value Members
  1.  def +(elem1: A, elem2: A, elems: A*): HashSet[A]
  2.  def ++:[B >: A](that: IterableOnce[B]): HashSet[B]
  3.  def -(elem1: A, elem2: A, elems: A*): HashSet[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[[_]HashSet[_]]
  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 formatted(fmtstr: String): String
  24.  def hasDefiniteSize: Boolean
  25.  def isEmpty: Boolean
  26.  def map[B](f: (A) => B): IterableOnce[B]
  27.  def max(implicit ord: math.Ordering[A]): A
  28.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  29.  def min(implicit ord: math.Ordering[A]): A
  30.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  31.  def mkString: String
  32.  def mkString(sep: String): String
  33.  def mkString(start: String, sep: String, end: String): String
  34.  def nonEmpty: Boolean
  35.  def product(implicit num: math.Numeric[A]): A
  36.  def reduce(f: (A, A) => A): A
  37.  def reduceLeft(f: (A, A) => A): A
  38.  def reduceLeftOption(f: (A, A) => A): Option[A]
  39.  def reduceOption(f: (A, A) => A): Option[A]
  40.  def reduceRight(f: (A, A) => A): A
  41.  def reduceRightOption(f: (A, A) => A): Option[A]
  42.  final def repr: HashSet[A]
  43.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  44.  def seq: HashSet.this.type
  45.  def size: Int
  46.  def sum(implicit num: math.Numeric[A]): A
  47.  def to[C1](factory: Factory[A, C1]): C1
  48.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  49.  def toBuffer[B >: A]: Buffer[B]
  50.  def toIndexedSeq: collection.IndexedSeq[A]
  51.  final def toIterable: collection.Iterable[A]
  52.  final def toIterable: HashSet.this.type
  53.  def toIterator: Iterator[A]
  54.  final def toIterator: Iterator[A]
  55.  def toList: List[A]
  56.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  57.  def toSeq: Seq[A]
  58.  def toSet[B >: A]: Set[B]
  59.  def toStream: Stream[A]
  60.  final def toStream: Stream[A]
  61.  final def toTraversable: collection.Traversable[A]
  62.  final def toTraversable: collection.Traversable[A]
  63.  def toVector: Vector[A]
  64.  def view(from: Int, until: Int): View[A]
  65.  def withFilter(f: (A) => Boolean): Iterator[A]
  66.  def →[B](y: B): (HashSet[A], 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