Scaladoc for scala.collection.mutable.SetProxy

Inherits

SetProxyLike
IterableProxyLike
TraversableProxyLike
Proxy
Set
SetLike
Cloneable
Shrinkable
Builder
Growable
Scriptable
Set
SetLike
Subtractable
Addable
GenericSetTemplate
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Mutable
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

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: SetProxyLike ⇐ SetLike
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: SetProxyLike ⇐ SetLike
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
def +(elem: A): SetProxy[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.
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: SetLike ⇐ Addable
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: SetLike ⇐ Addable
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: SetLike ⇐ Addable
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
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
def +=(elem: A): SetProxy[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.
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
def -(elem: A): SetProxy[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.
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: SetLike ⇐ Subtractable
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: SetLike ⇐ Subtractable
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: SetLike ⇐ Subtractable
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
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
def -=(elem: A): SetProxy[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
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
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, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: TraversableProxyLike ⇐ TraversableLike
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(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: TraversableProxyLike ⇐ TraversableLike
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: SetLike ⇐ Scriptable
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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: SetProxyLike ⇐ SetLike
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: IterableLike ⇐ Equals
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: SetLike ⇐ Builder ⇐ Growable
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: SetLike ⇐ Cloneable ⇐ AnyRef
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.

definition classes: Set ⇐ Set ⇐ Iterable ⇐ Iterable ⇐ Traversable ⇐ Traversable ⇐ GenericTraversableTemplate
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
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.

definition classes: SetProxyLike ⇐ SetLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: SetProxyLike ⇐ SetLike
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: TraversableProxyLike ⇐ TraversableLike
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: IterableProxyLike ⇐ IterableLike
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: TraversableProxyLike ⇐ TraversableLike
def elements: Iterator[A]
def empty: SetProxy[A]
def equals(that: 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)).
definition classes: Proxy ⇐ AnyRef ⇐ Any
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
def first: A
def firstOption: Option[A]

None if iterable is empty

None if iterable is empty.

definition classes: IterableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: TraversableProxyLike ⇐ TraversableLike
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(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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. It's important to implement this method in an efficient way.

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: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: Proxy ⇐ AnyRef ⇐ Any
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: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: SetProxyLike ⇐ SetLike
def isEmpty: Boolean

Tests whether this mutable set is empty

Tests whether this mutable set is empty.

definition classes: SetProxyLike ⇐ IterableProxyLike ⇐ TraversableProxyLike ⇐ SetLike ⇐ IterableLike ⇐ TraversableLike
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.

definition classes: IterableProxyLike ⇐ IterableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
def nonEmpty: Boolean

Tests whether the mutable set is not empty

Tests whether the mutable set is not empty.

definition classes: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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
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(x₁, x₂), ... ) , x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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(x₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable set.

definition classes: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
def repr: SetProxy[A]

The representation object of type Repr which contains the collection's elements

The representation object of type Repr which contains the collection's elements
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: SetLike ⇐ Builder
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
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: IterableProxyLike ⇐ IterableLike
def self: Set[A]
def size: Int

The size of this mutable set

The size of this mutable set.

definition classes: TraversableProxyLike ⇐ TraversableLike
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation

Defines the prefix of this object's toString representation.

definition classes: TraversableProxyLike ⇐ TraversableLike
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: SetProxyLike ⇐ SetLike
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
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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: IterableProxyLike ⇐ IterableLike
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: TraversableProxyLike ⇐ TraversableLike
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: TraversableProxyLike ⇐ TraversableLike
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
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: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
def toList: List[A]

Converts this mutable set to a list

Converts this mutable set to a list.

definition classes: TraversableProxyLike ⇐ TraversableLike
def toSeq: Seq[A]

Converts this mutable set to a sequence

Converts this mutable set to a sequence.

definition classes: TraversableProxyLike ⇐ TraversableLike
def toSet[B >: A]: Set[B]

Converts this mutable set to a set

Converts this mutable set to a set.

definition classes: TraversableProxyLike ⇐ TraversableLike
def toStream: Stream[A]

Converts this mutable set to a stream

Converts this mutable set to a stream.

definition classes: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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: Proxy ⇐ AnyRef ⇐ Any
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
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: SetProxyLike ⇐ SetLike
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
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
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: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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: IterableProxyLike ⇐ TraversableProxyLike ⇐ IterableLike ⇐ TraversableLike
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
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: IterableProxyLike ⇐ IterableLike
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: IterableProxyLike ⇐ IterableLike
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: IterableProxyLike ⇐ IterableLike
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: SetProxyLike ⇐ SetLike

SetProxy

trait SetProxy[A] extends Set[A] with SetProxyLike[A, Set[A]]

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def &(that: Set[A]): Set[A]

def &~(that: Set[A]): Set[A]

def **(that: Set[A]): Set[A]

def +(elem: A): SetProxy[A]

def +(elem1: A, elem2: A, elems: A*): Set[A]

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

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

def ++(iter: Iterator[A]): Set[A]

def ++(iter: Traversable[A]): Set[A]

def ++=(elems: Traversable[A]): Growable[A]

def ++=(iter: Iterator[A]): Growable[A]

def +=(elem: A): SetProxy[A]

def +=(elem1: A, elem2: A, elems: A*): Growable[A]

def -(elem: A): SetProxy[A]

def -(elem1: A, elem2: A, elems: A*): Set[A]

def --(iter: Iterator[A]): Set[A]

def --(iter: Traversable[A]): Set[A]

def --=(iter: Traversable[A]): Shrinkable[A]

def --=(iter: Iterator[A]): Shrinkable[A]

def -=(elem: A): SetProxy[A]

def -=(elem1: A, elem2: A, elems: A*): Shrinkable[A]

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

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

def <<(cmd: Message[A]): Unit

def add(elem: A): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

def apply(elem: A): Boolean

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Set[A]

def companion: GenericCompanion[Set[A][A]]

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

def contains(elem: A): Boolean

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

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

def copyToArray[B >: A](xs: Array[B]): Unit

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

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

def diff(that: Set[A]): Set[A]

def drop(n: Int): Set[A]

def dropRight(n: Int): Set[A]

def dropWhile(p: (A) ⇒ Boolean): Set[A]

def elements: Iterator[A]

def empty: SetProxy[A]

def equals(that: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): Set[A]

def filterNot(p: (A) ⇒ Boolean): Set[A]

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

def first: A

def firstOption: Option[A]

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

def flatten[B](asTraversable: (A) ⇒ Traversable[B]): Set[B]

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

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

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

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

def genericBuilder[B]: Builder[B, Set[B]]

def groupBy[K](f: (A) ⇒ K): Map[K, Set[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: A

def headOption: Option[A]

def init: Set[A]

def intersect(that: Set[A]): Set[A]

def isEmpty: Boolean

def iterator: Iterator[A]

def last: A

def lastOption: Option[A]

def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[Set[A], B, That]): That

def mapResult[NewTo](f: (Set[A]) ⇒ NewTo): Builder[A, NewTo]