Value Members

1.  final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

   true if !(this == that), false otherwise.

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Equivalent to x.hashCode except for boxed numeric types and null.

   Equivalent to x.hashCode except for boxed numeric types and null. 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. For null returns a hashcode where null.hashCode throws a NullPointerException.

   returns

   a hash value consistent with ==

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

   The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

   returns

   true if the receiver object is equivalent to the argument; false otherwise.

   Definition Classes

   AnyRef → Any

4.  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

5.  final def asInstanceOf[T0]: T0

   Forces the compiler to treat the receiver object as having type T0, even though doing so may violate type safety.

   Forces the compiler to treat the receiver object as having type T0, even though doing so may violate type safety.

   This method is useful when you believe you have type information the compiler doesn't, and it also isn't possible to check the type at runtime. In such situations, skipping type safety is the only option.

   It is platform dependent whether asInstanceOf has any effect at runtime. It might do a runtime type test on the erasure of T0, insert a conversion (such as boxing/unboxing), fill in a default value, or do nothing at all.

   In particular, asInstanceOf is not a type test. It does **not** mean:

   this match {
    case x: T0 => x
    case _     => throw ClassCastException("...")

   Use pattern matching or isInstanceOf for type testing instead.

   Situations where asInstanceOf is useful:

   • when flow analysis fails to deduce T0 automatically
   • when down-casting a type parameter or an abstract type member (which cannot be checked at runtime due to type erasure) If there is any doubt and you are able to type test instead, you should do so.

   Be careful of using asInstanceOf when T0 is a primitive type. When T0 is primitive, asInstanceOf may insert a conversion instead of a type test. If your intent is to convert, use a toT method (x.toChar, x.toByte, etc.).

   returns

   the receiver object.

   Definition Classes

   Any

   Exceptions thrown

   ClassCastException if the receiver is not an instance of the erasure of T0, if that can be checked on this platform

6.  def clone(): AnyRef

   Create a copy of the receiver object.

   Create a copy of the receiver object.

   The default implementation of the clone method is platform dependent.

   returns

   a copy of the receiver object.

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

   Note

   not specified by SLS as a member of AnyRef

7.  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

8.  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

9.  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 eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

   • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
   • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
   • null.eq(null) returns true.

   When overriding the equals or hashCode methods, 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

   true if the argument is a reference to the receiver object; false otherwise.

   Definition Classes

   AnyRef

10.  def equals(arg0: AnyRef): Boolean

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to eq.

    See also equals in scala.Any.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    Definition Classes

    AnyRef → Any

11.  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 of elem.

    Definition Classes

    IterableFactory

12.  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 of elem.

    Definition Classes

    IterableFactory

13.  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 of elem.

    Definition Classes

    IterableFactory

14.  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 of elem.

    Definition Classes

    IterableFactory

15.  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 of elem.

    Definition Classes

    IterableFactory

16.  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 finalize method is invoked, as well as the interaction between finalize and 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

17.  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

18.  final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

19.  def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

    the hash code value for this object.

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

20.  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 T0 is, the test is done in one of the below ways:

    • T0 is a non-parameterized class type, e.g. BigDecimal: this method returns true if the value of the receiver object is a BigDecimal or a subtype of BigDecimal.
    • T0 is a parameterized class type, e.g. List[Int]: this method returns true if the value of the receiver object is some List[X] for any X. For example, List(1, 2, 3).isInstanceOf[List[String]] will return true.
    • T0 is some singleton type x.type or literal x: this method returns this.eq(x). For example, x.isInstanceOf[1] is equivalent to x.eq(1)
    • T0 is an intersection X with Y or X & Y: this method is equivalent to x.isInstanceOf[X] && x.isInstanceOf[Y]
    • T0 is a union X | Y: this method is equivalent to x.isInstanceOf[X] || x.isInstanceOf[Y]
    • T0 is a type parameter or an abstract type member: this method is equivalent to isInstanceOf[U] where U is T0's upper bound, Any if T0 is unbounded. For example, x.isInstanceOf[A] where A is an unbounded type parameter will return true for any value of x.

    This is exactly equivalent to the type pattern _: T0

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Definition Classes

    Any

    Note

    due to the unexpectedness of List(1, 2, 3).isInstanceOf[List[String]] returning true and x.isInstanceOf[A] where A is a type parameter or abstract member returning true, these forms issue a warning.

21.  implicit def iterableFactory[A]: Factory[A, LinkedHashSet[A]]

    Definition Classes

    IterableFactory

22.  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 sequence start, f(start), f(f(start)), ...

    Definition Classes

    IterableFactory

23.  final def ne(arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

    Definition Classes

    AnyRef

24.  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

25.  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

26.  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

27.  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 excluding end

    Definition Classes

    IterableFactory

28.  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

29.  final def synchronized[T0](arg0: => T0): T0

    Executes the code in body with an exclusive lock on this.

    Executes the code in body with an exclusive lock on this.

    returns

    the result of body

    Definition Classes

    AnyRef

30.  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) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, 0 <= i4 < n4, and 0 <= i5 < n5.

    Definition Classes

    IterableFactory

31.  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) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, and 0 <= i4 < n4.

    Definition Classes

    IterableFactory

32.  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) for 0 <= i1 < n1, 0 <= i2 < n2, and 0 <= i3 < n3.

    Definition Classes

    IterableFactory

33.  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) for 0 <= i1 < n1 and 0 <= i2 < n2.

    Definition Classes

    IterableFactory

34.  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

35.  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

36.  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 type A and update an internal state of type S.

    Produces a linked hash set that uses a function f to produce elements of type A and update an internal state of type S.

    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 until f returns None

    Definition Classes

    IterableFactory

37.  final def wait(): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

    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

38.  final def wait(arg0: Long, arg1: Int): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

    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

39.  final def wait(arg0: Long): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()

    Note

    not specified by SLS as a member of AnyRef