scala.collection.mutable

Set

trait Set[A] extends Iterable[A] with Set[A] with GenericSetTemplate[A, Set[A][A]] with SetLike[A, Set[A]]

A generic trait for mutable sets. Concrete set implementations have to provide functionality for the abstract methods in Set:

def contains(elem: A): Boolean def iterator: Iterator[A] def += (elem: A): this.type def -= (elem: A): this.type

known subclasses: HashSet, ObservableSet, SetProxy, JSetWrapper, LinkedHashSet, ImmutableSetAdaptor, BitSet, SynchronizedSet

Inherits

  1. SetLike
  2. Cloneable
  3. Shrinkable
  4. Builder
  5. Growable
  6. Scriptable
  7. Set
  8. SetLike
  9. Subtractable
  10. Addable
  11. GenericSetTemplate
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. Mutable
  19. Traversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. HasNewBuilder
  23. AnyRef
  24. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def &(that: Set[A]): Set[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: SetLike
  2. def &~(that: Set[A]): Set[A]

    The difference of this set and another set

    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: SetLike
  3. def **(that: Set[A]): Set[A]

    This method is an alias for intersect

    This method is an alias for intersect. It computes an intersection with set that. It removes all the elements that are not present in that.

    that

    the set to intersect with

    definition classes: SetLike
  4. def +(elem1: A, elem2: A, elems: A*): Set[A]

    Adds two or more elements to this collection and returns the collection itself

    Adds two or more elements to this collection and returns the collection itself.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new mutable set with the given elements added.

    definition classes: SetLikeAddable
  5. def +(elem: A): Set[A]

    Adds a single element to this collection and returns the collection itself

    Adds a single element to this collection and returns the collection itself.

    elem

    the element to add.

    returns

    a new set that contains all elements of this set and that also contains elem.

    definition classes: SetLikeSetLikeAddable
  6. def ++(iter: Iterator[A]): Set[A]

    Adds a number of elements provided by an iterator and returns the collection itself

    Adds a number of elements provided by an iterator and returns the collection itself.

    iter

    the iterator

    returns

    a new mutable set with the given elements added.

    definition classes: SetLikeAddable
  7. def ++(iter: Traversable[A]): Set[A]

    Adds a number of elements provided by a traversable object and returns either the collection itself

    Adds a number of elements provided by a traversable object and returns either the collection itself.

    iter

    the iterable object.

    returns

    a new mutable set with the given elements added.

    definition classes: SetLikeAddable
  8. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[Set[A], B, That]): That

    Concatenates this mutable set with the elements of an iterator

    Concatenates this mutable set with the elements of an iterator.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the iterator to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this mutable set followed by all elements of that.

    definition classes: TraversableLike
  9. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[Set[A], B, That]): That

    Concatenates this mutable set with the elements of a traversable collection

    Concatenates this mutable set with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this mutable set followed by all elements of that.

    definition classes: TraversableLike
  10. def ++=(elems: Traversable[A]): Growable[A]

    adds all elements contained in a traversable collection to this mutable set

    adds all elements contained in a traversable collection to this mutable set.

    elems

    the collection containing the elements to add.

    returns

    the mutable set itself.

    definition classes: Growable
  11. def ++=(iter: Iterator[A]): Growable[A]

    adds all elements produced by an iterator to this mutable set

    adds all elements produced by an iterator to this mutable set.

    iter

    the iterator producing the elements to add.

    returns

    the mutable set itself.

    definition classes: Growable
  12. def +=(elem1: A, elem2: A, elems: A*): Growable[A]

    adds two or more elements to this mutable set

    adds two or more elements to this mutable set.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the mutable set itself

    definition classes: Growable
  13. def +=(elem: A): SetLike[A, Set[A]]

    Adds a single element to the builder

    Adds a single element to the builder.

    elem

    the element to be added.

    returns

    the builder itself.

    attributes: abstract
    definition classes: SetLikeBuilderGrowable
  14. def -(elem1: A, elem2: A, elems: A*): Set[A]

    Removes two or more elements from this collection and returns the collection itself

    Removes two or more elements from this collection and returns the collection itself.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new mutable set that contains all elements of the current mutable set except one less occurrence of each of the given elements.

    definition classes: SetLikeSubtractable
  15. def -(elem: A): Set[A]

    Removes a single element from this collection and returns the collection itself

    Removes a single element from this collection and returns the collection itself.

    elem

    the element to remove.

    returns

    a new set that contains all elements of this set but that does not contain elem.

    definition classes: SetLikeSetLikeSubtractable
  16. def --(iter: Iterator[A]): Set[A]

    Removes a number of elements provided by an iterator and returns the collection itself

    Removes a number of elements provided by an iterator and returns the collection itself.

    iter

    the iterator

    returns

    a new mutable set that contains all elements of the current mutable set except one less occurrence of each of the elements produced by iter.

    definition classes: SetLikeSubtractable
  17. def --(iter: Traversable[A]): Set[A]

    Removes a number of elements provided by a Traversable object and returns the collection itself

    Removes a number of elements provided by a Traversable object and returns the collection itself.

    iter

    the Traversable object.

    returns

    a new mutable set that contains all elements of the current mutable set except one less occurrence of each of the elements of elems.

    definition classes: SetLikeSubtractable
  18. def --=(iter: Traversable[A]): Shrinkable[A]

    Removes all elements contained in a traversable collection from this mutable set

    Removes all elements contained in a traversable collection from this mutable set.

    iter

    the collection containing the elements to remove.

    returns

    the mutable set itself

    definition classes: Shrinkable
  19. def --=(iter: Iterator[A]): Shrinkable[A]

    Removes all elements produced by an iterator from this mutable set

    Removes all elements produced by an iterator from this mutable set.

    iter

    the iterator producing the elements to remove.

    returns

    the mutable set itself

    definition classes: Shrinkable
  20. def -=(elem1: A, elem2: A, elems: A*): Shrinkable[A]

    Removes two or more elements from this mutable set

    Removes two or more elements from this mutable set.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the mutable set itself

    definition classes: Shrinkable
  21. def -=(elem: A): SetLike[A, Set[A]]

    Removes a single element from this mutable set

    Removes a single element from this mutable set.

    elem

    the element to remove.

    returns

    the mutable set itself

    attributes: abstract
    definition classes: SetLikeShrinkable
  22. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this mutable set, going left to right

    Applies a binary operator to a start value and all elements of this mutable set, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable set$, going left to right with the start value z on the left: {{{ op(...op(op(z, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: TraversableLike
  23. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this mutable set and a start value, going right to left

    Applies a binary operator to all elements of this mutable set and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this mutable set$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: TraversableLike
  24. def <<(cmd: Message[A]): Unit

    Send a message to this scriptable object

    Send a message to this scriptable object.

    cmd

    the message to send.

    definition classes: SetLikeScriptable
  25. def add(elem: A): Boolean

    Adds an element to this mutable set

    Adds an element to this mutable set.

    elem

    the element to be added

    returns

    true if the element was not yet present in the set, false otherwise.

    definition classes: SetLike
  26. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this mutable set to a string builder

    Appends all elements of this mutable set to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this mutable set without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  27. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this mutable set to a string builder using a separator string

    Appends all elements of this mutable set to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this mutable set, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  28. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this mutable set to a string builder using start, end, and separator strings

    Appends all elements of this mutable set to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this mutable set are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  29. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

    (f andThen g)(x) == g(f(x))

    (f andThen g)(x) == g(f(x))

    definition classes: Function1
  30. 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: SetLike
  31. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this mutable set should be compared

    returns

    true, if this mutable set can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  32. def clear(): Unit

    Removes all elements from the set

    Removes all elements from the set. After this operation is completed, the set will be empty.

    definition classes: SetLikeBuilderGrowable
  33. def clone(): Set[A]

    This method creates and returns a copy of the receiver object

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    definition classes: SetLikeCloneable ⇐ AnyRef
  34. def companion: GenericCompanion[Set[A][A]]

    The factory companion object that builds instances of class mutable

    The factory companion object that builds instances of class mutable.Set.

  35. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  36. def contains(elem: A): Boolean

    Tests if some element is contained in this set

    Tests if some element is contained in this set.

    elem

    the element to test for membership.

    returns

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

    attributes: abstract
    definition classes: SetLike
  37. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this mutable set to an array

    Copies elements of this mutable set to an array. Fills the given array xs with at most len elements of this mutable set, starting at position start. Copying will stop once either the end of the current mutable set is reached, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLike
  38. def copyToArray[B >: A](xs: Array[B]): Unit

    Copies elements of this mutable set to an array

    Copies elements of this mutable set to an array. Fills the given array xs with all elements of this mutable set, starting at position 0. Copying will stop once either the end of the current mutable set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  39. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    Copies elements of this mutable set to an array

    Copies elements of this mutable set to an array. Fills the given array xs with all elements of this mutable set, starting at position start. Copying will stop once either the end of the current mutable set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableLike
  40. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this mutable set to a buffer

    Copies all elements of this mutable set to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  41. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the mutable set which satisfy a predicate

    Counts the number of elements in the mutable set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableLike
  42. def diff(that: Set[A]): Set[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: SetLike
  43. def drop(n: Int): Set[A]

    Selects all elements except first n ones

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this mutable set.

    returns

    a mutable set consisting of all elements of this mutable set except the first n ones, or else the empty mutable set, if this mutable set has less than n elements.

    definition classes: TraversableLike
  44. def dropRight(n: Int): Set[A]

    Selects all elements except first n ones

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    The number of elements to take

    returns

    a mutable set consisting of all elements of this mutable set except the first n ones, or else the empty mutable set, if this mutable set has less than n elements.

    definition classes: IterableLike
  45. def dropWhile(p: (A) ⇒ Boolean): Set[A]

    Drops longest prefix of elements that satisfy a predicate

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this mutable set whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  46. def elements: Iterator[A]

  47. def empty: Set[A]

  48. def equals(that: Any): Boolean

    Compares this set with another object for equality

    Compares this set with another object for equality.

    that

    the other object

    returns

    true if that is a set which contains the same elements as this set.

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

    Tests whether a predicate holds for some of the elements of this mutable set

    Tests whether a predicate holds for some of the elements of this mutable set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this mutable set, otherwise false.

    definition classes: IterableLikeTraversableLike
  50. def filter(p: (A) ⇒ Boolean): Set[A]

    Selects all elements of this mutable set which satisfy a predicate

    Selects all elements of this mutable set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable set consisting of all elements of this mutable set that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  51. def filterNot(p: (A) ⇒ Boolean): Set[A]

    Selects all elements of this mutable set which do not satisfy a predicate

    Selects all elements of this mutable set which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable set consisting of all elements of this mutable set that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  52. def find(p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the mutable set satisfying a predicate, if any

    Finds the first element of the mutable set satisfying a predicate, if any.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLike
  53. def first: A

  54. def firstOption: Option[A]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  55. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[Set[A], B, That]): That

    Builds a new collection by applying a function to all elements of this mutable set and concatenating the results

    Builds a new collection by applying a function to all elements of this mutable set and concatenating the results.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this mutable set and concatenating the results.

    definition classes: TraversableLike
  56. def flatten[B](asTraversable: (A) ⇒ Traversable[B]): Set[B]

    Converts this mutable set of traversable collections into a mutable set in which all element collections are concatenated

    Converts this mutable set of traversable collections into a mutable set in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this mutable set is a Traversable.

    returns

    a new mutable set resulting from concatenating all element mutable sets.

    definition classes: GenericTraversableTemplate
  57. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this mutable set, going left to right

    Applies a binary operator to a start value and all elements of this mutable set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable set$, going left to right with the start value z on the left: {{{ op(...op(z, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: TraversableLike
  58. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this mutable set and a start value, going right to left

    Applies a binary operator to all elements of this mutable set and a start value, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable set$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: IterableLikeTraversableLike
  59. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this mutable set

    Tests whether a predicate holds for all elements of this mutable set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this mutable set, otherwise false.

    definition classes: IterableLikeTraversableLike
  60. def foreach[U](f: (A) ⇒ U): Unit

    Applies a function f to all elements of this mutable set

    Applies a function f to all elements of this mutable set.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    definition classes: IterableLikeTraversableLike
  61. def genericBuilder[B]: Builder[B, Set[B]]

    The generic builder that builds instances of mutable

    The generic builder that builds instances of mutable.Set at arbitrary element types.

    definition classes: GenericTraversableTemplate
  62. def groupBy[K](f: (A) ⇒ K): Map[K, Set[A]]

    Partitions this mutable set into a map of mutable sets according to some discriminator function

    Partitions this mutable set into a map of mutable sets according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new mutable set.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable sets such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a mutable set of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  63. def hasDefiniteSize: Boolean

    Tests whether this mutable set is known to have a finite size

    Tests whether this mutable set is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    definition classes: TraversableLike
  64. 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: SetLike ⇐ AnyRef ⇐ Any
  65. def head: A

    Selects the first element of this mutable set

    Selects the first element of this mutable set.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: IterableLikeTraversableLike
  66. def headOption: Option[A]

    Optionally selects the first element

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  67. def init: Set[A]

    Selects all elements except the last

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  68. def intersect(that: Set[A]): Set[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: SetLike
  69. def isEmpty: Boolean

    Tests if this set is empty

    Tests if this set is empty.

    definition classes: SetLikeIterableLikeTraversableLike
  70. def iterator: Iterator[A]

    Creates a new iterator over all elements contained in this iterable object

    Creates a new iterator over all elements contained in this iterable object.

    attributes: abstract
    definition classes: IterableLike
  71. def last: A

    Selects the last element

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  72. def lastOption: Option[A]

    Optionally selects the last element

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  73. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[Set[A], B, That]): That

    Builds a new collection by applying a function to all elements of this mutable set

    Builds a new collection by applying a function to all elements of this mutable set.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this mutable set and collecting the results.

    definition classes: TraversableLike
  74. def mapResult[NewTo](f: (Set[A]) ⇒ NewTo): Builder[A, NewTo]

    Creates a new builder by applying a transformation function to the results of this builder

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    definition classes: Builder
  75. def max[B >: A](cmp: Ordering[B]): A

    Finds the largest element

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this mutable set with respect to the ordering cmp.

    definition classes: TraversableLike
  76. def min[B >: A](cmp: Ordering[B]): A

    Finds the smallest element

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this mutable set with respect to the ordering cmp.

    definition classes: TraversableLike
  77. def mkString: String

    Displays all elements of this mutable set in a string

    Displays all elements of this mutable set in a string.

    definition classes: TraversableLike
  78. def mkString(sep: String): String

    Displays all elements of this mutable set in a string using a separator string

    Displays all elements of this mutable set in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this mutable set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this mutable set are separated by the string sep.

    definition classes: TraversableLike
  79. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this mutable set in a string using start, end, and separator strings

    Displays all elements of this mutable set in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this mutable set. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this mutable set are separated by the string sep.

    definition classes: TraversableLike
  80. def nonEmpty: Boolean

    Tests whether the mutable set is not empty

    Tests whether the mutable set is not empty.

    definition classes: TraversableLike
  81. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[Set[A], B, That]): That

    Builds a new collection by applying a partial function to all elements of this mutable set on which the function is defined

    Builds a new collection by applying a partial function to all elements of this mutable set on which the function is defined.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the mutable set.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  82. def partition(p: (A) ⇒ Boolean): (Set[A], Set[A])

    Partitions this mutable set in two mutable sets according to a predicate

    Partitions this mutable set in two mutable sets according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of mutable sets: the first mutable set consists of all elements that satisfy the predicate p and the second mutable set consists of all elements that don't. The relative order of the elements in the resulting mutable sets is the same as in the original mutable set.

    definition classes: TraversableLike
  83. def product[B >: A](num: Numeric[B]): B

    Multiplies up the elements of this collection

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this mutable set with respect to the * operator in num.

    definition classes: TraversableLike
  84. def projection: IterableView[A, Set[A]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: IterableLike
  85. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    Applies a binary operator to all elements of this mutable set, going left to right

    Applies a binary operator to all elements of this mutable set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable set$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: TraversableLike
  86. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable set, going left to right

    Optionally applies a binary operator to all elements of this mutable set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this mutable set is nonempty, None otherwise.

    definition classes: TraversableLike
  87. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this mutable set, going right to left

    Applies a binary operator to all elements of this mutable set, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable set$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

    definition classes: IterableLikeTraversableLike
  88. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable set, going right to left

    Optionally applies a binary operator to all elements of this mutable set, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this mutable set is nonempty, None otherwise.

    definition classes: TraversableLike
  89. def remove(elem: A): Boolean

    Removes an element from this set

    Removes an element from this set.

    elem

    The element to be removed.

    returns

    true if the element was previously present in the set, false otherwise.

    definition classes: SetLike
  90. def repr: Set[A]

    The collection of type mutable set underlying this TraversableLike object

    The collection of type mutable set underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  91. def result(): Set[A]

    The result when this set is used as a builder

    The result when this set is used as a builder

    definition classes: SetLikeBuilder
  92. def retain(p: (A) ⇒ Boolean): Unit

    Removes all elements from the set for which do not satisfy a predicate

    Removes all elements from the set for which do not satisfy a predicate.

    p

    the predicate used to test elements. Only elements for while p returns true are retained in the set; all others are removed.

    definition classes: SetLike
  93. def sameElements[B >: A](that: Iterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this mutable set

    Checks if the other iterable collection contains the same elements in the same order as this mutable set.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: IterableLike
  94. def size: Int

    The size of this mutable set

    The size of this mutable set.

    definition classes: TraversableLike
  95. def sizeHint(size: Int): Unit

    Gives a hint how many elements are expected to be added when the next result is called

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    definition classes: Builder
  96. def slice(from: Int, until: Int): Set[A]

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first returned element in this mutable set.

    until

    the index one past the last returned element in this mutable set.

    returns

    a mutable set containing the elements starting at index from and extending up to (but not including) index until of this mutable set.

    definition classes: IterableLikeTraversableLike
  97. def span(p: (A) ⇒ Boolean): (Set[A], Set[A])

    Spits this mutable set into a prefix/suffix pair according to a predicate

    Spits this mutable set 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the test predicate

    returns

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

    definition classes: TraversableLike
  98. def splitAt(n: Int): (Set[A], Set[A])

    Splits this mutable set into two at a given position

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of mutable sets consisting of the first n elements of this mutable set, and the other elements.

    definition classes: TraversableLike
  99. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: SetLikeTraversableLike
  100. def subsetOf(that: 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: SetLike
  101. def sum[B >: A](num: Numeric[B]): B

    Sums up the elements of this collection

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this mutable set with respect to the + operator in num.

    definition classes: TraversableLike
  102. def tail: Set[A]

    Selects all elements except the first

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  103. def take(n: Int): Set[A]

    Selects first n elements

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    Tt number of elements to take from this mutable set.

    returns

    a mutable set consisting only of the first n elements of this mutable set, or else the whole mutable set, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
  104. def takeRight(n: Int): Set[A]

    Selects last n elements

    Selects last n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take

    returns

    a mutable set consisting only of the last n elements of this mutable set, or else the whole mutable set, if it has less than n elements.

    definition classes: IterableLike
  105. def takeWhile(p: (A) ⇒ Boolean): Set[A]

    Takes longest prefix of elements that satisfy a predicate

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this mutable set whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
  106. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

    Converts this mutable set to an array

    Converts this mutable set to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this mutable set.

    definition classes: TraversableLike
  107. def toIndexedSeq[B >: A]: IndexedSeq[B]

    Converts this mutable set to an indexed sequence

    Converts this mutable set to an indexed sequence.

    definition classes: TraversableLike
  108. def toIterable: Iterable[A]

    Converts this mutable set to an iterable collection

    Converts this mutable set to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  109. def toList: List[A]

    Converts this mutable set to a list

    Converts this mutable set to a list.

    definition classes: TraversableLike
  110. def toSeq: Seq[A]

    Converts this mutable set to a sequence

    Converts this mutable set to a sequence.

    definition classes: TraversableLike
  111. def toSet[B >: A]: Set[B]

    Converts this mutable set to a set

    Converts this mutable set to a set.

    definition classes: TraversableLike
  112. def toStream: Stream[A]

    Converts this mutable set to a stream

    Converts this mutable set to a stream.

    definition classes: IterableLikeTraversableLike
  113. def toString(): String

    Converts this mutable set to a string

    Converts this mutable set to a string

    definition classes: SetLikeTraversableLike ⇐ AnyRef ⇐ Any
  114. def transpose[B](asTraversable: (A) ⇒ Traversable[B]): Set[Set[B]]

    Transposes this mutable set of traversable collections into

    Transposes this mutable set of traversable collections into

    definition classes: GenericTraversableTemplate
  115. def union(that: Set[A]): Set[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: SetLike
  116. def unzip[A1, A2](asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Converts this mutable set of pairs into two collections of the first and second halfs of each pair

    Converts this mutable set of pairs into two collections of the first and second halfs of each pair.

    asPair

    an implicit conversion which asserts that the element type of this mutable set is a pair.

    returns

    a pair mutable sets, containing the first, respectively second half of each element pair of this mutable set.

    definition classes: GenericTraversableTemplate
  117. def update(elem: A, included: Boolean): Unit

    Updates the presence of a single element in this set

    Updates the presence of a single element in this set.

    This method allows one to add or remove an element elem from this set depending on the value of parameter included. Typically, one would use the following syntax: {{{ set(elem) = true // adds element set(elem) = false // removes element }}}

    elem

    the element to be added or removed

    included

    a flag indicating whether element should be included or excluded.

    definition classes: SetLike
  118. def view(from: Int, until: Int): IterableView[A, Set[A]]

    Creates a non-strict view of a slice of this mutable set

    Creates a non-strict view of a slice of this mutable set.

    Note: the difference between view and slice is that view produces a view of the current mutable set, whereas slice produces a new mutable set.

    Note: view(from, to) is equivalent to view.slice(from, to)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this mutable set, starting at index from and extending up to (but not including) index until.

    definition classes: IterableLikeTraversableLike
  119. def view: IterableView[A, Set[A]]

    Creates a non-strict view of this mutable set

    Creates a non-strict view of this mutable set.

    definition classes: IterableLikeTraversableLike
  120. def withFilter(p: (A) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this mutable set

    Creates a non-strict filter of this mutable set.

    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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 mutable set which satify the predicate p.

    definition classes: TraversableLike
  121. def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[Set[A], (A1, B), That]): That

    Returns a mutable set formed from this mutable set and another iterable collection by combining corresponding elements in pairs

    Returns a mutable set formed from this mutable set 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

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

    definition classes: IterableLike
  122. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Set[A], (A1, B), That]): That

    Returns a mutable set formed from this mutable set and another iterable collection by combining corresponding elements in pairs

    Returns a mutable set formed from this mutable set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this mutable set is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this mutable set.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this mutable set and that. The length of the returned collection is the maximum of the lengths of this mutable set$ and that. If this mutable set is shorter than that, thisElem values are used to pad the result. If that is shorter than this mutable set, thatElem values are used to pad the result.

    definition classes: IterableLike
  123. def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[Set[A], (A1, Int), That]): That

    Zips this mutable set with its indices

    Zips this mutable set with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

    definition classes: IterableLike
  124. def |(that: Set[A]): Set[A]

    Computes the union between this set and another set

    Computes the union between this 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: SetLike