Packages

object LinkedHashSet extends IterableFactory[LinkedHashSet]

This object provides a set of operations to create LinkedHashSet values.

Annotations
@SerialVersionUID()
Source
LinkedHashSet.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinkedHashSet
  2. IterableFactory
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. 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
  2. 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
  3. def empty[A]: LinkedHashSet[A]

    An empty collection

    An empty collection

    A

    the type of the linked hash set's elements

    Definition Classes
    LinkedHashSetIterableFactory
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
    LinkedHashSetIterableFactory
  10. implicit def iterableFactory[A]: Factory[A, LinkedHashSet[A]]
    Definition Classes
    IterableFactory
  11. 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
  12. 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
    LinkedHashSetIterableFactory
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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
  20. 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