A class supporting filtered operations .
Computes the intersection between this set and another set .
The difference of this set and another set .
This method is an alias for intersect
.
Adds two or more elements to this collection and returns the collection itself .
Adds a single element to this collection and returns the collection itself .
Adds a number of elements provided by a traversable object and returns either the collection itself .
[use case] Concatenates this mutable hash set with the elements of a traversable collection .
Concatenates this mutable hash set with the elements of a traversable collection .
adds all elements produced by a TraversableOnce to this mutable hash set .
Adds a single element to the set .
adds two or more elements to this mutable hash set .
Removes two or more elements from this collection and returns the collection itself .
Removes a single element from this collection and returns the collection itself .
Removes a number of elements provided by a Traversable object and returns the collection itself .
Removes all elements produced by an iterator from this mutable hash set .
Removes a single element from this mutable hash set .
Removes two or more elements from this mutable hash set .
Applies a binary operator to a start value and all elements of this mutable hash set, going left to right .
Applies a binary operator to all elements of this mutable hash set and a start value, going right to left .
Send a message to this scriptable object .
Adds an element to this mutable hash set .
Add entry if not yet in table .
Appends all elements of this mutable hash set to a string builder .
Appends all elements of this mutable hash set to a string builder using a separator string .
Appends all elements of this mutable hash set to a string builder using start, end, and separator strings .
(f andThen g)(x) == g(f(x))
Tests if some element is contained in this set .
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind .
Removes all elements from the set .
This method creates and returns a copy of the receiver object .
[use case] Builds a new collection by applying a partial function to all elements of this mutable hash set on which the function is defined .
Builds a new collection by applying a partial function to all elements of this mutable hash set on which the function is defined .
The factory companion object that builds instances of class mutable .
(f compose g)(x) == f(g(x))
Tests if some element is contained in this set .
Checks whether an element is contained in the hash table .
[use case] Copies elements of this mutable hash set to an array .
Copies elements of this mutable hash set to an array .
[use case] Copies values of this mutable hash set to an array .
Copies values of this mutable hash set to an array .
[use case] Copies values of this mutable hash set to an array .
Copies values of this mutable hash set to an array .
Copies all elements of this mutable hash set to a buffer .
Counts the number of elements in the mutable hash set which satisfy a predicate .
Computes the difference of this set and another set .
Selects all elements except first n ones.
Selects all elements except last n ones.
Drops longest prefix of elements that satisfy a predicate .
Compares this set with another object for equality .
Tests whether a predicate holds for some of the elements of this mutable hash set .
Selects all elements of this mutable hash set which satisfy a predicate .
Selects all elements of this mutable hash set which do not satisfy a predicate .
Finds the first element of the mutable hash set satisfying a predicate, if any .
Finds an entry in the hash table if such an element exists .
None
if iterable is empty.
[use case] Builds a new collection by applying a function to all elements of this mutable hash set and concatenating the results .
Builds a new collection by applying a function to all elements of this mutable hash set and concatenating the results .
[use case] Converts this mutable hash set of traversable collections into a mutable hash set in which all element collections are concatenated .
Converts this mutable hash set of traversable collections into a mutable hash set in which all element collections are concatenated .
Applies a binary operator to a start value and all elements of this mutable hash set, going left to right .
Applies a binary operator to all elements of this mutable hash set and a start value, going right to left .
Tests whether a predicate holds for all elements of this mutable hash set .
[use case] Applies a function f
to all elements of this mutable hash set.
Applies a function f
to all elements of this mutable hash set.
The generic builder that builds instances of mutable .
Partitions this mutable hash set into a map of mutable hash sets according to some discriminator function .
Partitions elements in fixed size mutable hash sets .
Tests whether this mutable hash set is known to have a finite size .
Returns a hash code value for the object .
Selects the first element of this mutable hash set .
Optionally selects the first element .
Selects all elements except the last .
Computes the intersection between this set and another set .
Tests if this set is empty .
Tests whether this mutable hash set can be repeatedly traversed .
Selects the last element .
Optionally selects the last element .
[use case] Builds a new collection by applying a function to all elements of this mutable hash set .
Builds a new collection by applying a function to all elements of this mutable hash set .
Creates a new builder by applying a transformation function to the results of this builder .
[use case] Finds the largest element .
Finds the largest element .
[use case] Finds the smallest element .
Finds the smallest element .
Displays all elements of this mutable hash set in a string .
Displays all elements of this mutable hash set in a string using a separator string .
Displays all elements of this mutable hash set in a string using start, end, and separator strings .
Tests whether the mutable hash set is not empty .
Partitions this mutable hash set in two mutable hash sets according to a predicate .
[use case] Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
returns a projection that can be used to call non-strict filter
,map
, and flatMap
methods that build projections
of the collection.
Applies a binary operator to all elements of this mutable hash set, going left to right .
Optionally applies a binary operator to all elements of this mutable hash set, going left to right .
Applies a binary operator to all elements of this mutable hash set, going right to left .
Optionally applies a binary operator to all elements of this mutable hash set, going right to left .
Removes an element from this set .
Removes an entry from the hash table, returning an option value with the element, or None
if it didn't exist.
The collection of type mutable hash set underlying this TraversableLike
object.
The result when this set is used as a builder
Removes all elements from the set for which do not satisfy a predicate .
[use case] Checks if the other iterable collection contains the same elements in the same order as this mutable hash set .
Checks if the other iterable collection contains the same elements in the same order as this mutable hash set .
Produces a collection containing cummulative results of applying the operator going left to right .
Produces a collection containing cummulative results of applying the operator going right to left .
The size of this mutable hash set .
Gives a hint how many elements are expected to be added
when the next result
is called.
Selects an interval of elements .
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped .
Splits this mutable hash set into a prefix/suffix pair according to a predicate .
Splits this mutable hash set into two at a given position .
Defines the prefix of this object's toString
representation.
Tests whether this set is a subset of another set .
[use case] Sums up the elements of this collection .
Sums up the elements of this collection .
Selects all elements except the first .
Selects first n elements.
Selects last n elements.
Takes longest prefix of elements that satisfy a predicate .
[use case] Converts this mutable hash set to an array .
Converts this mutable hash set to an array .
Converts this mutable hash set to an indexed sequence .
Converts this mutable hash set to an iterable collection .
Returns an Iterator over the elements in this mutable hash set .
Converts this mutable hash set to a list .
Converts this mutable hash set to a map .
Converts this mutable hash set to a sequence .
Converts this mutable hash set to a set .
Converts this mutable hash set to a stream .
Converts this mutable hash set to a string .
Converts this mutable hash set to an unspecified Traversable .
Transposes this mutable hash set of traversable collections into a mutable hash set of mutable hash sets .
Computes the union between of set and another set .
Converts this mutable hash set of pairs into two collections of the first and second halfs of each pair .
Updates the presence of a single element in this set .
Creates a non-strict view of a slice of this mutable hash set .
Creates a non-strict view of this mutable hash set .
Creates a non-strict filter of this mutable hash set .
[use case] Returns a mutable hash set formed from this mutable hash set and another iterable collection by combining corresponding elements in pairs .
Returns a mutable hash set formed from this mutable hash set and another iterable collection by combining corresponding elements in pairs .
[use case] Returns a mutable hash set formed from this mutable hash set and another iterable collection by combining corresponding elements in pairs .
Returns a mutable hash set formed from this mutable hash set and another iterable collection by combining corresponding elements in pairs .
[use case] Zips this mutable hash set with its indices .
Zips this mutable hash set with its indices .
Computes the union between this set and another set .
This class implements mutable sets using a hashtable .
the type of the elements contained in this set .
version
2 . 0, 31/12/2006
since
1
authors: ,
Martin Odersky
Matthias Zenger