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

This class implements mutable sets using a hashtable.

Annotations
@SerialVersionUID()
Version

2.0, 31/12/2006

Since

1

See also

"Scala's Collection Library overview" section on Hash Tables for more information.

Linear Supertypes
Serializable, Serializable, StrictOptimizedIterableOps[A, HashSet, HashSet[A]], Set[A], SetOps[A, HashSet, HashSet[A]], Shrinkable[A], collection.Set[A], collection.SetOps[A, HashSet, HashSet[A]], Equals, (A) ⇒ Boolean, Iterable[A], IterableOps[A, HashSet, HashSet[A]], Growable[A], collection.Iterable[A], collection.IterableOps[A, HashSet, HashSet[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashSet
  2. Serializable
  3. Serializable
  4. StrictOptimizedIterableOps
  5. Set
  6. SetOps
  7. Shrinkable
  8. Set
  9. SetOps
  10. Equals
  11. Function1
  12. Iterable
  13. IterableOps
  14. Growable
  15. Iterable
  16. IterableOps
  17. IterableOnce
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashSet()
  2. new HashSet(contents: Contents[A])

Type Members

  1. class WithFilter extends collection.WithFilter[A, CC]

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    Definition Classes
    IterableOps

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: collection.Set[A]): HashSet[A]

    Alias for intersect

    Alias for intersect

    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: collection.Set[A]): HashSet[A]

    Alias for diff

    Alias for diff

    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def ++(that: collection.Iterable[A]): HashSet[A]

    Alias for concat

    Alias for concat

    Definition Classes
    SetOps
    Annotations
    @inline()
  6. final def ++[B >: A](suffix: collection.Iterable[B]): HashSet[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++=(xs: IterableOnce[A]): HashSet.this.type

    Alias for addAllInPlace

    Alias for addAllInPlace

    Definition Classes
    Growable
    Annotations
    @inline()
  8. final def +=(elem1: A, elem2: A, elems: A*): HashSet.this.type

    ${Add}s two or more elements to this $coll.

    ${Add}s two or more elements to this $coll.

    elem1

    the first element to $add.

    elem2

    the second element to $add.

    elems

    the remaining elements to $add.

    returns

    the $coll itself

    Definition Classes
    Growable
    Annotations
    @inline()
  9. final def +=(elem: A): HashSet.this.type

    Alias for add

    Alias for add

    Definition Classes
    Growable
    Annotations
    @inline()
  10. final def --=(xs: IterableOnce[A]): HashSet.this.type

    Alias for subtractAll

    Alias for subtractAll

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  11. final def -=(elem1: A, elem2: A, elems: A*): HashSet.this.type

    Alias for subtract

    Alias for subtract

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  12. final def -=(elem: A): HashSet.this.type

    Alias for subtract

    Alias for subtract

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  13. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def add(elem: A): HashSet.this.type

    ${Add}s a single element to this mutable hash set.

    ${Add}s a single element to this mutable hash set.

    elem

    the element to $add.

    returns

    the mutable hash set itself

    Definition Classes
    HashSet → Growable
  15. def addAll(xs: IterableOnce[A]): HashSet.this.type

    ${Add}s all elements produced by a TraversableOnce to this $coll.

    ${Add}s all elements produced by a TraversableOnce to this $coll.

    xs

    the TraversableOnce producing the elements to $add.

    returns

    the $coll itself.

    Definition Classes
    Growable
  16. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  17. final def apply(elem: A): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

    This method is equivalent to contains. It allows sets to be interpreted as predicates.

    elem

    the element to test for membership.

    returns

    true if elem is contained in this set, false otherwise.

    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  18. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  19. def canEqual(that: Any): Boolean
    Definition Classes
    SetOps → Equals
  20. def className: String

    The class name of this collection.

    The class name of this collection. To be used for converting to string. Collections generally print like this:

    <className>(elem_1, ..., elem_n)

    Definition Classes
    IterableOps
  21. def clear(): Unit

    Clears the mutable hash set's contents.

    Clears the mutable hash set's contents. After this operation, the mutable hash set is empty.

    Definition Classes
    HashSet → Growable
  22. def clone(): HashSet[A]
    Definition Classes
    SetOps → AnyRef
  23. final def coll: HashSet.this.type

    returns

    This collection as a C.

    Attributes
    protected[this]
    Definition Classes
    Set → IterableOps
  24. def collect[B](pf: PartialFunction[A, B]): HashSet[B]
    Definition Classes
    IterableOps
  25. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    $mayNotTerminateInf $orderDependent

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    IterableOps
    Example:

    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  26. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  27. def concat(that: collection.Iterable[A]): HashSet[A]

    Creates a new $coll by adding all elements contained in another collection to this $coll, omitting duplicates.

    Creates a new $coll by adding all elements contained in another collection to this $coll, omitting duplicates.

    This method takes a collection of elements and adds all elements, omitting duplicates, into $coll.

    Example:

    scala> val a = Set(1, 2) concat Set(2, 3)
a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)
    that

    the collection containing the elements to add.

    returns

    a new $coll with the given elements added, omitting duplicates.

    Definition Classes
    SetOps
  28. final def concat[B >: A](suffix: collection.Iterable[B]): HashSet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  29. def contains(elem: A): Boolean
    Definition Classes
    HashSet → SetOps
  30. def copyToArray[B >: A](xs: Array[B], start: Int = 0): xs.type

    Copy all elements of this collection to array xs, starting at start.

    Copy all elements of this collection to array xs, starting at start.

    Definition Classes
    IterableOps
  31. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the $coll which satisfy a predicate.

    Counts the number of elements in the $coll which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOps
  32. def diff(that: collection.Set[A]): HashSet[A]

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

    a set containing those elements of this set that are not also contained in the given set that.

    Definition Classes
    SetOps → SetOps
  33. def drop(n: Int): HashSet[A]

    The rest of the collection without its n first elements.

    The rest of the collection without its n first elements. For linear, immutable collections this should avoid making a copy.

    Definition Classes
    IterableOps
  34. def dropRight(n: Int): HashSet[A]

    The rest of the collection without its n last elements.

    The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

    Definition Classes
    IterableOps
  35. def dropWhile(p: (A) ⇒ Boolean): HashSet[A]

    Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.

    Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.

    p

    the predicate used to skip elements.

    returns

    an iterator consisting of the remaining elements

    Definition Classes
    IterableOps
    Note

    Reuse: $consumesAndProducesIterator

  36. def empty: HashSet[A]

    The empty set of the same type as this set

    The empty set of the same type as this set

    returns

    an empty set of type C.

    Definition Classes
    HashSet → SetOps
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(that: Any): Boolean
    Definition Classes
    SetOps → Equals → AnyRef → Any
  39. def exists(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for at least one element of this $coll.

    Tests whether a predicate holds for at least one element of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this $coll, otherwise false

    Definition Classes
    IterableOps
  40. def filter(pred: (A) ⇒ Boolean): HashSet[A]

    Selects all elements of this $coll which satisfy a predicate.

    Selects all elements of this $coll which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new $coll consisting of all elements of this $coll that satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    IterableOps
  41. def filterInPlace(p: (A) ⇒ Boolean): HashSet.this.type
    Definition Classes
    SetOps → IterableOps
  42. def filterNot(pred: (A) ⇒ Boolean): HashSet[A]

    Selects all elements of this $coll which do not satisfy a predicate.

    Selects all elements of this $coll which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new $coll consisting of all elements of this $coll that do not satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    IterableOps
  43. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  44. def find(p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the $coll satisfying a predicate, if any.

    Finds the first element of the $coll satisfying a predicate, if any.

    $mayNotTerminateInf $orderDependent

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the $coll that satisfies p, or None if none exists.

    Definition Classes
    IterableOps
  45. def flatMap[B](f: (A) ⇒ IterableOnce[B]): HashSet[B]

    Flatmap

    Flatmap

    Definition Classes
    IterableOps
  46. def flatMapInPlace(f: (A) ⇒ IterableOnce[A]): HashSet.this.type
    Definition Classes
    SetOps → IterableOps
  47. def flatten[B](implicit ev: (A) ⇒ IterableOnce[B]): HashSet[B]
    Definition Classes
    IterableOps
  48. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Fold left

    Fold left

    Definition Classes
    IterableOps
  49. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Fold right

    Fold right

    Definition Classes
    IterableOps
  50. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this $coll.

    Tests whether a predicate holds for all elements of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if this $coll is empty or the given predicate p holds for all elements of this $coll, otherwise false.

    Definition Classes
    IterableOps
  51. def foreach[U](f: (A) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    HashSet → IterableOps
  52. def fromIterable[E](it: collection.Iterable[E]): HashSet[E]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  53. def fromSpecificIterable(coll: collection.Iterable[A]): HashSet[A]
    Attributes
    protected[this]
    Definition Classes
    HashSet → IterableOps
  54. def get(elem: A): Option[A]

    elem

    The element to get.

    returns

    The reference of the contained element that is equal to elem, if found, otherwise None

    Definition Classes
    HashSet → SetOps
  55. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  56. def groupBy[K](f: (A) ⇒ K): immutable.Map[K, HashSet[A]]

    Partitions this $coll into a map of ${coll}s according to some discriminator function.

    Partitions this $coll into a map of ${coll}s according to some discriminator function.

    Note: When applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to ${coll}s such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a $coll of those elements x for which f(x) equals k.

    Definition Classes
    IterableOps
  57. def groupMap[K, B](key: (A) ⇒ K)(f: (A) ⇒ B): immutable.Map[K, HashSet[B]]

    Partitions this $coll into a map of ${coll}s according to a discriminator function key.

    Partitions this $coll into a map of ${coll}s according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

    It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

    case class User(name: String, age: Int)

def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
  users.groupMap(_.age)(_.name)
    K

    the type of keys returned by the discriminator function

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  58. def groupMapReduce[K, B](key: (A) ⇒ K)(f: (A) ⇒ B)(reduce: (B, B) ⇒ B): immutable.Map[K, B]

    Partitions this $coll into a map according to a discriminator function key.

    Partitions this $coll into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the value function and then reduced into a single value with the reduce function.

    It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

    def occurrences[A](as: Seq[A]): Map[A, Int] =
  as.groupMapReduce(identity)(_ => 1)(_ + _)
    Definition Classes
    IterableOps
  59. def grouped(size: Int): Iterator[HashSet[A]]

    Partitions elements in fixed size ${coll}s.

    Partitions elements in fixed size ${coll}s.

    size

    the number of elements per group

    returns

    An iterator producing ${coll}s of size size, except the last will be less than size size if the elements don't divide evenly.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method grouped

  60. def hashCode(): Int
    Definition Classes
    SetOps → AnyRef → Any
  61. def head: A

    The first element of the collection.

    The first element of the collection.

    Definition Classes
    IterableOps
  62. def init: HashSet[A]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Definition Classes
    IterableOps
  63. def insert(elem: A): Boolean
    Definition Classes
    SetOps
  64. def intersect(that: collection.Set[A]): HashSet[A]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

    a new set consisting of all elements that are both in this set and in the given set that.

    Definition Classes
    SetOps
  65. def isEmpty: Boolean

    Is the collection empty?

    Is the collection empty?

    Definition Classes
    IterableOps
  66. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  67. def iterableFactory: HashSet.type
    Definition Classes
    HashSet → IterableOps
  68. def iterator(): Iterator[A]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    HashSet → IterableOnce
  69. def knownSize: Int

    The number of elements in this collection, if it can be cheaply computed, -1 otherwise.

    The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
    IterableOps
  70. def last: A

    Selects the last element.

    Selects the last element. $orderDependent

    returns

    The last element of this $coll.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException If the $coll is empty.

  71. def lastOption: Option[A]

    Optionally selects the last element.

    Optionally selects the last element. $orderDependent

    returns

    the last element of this $coll$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  72. def map[B](f: (A) ⇒ B): HashSet[B]

    Builds a new collection by applying a function to all elements of this $coll.

    Builds a new collection by applying a function to all elements of this $coll.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new $coll resulting from applying the given function f to each element of this $coll and collecting the results.

    Definition Classes
    IterableOps
  73. def mapInPlace(f: (A) ⇒ A): HashSet.this.type
    Definition Classes
    SetOps → IterableOps
  74. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable hash set.

    Definition Classes
    IterableOps
    Full Signature

    def max[B >: A](implicit ord: Ordering[B]): A

  75. def maxBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this mutable hash set with the largest value measured by function f.

    Definition Classes
    IterableOps
    Full Signature

    def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

  76. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable hash set

    Definition Classes
    IterableOps
    Full Signature

    def min[B >: A](implicit ord: Ordering[B]): A

  77. def minBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this mutable hash set with the smallest value measured by function f.

    Definition Classes
    IterableOps
    Full Signature

    def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

  78. def mkString: String
    Definition Classes
    IterableOps
  79. def mkString(sep: String): String
    Definition Classes
    IterableOps
  80. def mkString(start: String, sep: String, end: String): String

    A string showing all elements of this collection, separated by string sep.

    A string showing all elements of this collection, separated by string sep.

    Definition Classes
    IterableOps
  81. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  82. def newSpecificBuilder(): Builder[A, HashSet[A]]

    returns

    a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented on top of views rather than builders.

    Attributes
    protected[this]
    Definition Classes
    HashSet → IterableOps
  83. def nonEmpty: Boolean

    Is the collection not empty?

    Is the collection not empty?

    Definition Classes
    IterableOps
  84. final def notify(): Unit
    Definition Classes
    AnyRef
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  86. def partition(p: (A) ⇒ Boolean): (HashSet[A], HashSet[A])

    Optimized, push-based version of partition.

    Optimized, push-based version of partition.

    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  87. def product: A

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this mutable hash set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the mutable hash set and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOps
    Full Signature

    def product[B >: A](implicit num: Numeric[B]): B

  88. def reduce[B >: A](op: (B, B) ⇒ B): B

    Reduces the elements of this $coll using the specified associative binary operator.

    Reduces the elements of this $coll using the specified associative binary operator.

    $undefinedorder

    B

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the $coll is nonempty.

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  89. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going left to right.

    Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going left to right:

    op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  90. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going left to right.

    Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOps
  91. def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    $undefinedorder

    B

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    IterableOps
  92. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going right to left.

    Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  93. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going right to left.

    Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOps
  94. def remove(elem: A): Option[A]
    Definition Classes
    SetOps
  95. def reversed: collection.Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  96. def scan[B >: A](z: B)(op: (B, B) ⇒ B): HashSet[B]

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new $coll containing the prefix scan of the elements in this $coll

    Definition Classes
    IterableOps
  97. def scanLeft[B](z: B)(op: (B, A) ⇒ B): HashSet[B]

    Produces a collection containing cumulative results of applying the operator going left to right.

    Produces a collection containing cumulative results of applying the operator going left to right.

    $willNotTerminateInf $orderDependent

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  98. def scanRight[B](z: B)(op: (A, B) ⇒ B): HashSet[B]

    Produces a collection containing cumulative results of applying the operator going right to left.

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result. $willNotTerminateInf $orderDependent

    Example:

    List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  99. def size: Int

    The number of elements in this collection.

    The number of elements in this collection. Does not terminate for infinite collections.

    Definition Classes
    IterableOps
  100. def slice(from: Int, until: Int): HashSet[A]

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

    from <= indexOf(x) < until

    $orderDependent

    from

    the lowest index to include from this $coll.

    until

    the lowest index to EXCLUDE from this $coll.

    returns

    a $coll containing the elements greater than or equal to index from extending up to (but not including) index until of this $coll.

    Definition Classes
    IterableOps
  101. def sliding(size: Int, step: Int): Iterator[HashSet[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups

    returns

    An iterator producing ${coll}s of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  102. def sliding(size: Int): Iterator[HashSet[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) The "sliding window" step is set to one.

    size

    the number of elements per group

    returns

    An iterator producing ${coll}s of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  103. def span(p: (A) ⇒ Boolean): (HashSet[A], HashSet[A])

    Splits this $coll into a prefix/suffix pair according to a predicate.

    Splits this $coll into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects. $orderDependent

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this $coll whose elements all satisfy p, and the rest of this $coll.

    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  104. def splitAt(n: Int): (HashSet[A], HashSet[A])

    Splits this $coll into two at a given position.

    Splits this $coll into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n). $orderDependent

    n

    the position at which to split.

    returns

    a pair of ${coll}s consisting of the first n elements of this $coll, and the other elements.

    Definition Classes
    IterableOps
  105. def subsetOf(that: collection.Set[A]): Boolean

    Tests whether this set is a subset of another set.

    Tests whether this set is a subset of another set.

    that

    the set to test.

    returns

    true if this set is a subset of that, i.e. if every element of this set is also an element of that.

    Definition Classes
    SetOps
  106. def subsets(): Iterator[HashSet[A]]

    An iterator over all subsets of this set.

    An iterator over all subsets of this set.

    returns

    the iterator.

    Definition Classes
    SetOps
  107. def subsets(len: Int): Iterator[HashSet[A]]

    An iterator over all subsets of this set of the given size.

    An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.

    len

    the size of the subsets.

    returns

    the iterator.

    Definition Classes
    SetOps
  108. def subtract(elem: A): HashSet.this.type

    Removes a single element from this mutable hash set.

    Removes a single element from this mutable hash set.

    elem

    the element to remove.

    returns

    the mutable hash set itself

    Definition Classes
    HashSet → Shrinkable
  109. def subtract(elem1: A, elem2: A, elems: A*): HashSet.this.type

    Removes two or more elements from this shrinkable collection.

    Removes two or more elements from this shrinkable collection.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  110. def subtractAll(xs: IterableOnce[A]): HashSet.this.type

    Removes all elements produced by an iterator from this shrinkable collection.

    Removes all elements produced by an iterator from this shrinkable collection.

    xs

    the iterator producing the elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  111. def sum: A

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this mutable hash set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the mutable hash set and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOps
    Full Signature

    def sum[B >: A](implicit num: Numeric[B]): B

  112. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  113. def tail: HashSet[A]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  114. def take(n: Int): HashSet[A]

    A collection containing the first n elements of this collection.

    A collection containing the first n elements of this collection.

    Definition Classes
    IterableOps
  115. def takeRight(n: Int): HashSet[A]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Definition Classes
    IterableOps
  116. def takeWhile(p: (A) ⇒ Boolean): HashSet[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate. $orderDependent

    p

    The predicate used to test elements.

    returns

    the longest prefix of this $coll whose elements all satisfy the predicate p.

    Definition Classes
    IterableOps
  117. def to[C1](factory: Factory[A, C1]): C1

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:

    xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

    Definition Classes
    IterableOps
  118. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOps
  119. final def toIterable: HashSet.this.type

    The collection itself

    The collection itself

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    Iterable → IterableOps
  120. def toString(): String
    Definition Classes
    SetOps → Function1 → IterableOps → AnyRef → Any
  121. final def union(that: collection.Iterable[A]): HashSet[A]

    Computes the union between of set and another set.

    Computes the union between of set and another set.

    that

    the set to form the union with.

    returns

    a new set consisting of all elements that are in this set or in the given set that.

    Definition Classes
    SetOps
    Annotations
    @inline()
  122. def unzip[A1, A2](implicit asPair: <:<[A, (A1, A2)]): (HashSet[A1], HashSet[A2])

    Converts this $coll of pairs into two collections of the first and second half of each pair.

    Converts this $coll of pairs into two collections of the first and second half of each pair.

    val xs = $Coll(
           (1, "one"),
           (2, "two"),
           (3, "three")).unzip
// xs == ($Coll(1, 2, 3),
//        $Coll(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

    an implicit conversion which asserts that the element type of this $coll is a pair.

    returns

    a pair of ${coll}s, containing the first, respectively second half of each element pair of this $coll.

    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  123. def update(elem: A, included: Boolean): Unit
    Definition Classes
    SetOps
  124. def view: View[A]

    A view representing the elements of this collection.

    A view representing the elements of this collection.

    Definition Classes
    IterableOps
  125. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  126. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  127. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  128. def withFilter(p: (A) ⇒ Boolean): collection.WithFilter[A, HashSet]

    Creates a non-strict filter of this $coll.

    Creates a non-strict filter of this $coll.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations. $orderDependent

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this $coll which satisfy the predicate p.

    Definition Classes
    IterableOps
  129. def zip[B](xs: collection.Iterable[B]): HashSet[(A, B)]

    Returns a $coll formed from this $coll and another iterable collection by combining corresponding elements in pairs.

    Returns a $coll formed from this $coll and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    xs

    The iterable providing the second half of each result pair

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this $coll and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

    Definition Classes
    IterableOps
  130. def zipWithIndex: HashSet[(A, Int)]

    Zips this $coll with its indices.

    Zips this $coll with its indices.

    returns

    A new collection of type That containing pairs consisting of all elements of this $coll paired with their index. Indices start at 0.

    Definition Classes
    IterableOps
    Example:

    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

  131. final def |(that: collection.Iterable[A]): HashSet[A]

    Alias for union

    Alias for union

    Definition Classes
    SetOps
    Annotations
    @inline()

Inherited from Serializable

Inherited from Serializable

Inherited from StrictOptimizedIterableOps[A, HashSet, HashSet[A]]

Inherited from Set[A]

Inherited from SetOps[A, HashSet, HashSet[A]]

Inherited from Shrinkable[A]

Inherited from collection.Set[A]

Inherited from collection.SetOps[A, HashSet, HashSet[A]]

Inherited from Equals

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from IterableOps[A, HashSet, HashSet[A]]

Inherited from Growable[A]

Inherited from collection.Iterable[A]

Inherited from collection.IterableOps[A, HashSet, HashSet[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped