object LinkedHashSet extends IterableFactory[LinkedHashSet]
This object provides a set of operations to create LinkedHashSet
values.
- Annotations
- @SerialVersionUID()
- Source
- LinkedHashSet.scala
- Alphabetic
- By Inheritance
- LinkedHashSet
- IterableFactory
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- def apply[A](elems: A*): LinkedHashSet[A]
Creates a linked hash set with the specified elements.
Creates a linked hash set with the specified elements.
- A
the type of the linked hash set's elements
- elems
the elements of the created linked hash set
- returns
a new linked hash set with elements
elems
- Definition Classes
- IterableFactory
- def concat[A](xss: collection.Iterable[A]*): LinkedHashSet[A]
Concatenates all argument collections into a single linked hash set.
Concatenates all argument collections into a single linked hash set.
- xss
the collections that are to be concatenated.
- returns
the concatenation of all the collections.
- Definition Classes
- IterableFactory
- def empty[A]: LinkedHashSet[A]
An empty collection
An empty collection
- A
the type of the linked hash set's elements
- Definition Classes
- LinkedHashSet → IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]]]
Produces a five-dimensional linked hash set containing the results of some element computation a number of times.
Produces a five-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]]
Produces a four-dimensional linked hash set containing the results of some element computation a number of times.
Produces a four-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]
Produces a three-dimensional linked hash set containing the results of some element computation a number of times.
Produces a three-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[A]]
Produces a two-dimensional linked hash set containing the results of some element computation a number of times.
Produces a two-dimensional linked 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 linked hash set that contains the results of
n1 x n2
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n: Int)(elem: => A): LinkedHashSet[A]
Produces a linked hash set containing the results of some element computation a number of times.
Produces a linked hash set containing the results of some element computation a number of times.
- n
the number of elements contained in the linked hash set.
- elem
the element computation
- returns
A linked hash set that contains the results of
n
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def from[E](it: IterableOnce[E]): LinkedHashSet[E]
Creates a target linked hash set from an existing source collection
Creates a target linked hash set from an existing source collection
- returns
a new linked hash set with the elements of
source
- Definition Classes
- LinkedHashSet → IterableFactory
- implicit def iterableFactory[A]: Factory[A, LinkedHashSet[A]]
- Definition Classes
- IterableFactory
- def iterate[A](start: A, len: Int)(f: (A) => A): LinkedHashSet[A]
Produces a linked hash set containing repeated applications of a function to a start value.
Produces a linked hash set containing repeated applications of a function to a start value.
- start
the start value of the linked hash set
- len
the number of elements contained in the linked hash set
- f
the function that's repeatedly applied
- returns
a linked hash set with
len
values in the sequencestart, f(start), f(f(start)), ...
- Definition Classes
- IterableFactory
- def newBuilder[A]: GrowableBuilder[A, LinkedHashSet[A]]
- A
the type of the linked hash set’s elements
- returns
A builder for
LinkedHashSet
objects.
- Definition Classes
- LinkedHashSet → IterableFactory
- def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): LinkedHashSet[A]
Produces a linked hash set containing equally spaced values in some integer interval.
Produces a linked hash set containing equally spaced values in some integer interval.
- start
the start value of the linked hash set
- end
the end value of the linked hash set (the first value NOT contained)
- step
the difference between successive elements of the linked hash set (must be positive or negative)
- returns
a linked 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]): LinkedHashSet[A]
Produces a linked hash set containing a sequence of increasing of integers.
Produces a linked hash set containing a sequence of increasing of integers.
- start
the first element of the linked hash set
- end
the end value of the linked hash set (the first value NOT contained)
- returns
a linked 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): LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]]]
Produces a five-dimensional linked hash set containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]]
Produces a four-dimensional linked hash set containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[LinkedHashSet[A]]]
Produces a three-dimensional linked hash set containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional linked 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 linked 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): LinkedHashSet[LinkedHashSet[A]]
Produces a two-dimensional linked hash set containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional linked 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 linked 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): LinkedHashSet[A]
Produces a linked hash set containing values of a given function over a range of integer values starting from 0.
Produces a linked hash set containing values of a given function over a range of integer values starting from 0.
- n
The number of elements in the linked hash set
- f
The function computing element values
- returns
A linked hash set consisting of elements
f(0), ..., f(n -1)
- Definition Classes
- IterableFactory
- def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): LinkedHashSet[A]
Produces a linked hash set that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.Produces a linked 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 linked 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
.