object HashSet extends IterableFactory[HashSet]
This object provides a set of operations to create mutable.HashSet
values.
- Annotations
- @SerialVersionUID()
- Source
- HashSet.scala
- Alphabetic
- By Inheritance
- HashSet
- IterableFactory
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- def apply[A](elems: A*): HashSet[A]
Creates a mutable hash set with the specified elements.
Creates a mutable hash set with the specified elements.
- A
the type of the mutable hash set's elements
- elems
the elements of the created mutable hash set
- returns
a new mutable hash set with elements
elems
- Definition Classes
- IterableFactory
- def concat[A](xss: collection.Iterable[A]*): HashSet[A]
Concatenates all argument collections into a single mutable hash set.
Concatenates all argument collections into a single mutable hash set.
- xss
the collections that are to be concatenated.
- returns
the concatenation of all the collections.
- Definition Classes
- IterableFactory
- final def defaultInitialCapacity: Int
The default initial capacity for the hash table
- final def defaultLoadFactor: Double
The default load factor for the hash table
- def empty[A]: HashSet[A]
An empty collection
An empty collection
- A
the type of the mutable hash set's elements
- Definition Classes
- HashSet → IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): HashSet[HashSet[HashSet[HashSet[HashSet[A]]]]]
Produces a five-dimensional mutable hash set containing the results of some element computation a number of times.
Produces a five-dimensional mutable hash set containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- n5
the number of elements in the 5th dimension
- elem
the element computation
- returns
A mutable hash set that contains the results of
n1 x n2 x n3 x n4 x n5
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): HashSet[HashSet[HashSet[HashSet[A]]]]
Produces a four-dimensional mutable hash set containing the results of some element computation a number of times.
Produces a four-dimensional mutable hash set containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- elem
the element computation
- returns
A mutable hash set that contains the results of
n1 x n2 x n3 x n4
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): HashSet[HashSet[HashSet[A]]]
Produces a three-dimensional mutable hash set containing the results of some element computation a number of times.
Produces a three-dimensional mutable hash set containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- elem
the element computation
- returns
A mutable hash set that contains the results of
n1 x n2 x n3
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int)(elem: => A): HashSet[HashSet[A]]
Produces a two-dimensional mutable hash set containing the results of some element computation a number of times.
Produces a two-dimensional mutable hash set containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- elem
the element computation
- returns
A mutable hash set that contains the results of
n1 x n2
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n: Int)(elem: => A): HashSet[A]
Produces a mutable hash set containing the results of some element computation a number of times.
Produces a mutable hash set containing the results of some element computation a number of times.
- n
the number of elements contained in the mutable hash set.
- elem
the element computation
- returns
A mutable hash set that contains the results of
n
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def from[B](it: IterableOnce[B]): HashSet[B]
Creates a target mutable hash set from an existing source collection
Creates a target mutable hash set from an existing source collection
- returns
a new mutable hash set with the elements of
source
- Definition Classes
- HashSet → IterableFactory
- implicit def iterableFactory[A]: Factory[A, HashSet[A]]
- Definition Classes
- IterableFactory
- def iterate[A](start: A, len: Int)(f: (A) => A): HashSet[A]
Produces a mutable hash set containing repeated applications of a function to a start value.
Produces a mutable hash set containing repeated applications of a function to a start value.
- start
the start value of the mutable hash set
- len
the number of elements contained in the mutable hash set
- f
the function that's repeatedly applied
- returns
a mutable hash set with
len
values in the sequencestart, f(start), f(f(start)), ...
- Definition Classes
- IterableFactory
- def newBuilder[A](initialCapacity: Int, loadFactor: Double): Builder[A, HashSet[A]]
- def newBuilder[A]: Builder[A, HashSet[A]]
- A
the type of the mutable hash set’s elements
- returns
A builder for
mutable.HashSet
objects.
- Definition Classes
- HashSet → IterableFactory
- def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): HashSet[A]
Produces a mutable hash set containing equally spaced values in some integer interval.
Produces a mutable hash set containing equally spaced values in some integer interval.
- start
the start value of the mutable hash set
- end
the end value of the mutable hash set (the first value NOT contained)
- step
the difference between successive elements of the mutable hash set (must be positive or negative)
- returns
a mutable hash set with values
start, start + step, ...
up to, but excludingend
- Definition Classes
- IterableFactory
- def range[A](start: A, end: A)(implicit arg0: Integral[A]): HashSet[A]
Produces a mutable hash set containing a sequence of increasing of integers.
Produces a mutable hash set containing a sequence of increasing of integers.
- start
the first element of the mutable hash set
- end
the end value of the mutable hash set (the first value NOT contained)
- returns
a mutable hash set with values
start, start + 1, ..., end - 1
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): HashSet[HashSet[HashSet[HashSet[HashSet[A]]]]]
Produces a five-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- n5
the number of elements in the 5th dimension
- f
The function computing element values
- returns
A mutable hash set consisting of elements
f(i1, i2, i3, i4, i5)
for0 <= i1 < n1
,0 <= i2 < n2
,0 <= i3 < n3
,0 <= i4 < n4
, and0 <= i5 < n5
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): HashSet[HashSet[HashSet[HashSet[A]]]]
Produces a four-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- f
The function computing element values
- returns
A mutable hash set consisting of elements
f(i1, i2, i3, i4)
for0 <= i1 < n1
,0 <= i2 < n2
,0 <= i3 < n3
, and0 <= i4 < n4
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): HashSet[HashSet[HashSet[A]]]
Produces a three-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- f
The function computing element values
- returns
A mutable hash set consisting of elements
f(i1, i2, i3)
for0 <= i1 < n1
,0 <= i2 < n2
, and0 <= i3 < n3
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): HashSet[HashSet[A]]
Produces a two-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional mutable hash set containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- f
The function computing element values
- returns
A mutable hash set consisting of elements
f(i1, i2)
for0 <= i1 < n1
and0 <= i2 < n2
.
- Definition Classes
- IterableFactory
- def tabulate[A](n: Int)(f: (Int) => A): HashSet[A]
Produces a mutable hash set containing values of a given function over a range of integer values starting from 0.
Produces a mutable hash set containing values of a given function over a range of integer values starting from 0.
- n
The number of elements in the mutable hash set
- f
The function computing element values
- returns
A mutable hash set consisting of elements
f(0), ..., f(n -1)
- Definition Classes
- IterableFactory
- def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): HashSet[A]
Produces a mutable hash set that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.Produces a mutable hash set that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.- A
Type of the elements
- S
Type of the internal state
- init
State initial value
- f
Computes the next element (or returns
None
to signal the end of the collection)- returns
a mutable hash set that produces elements using
f
untilf
returnsNone
- Definition Classes
- IterableFactory
This is the documentation for the Scala standard library.
Package structure
The scala package contains core types like
Int
,Float
,Array
orOption
which are accessible in all Scala compilation units without explicit qualification or imports.Notable packages include:
scala.collection
and its sub-packages contain Scala's collections frameworkscala.collection.immutable
- Immutable, sequential data-structures such asVector
,List
,Range
,HashMap
orHashSet
scala.collection.mutable
- Mutable, sequential data-structures such asArrayBuffer
,StringBuilder
,HashMap
orHashSet
scala.collection.concurrent
- Mutable, concurrent data-structures such asTrieMap
scala.concurrent
- Primitives for concurrent programming such asFutures
andPromises
scala.io
- Input and output operationsscala.math
- Basic math functions and additional numeric types likeBigInt
andBigDecimal
scala.sys
- Interaction with other processes and the operating systemscala.util.matching
- Regular expressionsOther packages exist. See the complete list on the right.
Additional parts of the standard library are shipped as separate libraries. These include:
scala.reflect
- Scala's reflection API (scala-reflect.jar)scala.xml
- XML parsing, manipulation, and serialization (scala-xml.jar)scala.collection.parallel
- Parallel collections (scala-parallel-collections.jar)scala.util.parsing
- Parser combinators (scala-parser-combinators.jar)scala.swing
- A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)Automatic imports
Identifiers in the scala package and the
scala.Predef
object are always in scope by default.Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example,
List
is an alias forscala.collection.immutable.List
.Other aliases refer to classes provided by the underlying platform. For example, on the JVM,
String
is an alias forjava.lang.String
.