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
- final def !=(arg0: Any): Boolean
Test two objects for inequality.
Test two objects for inequality.
- returns
trueif !(this == that), false otherwise.
- Definition Classes
- AnyRef → Any
- final def ##: Int
Equivalent to
x.hashCodeexcept for boxed numeric types andnull.Equivalent to
x.hashCodeexcept for boxed numeric types andnull. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. Fornullreturns a hashcode wherenull.hashCodethrows aNullPointerException.- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
The expression
x == thatis equivalent toif (x eq null) that eq null else x.equals(that).The expression
x == thatis equivalent toif (x eq null) that eq null else x.equals(that).- returns
trueif the receiver object is equivalent to the argument;falseotherwise.
- Definition Classes
- AnyRef → Any
- 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
- final def asInstanceOf[T0]: T0
Cast the receiver object to be of type
T0.Cast the receiver object to be of type
T0.Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression
1.asInstanceOf[String]will throw aClassCastExceptionat runtime, while the expressionList(1).asInstanceOf[List[String]]will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.- returns
the receiver object.
- Definition Classes
- Any
- Exceptions thrown
ClassCastExceptionif the receiver object is not an instance of the erasure of typeT0.
- def clone(): AnyRef
Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the
clonemethod is platform dependent.- returns
a copy of the receiver object.
- 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
- final def eq(arg0: AnyRef): Boolean
Tests whether the argument (
that) is a reference to the receiver object (this).Tests whether the argument (
that) is a reference to the receiver object (this).The
eqmethod implements an equivalence relation on non-null instances ofAnyRef, and has three additional properties:- It is consistent: for any non-null instances
xandyof typeAnyRef, multiple invocations ofx.eq(y)consistently returnstrueor consistently returnsfalse. - For any non-null instance
xof typeAnyRef,x.eq(null)andnull.eq(x)returnsfalse. null.eq(null)returnstrue.
When overriding the
equalsorhashCodemethods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).- returns
trueif the argument is a reference to the receiver object;falseotherwise.
- Definition Classes
- AnyRef
- It is consistent: for any non-null instances
- def equals(arg0: AnyRef): Boolean
The equality method for reference types.
- 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 n5evaluations 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 n4evaluations 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 n3evaluations 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 n2evaluations 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
nevaluations ofelem.
- Definition Classes
- IterableFactory
- def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the
finalizemethod is invoked, as well as the interaction betweenfinalizeand non-local returns and exceptions, are all platform dependent.- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- Note
not specified by SLS as a member of AnyRef
- 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
- final def getClass(): Class[_ <: AnyRef]
Returns the runtime class representation of the object.
- def hashCode(): Int
The hashCode method for reference types.
- final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object has the same erasure as
T0.Test whether the dynamic type of the receiver object has the same erasure as
T0.Depending on what
T0is, the test is done in one of the below ways:T0is a non-parameterized class type, e.g.BigDecimal: this method returnstrueif the value of the receiver object is aBigDecimalor a subtype ofBigDecimal.T0is a parameterized class type, e.g.List[Int]: this method returnstrueif the value of the receiver object is someList[X]for anyX. For example,List(1, 2, 3).isInstanceOf[List[String]]will return true.T0is some singleton typex.typeor literalx: this method returnsthis.eq(x). For example,x.isInstanceOf[1]is equivalent tox.eq(1)T0is an intersectionX with YorX & Y: this method is equivalent tox.isInstanceOf[X] && x.isInstanceOf[Y]T0is a unionX | Y: this method is equivalent tox.isInstanceOf[X] || x.isInstanceOf[Y]T0is a type parameter or an abstract type member: this method is equivalent toisInstanceOf[U]whereUisT0's upper bound,AnyifT0is unbounded. For example,x.isInstanceOf[A]whereAis an unbounded type parameter will return true for any value ofx.
This is exactly equivalent to the type pattern
_: T0- returns
trueif the receiver object is an instance of erasure of typeT0;falseotherwise.
- Definition Classes
- Any
- Note
due to the unexpectedness of
List(1, 2, 3).isInstanceOf[List[String]]returning true andx.isInstanceOf[A]whereAis a type parameter or abstract member returning true, these forms issue a warning.
- 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
lenvalues in the sequencestart, f(start), f(f(start)), ...
- Definition Classes
- IterableFactory
- final def ne(arg0: AnyRef): Boolean
Equivalent to
!(this eq that).Equivalent to
!(this eq that).- returns
trueif the argument is not a reference to the receiver object;falseotherwise.
- Definition Classes
- AnyRef
- def newBuilder[A]: GrowableBuilder[A, LinkedHashSet[A]]
- A
the type of the linked hash set’s elements
- returns
A builder for
LinkedHashSetobjects.
- Definition Classes
- LinkedHashSet → IterableFactory
- final def notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
- final def notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
- 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
- final def synchronized[T0](arg0: => T0): T0
Executes the code in
bodywith an exclusive lock onthis.Executes the code in
bodywith an exclusive lock onthis.- returns
the result of
body
- Definition Classes
- AnyRef
- 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 < n1and0 <= 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 toString(): String
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
- returns
a String representation of the object.
- Definition Classes
- AnyRef → Any
- def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): LinkedHashSet[A]
Produces a linked hash set that uses a function
fto produce elements of typeAand update an internal state of typeS.Produces a linked hash set that uses a function
fto produce elements of typeAand 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
Noneto signal the end of the collection)- returns
a linked hash set that produces elements using
funtilfreturnsNone
- Definition Classes
- IterableFactory
- final def wait(): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long, arg1: Int): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.
This is the documentation for the Scala standard library.
Package structure
The scala package contains core types like
Int,Float,ArrayorOptionwhich are accessible in all Scala compilation units without explicit qualification or imports.Notable packages include:
scala.collectionand its sub-packages contain Scala's collections frameworkscala.collection.immutable- Immutable, sequential data-structures such asVector,List,Range,HashMaporHashSetscala.collection.mutable- Mutable, sequential data-structures such asArrayBuffer,StringBuilder,HashMaporHashSetscala.collection.concurrent- Mutable, concurrent data-structures such asTrieMapscala.concurrent- Primitives for concurrent programming such asFuturesandPromisesscala.io- Input and output operationsscala.math- Basic math functions and additional numeric types likeBigIntandBigDecimalscala.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.Predefobject are always in scope by default.Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example,
Listis an alias forscala.collection.immutable.List.Other aliases refer to classes provided by the underlying platform. For example, on the JVM,
Stringis an alias forjava.lang.String.