trait SetMethods[A, +This <: SetLike[A, This] with Set[A]] extends IterableMethods[A, This] with AddableMethods[A, This] with SubtractableMethods[A, This]


  1. SubtractableMethods
  2. AddableMethods
  3. IterableMethods
  4. TraversableMethods
  5. AnyRef
  6. Any

Value Members

  1. def &(that: Set[A]): This

  2. def &~(that: Set[A]): This

  3. def +(elem: A): This

  4. def +(elem1: A, elem2: A, elems: A*): This

  5. def ++(iter: Iterator[A]): This

  6. def ++(elems: Traversable[A]): This

  7. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[This, B, That]): That

  8. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[This, B, That]): That

  9. def -(elem: A): This

  10. def -(elem1: A, elem2: A, elems: A*): This

  11. def --(iter: Iterator[A]): This

  12. def --(elems: Traversable[A]): This

  13. def /:[B](z: B)(op: (B, A) ⇒ B): B

  14. def :\[B](z: B)(op: (A, B) ⇒ B): B

  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

  16. def addString(b: StringBuilder, sep: String): StringBuilder

  17. def addString(b: StringBuilder): StringBuilder

  18. def apply(elem: A): Boolean

  19. def contains(elem: A): Boolean

  20. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

  21. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

  22. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

  23. def count(p: (A) ⇒ Boolean): Int

  24. def diff(that: Set[A]): This

  25. def drop(n: Int): Traversable[A]

  26. def dropRight(n: Int): Iterable[A]

  27. def dropWhile(p: (A) ⇒ Boolean): Traversable[A]

  28. def empty: This

  29. def equals(arg0: Any): Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an equivalence relation:

    • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
    • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
    • It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same Int (o1.hashCode.equals(o2.hashCode)).


    the object to compare against this object for equality.


    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: AnyRef ⇐ Any
  30. def exists(p: (A) ⇒ Boolean): Boolean

  31. def filter(p: (A) ⇒ Boolean): Traversable[A]

  32. def filterNot(p: (A) ⇒ Boolean): Traversable[A]

  33. def find(p: (A) ⇒ Boolean): Option[A]

  34. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[This, B, That]): That

  35. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

  36. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

  37. def forall(p: (A) ⇒ Boolean): Boolean

  38. def foreach[U](f: (A) ⇒ U): Unit

  39. def groupBy[K](f: (A) ⇒ K): Map[K, Traversable[A]]

  40. def hasDefiniteSize: Boolean

  41. def hashCode(): Int

    Returns a hash code value for the object

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    definition classes: AnyRef ⇐ Any
  42. def head: A

  43. def headOption: Option[A]

  44. def init: Traversable[A]

  45. def intersect(that: Set[A]): This

  46. def isEmpty: Boolean

  47. def iterator: Iterator[A]

  48. def last: A

  49. def lastOption: Option[A]

  50. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[This, B, That]): That

  51. def mkString: String

  52. def mkString(start: String, sep: String, end: String): String

  53. def mkString(sep: String): String

  54. def nonEmpty: Boolean

  55. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[This, B, That]): That

  56. def partition(p: (A) ⇒ Boolean): (Traversable[A], Traversable[A])

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

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

  59. def reduceRight[B >: A](op: (A, B) ⇒ B): B

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

  61. def sameElements[B >: A](that: Iterable[B]): Boolean

  62. def size: Int

  63. def slice(from: Int, until: Int): Traversable[A]

  64. def sortWith(lt: (A, A) ⇒ Boolean)(m: ClassManifest[A]): This

  65. def span(p: (A) ⇒ Boolean): (Traversable[A], Traversable[A])

  66. def splitAt(n: Int): (Traversable[A], Traversable[A])

  67. def stringPrefix: String

  68. def subsetOf(that: Set[A]): Boolean

  69. def tail: Traversable[A]

  70. def take(n: Int): Traversable[A]

  71. def takeRight(n: Int): Iterable[A]

  72. def takeWhile(p: (A) ⇒ Boolean): Traversable[A]

  73. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

  74. def toIndexedSeq[B >: A]: IndexedSeq[B]

  75. def toIterable: Iterable[A]

  76. def toList: List[A]

  77. def toSeq: Seq[A]

  78. def toSet[B >: A]: Set[B]

  79. def toStream: Stream[A]

  80. def toString(): String

    Returns a string representation of the object

    Returns a string representation of the object.

    The default representation is platform dependent.

    definition classes: AnyRef ⇐ Any
  81. def union(that: Set[A]): This

  82. def view(from: Int, until: Int): IterableView[A, This]

  83. def view: IterableView[A, This]

  84. def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[This, (A1, B), That]): That

  85. def zipAll[B, A1 >: A, That](that: Iterable[B], e1: A1, e2: B)(bf: CanBuildFrom[This, (A1, B), That]): That

  86. def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[This, (A1, Int), That]): That

  87. def |(that: Set[A]): This