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

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

final class HashSet[A] extends AbstractSet[A] with SetOps[A, HashSet, HashSet[A]] with StrictOptimizedIterableOps[A, HashSet, HashSet[A]] with IterableFactoryDefaults[A, HashSet] with Serializable



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