scala.collection.mutable

LinkedHashSet

class LinkedHashSet[A] extends AbstractSet[A] with Set[A] with GenericSetTemplate[A, LinkedHashSet] with SetLike[A, LinkedHashSet[A]] with HashTable[A, Entry[A]] with Serializable

This class implements mutable sets using a hashtable. The iterator and all traversal methods of this class visit elements in the order they were inserted.

A

the type of the elements contained in this set.

Annotations
@SerialVersionUID( uid = 1L )
Source
LinkedHashSet.scala
Version

2.0, 31/12/2006

Since

1

Linear Supertypes
Serializable, java.io.Serializable, HashTable[A, LinkedHashSet.Entry[A]], HashUtils[A], AbstractSet[A], Set[A], SetLike[A, LinkedHashSet[A]], Cloneable[Set[A]], scala.Cloneable, java.lang.Cloneable, Shrinkable[A], Builder[A, LinkedHashSet[A]], Growable[A], Clearable, Scriptable[A], collection.Set[A], collection.SetLike[A, LinkedHashSet[A]], Subtractable[A, LinkedHashSet[A]], GenSet[A], GenericSetTemplate[A, LinkedHashSet], GenSetLike[A, LinkedHashSet[A]], (A) ⇒ Boolean, AbstractIterable[A], Iterable[A], Traversable[A], Mutable, collection.AbstractIterable[A], collection.Iterable[A], IterableLike[A, LinkedHashSet[A]], Equals, GenIterable[A], GenIterableLike[A, LinkedHashSet[A]], AbstractTraversable[A], collection.Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, LinkedHashSet], TraversableLike[A, LinkedHashSet[A]], GenTraversableLike[A, LinkedHashSet[A]], Parallelizable[A, ParSet[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, LinkedHashSet[A]], HasNewBuilder[A, scala.collection.mutable.LinkedHashSet[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LinkedHashSet
  2. Serializable
  3. Serializable
  4. HashTable
  5. HashUtils
  6. AbstractSet
  7. Set
  8. SetLike
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Builder
  14. Growable
  15. Clearable
  16. Scriptable
  17. Set
  18. SetLike
  19. Subtractable
  20. GenSet
  21. GenericSetTemplate
  22. GenSetLike
  23. Function1
  24. AbstractIterable
  25. Iterable
  26. Traversable
  27. Mutable
  28. AbstractIterable
  29. Iterable
  30. IterableLike
  31. Equals
  32. GenIterable
  33. GenIterableLike
  34. AbstractTraversable
  35. Traversable
  36. GenTraversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. GenTraversableLike
  40. Parallelizable
  41. TraversableOnce
  42. GenTraversableOnce
  43. FilterMonadic
  44. HasNewBuilder
  45. AnyRef
  46. Any
Implicitly
  1. by traversable2ops
  2. by MonadOps
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  7. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LinkedHashSet()

Type Members

  1. type Entry = LinkedHashSet.Entry[A]

  2. type Self = LinkedHashSet[A]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    Any
  3. 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
  4. def &(that: GenSet[A]): LinkedHashSet[A]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    Note: Same as intersect.

    that

    the set to intersect with.

    returns

    a new set consisting of all elements that are both in this set and in the given set that.

    Definition Classes
    GenSetLike
  5. def &~(that: GenSet[A]): LinkedHashSet[A]

    The difference of this set and another set.

    The difference of this set and another set.

    Note: Same as diff.

    that

    the set of elements to exclude.

    returns

    a set containing those elements of this set that are not also contained in the given set that.

    Definition Classes
    GenSetLike
  6. def +(elem1: A, elem2: A, elems: A*): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set and two or more specified elements.

    Creates a new set consisting of all the elements of this set and two or more specified elements.

    Note that duplicates (elements for which equals yields true) will be removed, but it is not specified whether it will be an element of this set or a newly added element.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new set consisting of all the elements of this set, elem1, elem2 and those in elems.

    Definition Classes
    SetLikeSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def +(elem: A): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set and elem.

    Creates a new set consisting of all the elements of this set and elem.

    Note that duplicates (elements for which equals yields true) will be removed, but it is not specified whether it will be an element of this set or a newly added element.

    elem

    the element to add.

    returns

    a new set consisting of elements of this set and elem.

    Definition Classes
    SetLikeSetLikeGenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  8. def ++(xs: GenTraversableOnce[A]): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set and those provided by the specified traversable object.

    Creates a new set consisting of all the elements of this set and those provided by the specified traversable object.

    Note that duplicates (elements for which equals yields true) will be removed, but it is not specified whether it will be an element of this set or a newly added element.

    xs

    the traversable object.

    returns

    a new set consisting of elements of this set and those in xs.

    Definition Classes
    SetLikeSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

  9. def ++[B](that: GenTraversableOnce[B]): LinkedHashSet[B]

    [use case] Returns a new linked hash set containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new linked hash set containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the linked hash set is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new linked hash set which contains all elements of this linked hash set followed by all elements of that.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

  10. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedHashSet[B] because an implicit of type CanBuildFrom[LinkedHashSet, B, LinkedHashSet[B]] is defined in object LinkedHashSet.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object LinkedHashSet.

    returns

    a new collection of type That which contains all elements of this linked hash set followed by all elements of that.

    Definition Classes
    TraversableLike
  11. def ++:[B](that: TraversableOnce[B]): LinkedHashSet[B]

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new linked hash set which contains all elements of this linked hash set followed by all elements of that.

    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

  12. def ++=(xs: TraversableOnce[A]): LinkedHashSet.this.type

    adds all elements produced by a TraversableOnce to this linked hash set.

    adds all elements produced by a TraversableOnce to this linked hash set.

    xs

    the TraversableOnce producing the elements to add.

    returns

    the linked hash set itself.

    Definition Classes
    Growable
  13. def +=(elem: A): LinkedHashSet.this.type

    Adds a single element to the set.

    Adds a single element to the set.

    elem

    the element to be added.

    returns

    the builder itself.

    Definition Classes
    LinkedHashSetSetLikeBuilderGrowable
  14. def +=(elem1: A, elem2: A, elems: A*): LinkedHashSet.this.type

    adds two or more elements to this linked hash set.

    adds two or more elements to this linked hash set.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the linked hash set itself

    Definition Classes
    Growable
  15. def -(elem1: A, elem2: A, elems: A*): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set except the two or more specified elements.

    Creates a new set consisting of all the elements of this set except the two or more specified elements.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new set consisting of all the elements of this set except elem1, elem2 and elems.

    Definition Classes
    SetLikeSubtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  16. def -(elem: A): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set except elem.

    Creates a new set consisting of all the elements of this set except elem.

    elem

    the element to remove.

    returns

    a new set consisting of all the elements of this set except elem.

    Definition Classes
    SetLikeSetLikeSubtractableGenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  17. def --(xs: GenTraversableOnce[A]): LinkedHashSet[A]

    Creates a new set consisting of all the elements of this set except those provided by the specified traversable object.

    Creates a new set consisting of all the elements of this set except those provided by the specified traversable object.

    xs

    the traversable object.

    returns

    a new set consisting of all the elements of this set except elements from xs.

    Definition Classes
    SetLikeSubtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

  18. def --=(xs: TraversableOnce[A]): LinkedHashSet.this.type

    Removes all elements produced by an iterator from this linked hash set.

    Removes all elements produced by an iterator from this linked hash set.

    xs

    the iterator producing the elements to remove.

    returns

    the linked hash set itself

    Definition Classes
    Shrinkable
  19. def -=(elem: A): LinkedHashSet.this.type

    Removes a single element from this linked hash set.

    Removes a single element from this linked hash set.

    elem

    the element to remove.

    returns

    the linked hash set itself

    Definition Classes
    LinkedHashSetSetLikeShrinkable
  20. def -=(elem1: A, elem2: A, elems: A*): LinkedHashSet.this.type

    Removes two or more elements from this linked hash set.

    Removes two or more elements from this linked hash set.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the linked hash set itself

    Definition Classes
    Shrinkable
  21. def ->[B](y: B): (LinkedHashSet[A], B)

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to ArrowAssoc[LinkedHashSet[A]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  22. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this linked hash set, going left to right.

    Applies a binary operator to a start value and all elements of this linked hash set, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (5 /: a)(_+_)
    b: Int = 15
    
    scala> val c = (5 /: a)((x,y) => x + y)
    c: Int = 15
    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash set, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  23. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this linked hash set and a start value, going right to left.

    Applies a binary operator to all elements of this linked hash set and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a :\ 5)(_+_)
    b: Int = 15
    
    scala> val c = (a :\ 5)((x,y) => x + y)
    c: Int = 15
    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this linked hash set, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  24. def <<(cmd: Message[A]): Unit

    Send a message to this scriptable object.

    Send a message to this scriptable object.

    cmd

    the message to send.

    Definition Classes
    SetLikeScriptable
    Exceptions thrown
    `Predef.UnsupportedOperationException`

    if the message was not understood.

  25. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. 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
    Any
  27. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable
  28. def add(elem: A): Boolean

    Adds an element to this linked hash set.

    Adds an element to this linked hash set.

    elem

    the element to be added

    returns

    true if the element was not yet present in the set, false otherwise.

    Definition Classes
    LinkedHashSetSetLike
  29. def addEntry(e: LinkedHashSet.Entry[A]): Unit

    Add entry to table pre: no entry with same key exists

    Add entry to table pre: no entry with same key exists

    Attributes
    protected
    Definition Classes
    HashTable
  30. def addString(b: scala.StringBuilder): scala.StringBuilder

    Appends all elements of this linked hash set to a string builder.

    Appends all elements of this linked hash set to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this linked hash set without any separator string.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    b: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  31. def addString(b: scala.StringBuilder, sep: String): scala.StringBuilder

    Appends all elements of this linked hash set to a string builder using a separator string.

    Appends all elements of this linked hash set to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this linked hash set, separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  32. def addString(b: scala.StringBuilder, start: String, sep: String, end: String): scala.StringBuilder

    Appends all elements of this linked hash set to a string builder using start, end, and separator strings.

    Appends all elements of this linked hash set to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this linked hash set are separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, "LinkedList(", ", ", ")")
    res1: StringBuilder = LinkedList(1, 2, 3, 4)
    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  33. def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

    pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    B

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  34. def alwaysInitSizeMap: Boolean

    Attributes
    protected
    Definition Classes
    HashTable
  35. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

    Composes two instances of Function1 in a new Function1, with this function applied first.

    Composes two instances of Function1 in a new Function1, with this function applied first.

    A

    the result type of function g

    g

    a function R => A

    returns

    a new function f such that f(x) == g(apply(x))

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. def apply(elem: A): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

    This method is equivalent to contains. It allows sets to be interpreted as predicates.

    elem

    the element to test for membership.

    returns

    true if elem is contained in this set, false otherwise.

    Definition Classes
    GenSetLikeFunction1
  37. 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 a ClassCastException at runtime, while the expression List(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
    ClassCastException

    if the receiver object is not an instance of the erasure of type T0.

  38. def asParIterable: ParIterable[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  39. def asParSeq: ParSeq[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  40. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable
  41. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this linked hash set should be compared

    returns

    true, if this linked hash set can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  42. def clear(): Unit

    Removes all elements from the set.

    Removes all elements from the set. After this operation is completed, the set will be empty.

    Definition Classes
    LinkedHashSetSetLikeBuilderGrowableClearable
  43. def clearTable(): Unit

    Remove all entries from table

    Remove all entries from table

    Attributes
    protected
    Definition Classes
    HashTable
  44. def clone(): LinkedHashSet[A]

    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.

    Definition Classes
    SetLikeCloneable → AnyRef
    Note

    not specified by SLS as a member of AnyRef

  45. def collect[B](pf: PartialFunction[A, B]): LinkedHashSet[B]

    [use case] Builds a new collection by applying a partial function to all elements of this linked hash set on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this linked hash set on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the linked hash set.

    returns

    a new linked hash set resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

  46. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

    Finds the first element of the linked hash set for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the linked hash set for which the given partial function is defined, and applies the partial function to it.

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  47. def companion: GenericCompanion[LinkedHashSet]

    The factory companion object that builds instances of class LinkedHashSet.

    The factory companion object that builds instances of class LinkedHashSet. (or its Iterable superclass where class LinkedHashSet is not a Seq.)

    Definition Classes
    LinkedHashSetSetSetGenSetIterableTraversableIterableGenIterableTraversableGenTraversableGenericTraversableTemplate
  48. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

    a new function f such that f(x) == apply(g(x))

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  49. def contains(elem: A): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

    elem

    the element to test for membership.

    returns

    true if elem is contained in this set, false otherwise.

    Definition Classes
    LinkedHashSetSetLikeGenSetLike
  50. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [use case] Copies elements of this linked hash set to an array.

    [use case]

    Copies elements of this linked hash set to an array. Fills the given array xs with at most len elements of this linked hash set, starting at position start. Copying will stop once either the end of the current linked hash set is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

  51. def copyToArray(xs: Array[A]): Unit

    [use case] Copies values of this linked hash set to an array.

    [use case]

    Copies values of this linked hash set to an array. Fills the given array xs with values of this linked hash set. Copying will stop once either the end of the current linked hash set is reached, or the end of the array is reached.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B]): Unit

  52. def copyToArray(xs: Array[A], start: Int): Unit

    [use case] Copies values of this linked hash set to an array.

    [use case]

    Copies values of this linked hash set to an array. Fills the given array xs with values of this linked hash set, beginning at index start. Copying will stop once either the end of the current linked hash set is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int): Unit

  53. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this linked hash set to a buffer.

    Copies all elements of this linked hash set to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  54. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the linked hash set which satisfy a predicate.

    Counts the number of elements in the linked hash set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  55. def createNewEntry[B](key: A, dummy: B): Entry

    Creates new entry to be immediately inserted into the hashtable.

    Creates new entry to be immediately inserted into the hashtable. This method is guaranteed to be called only once and in case that the entry will be added. In other words, an implementation may be side-effecting.

    Attributes
    protected
    Definition Classes
    LinkedHashSetHashTable
  56. def diff(that: GenSet[A]): LinkedHashSet[A]

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

    a set containing those elements of this set that are not also contained in the given set that.

    Definition Classes
    SetLikeGenSetLike
  57. def drop(n: Int): LinkedHashSet[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this linked hash set.

    returns

    a linked hash set consisting of all elements of this linked hash set except the first n ones, or else the empty linked hash set, if this linked hash set has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  58. def dropRight(n: Int): LinkedHashSet[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a linked hash set consisting of all elements of this linked hash set except the last n ones, or else the empty linked hash set, if this linked hash set has less than n elements.

    Definition Classes
    IterableLike
  59. def dropWhile(p: (A) ⇒ Boolean): LinkedHashSet[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this linked hash set whose first element does not satisfy the predicate p.

    Definition Classes
    TraversableLikeGenTraversableLike
  60. def elemEquals(key1: A, key2: A): Boolean

    Attributes
    protected
    Definition Classes
    HashTable
  61. def elemHashCode(key: A): Int

    Attributes
    protected
    Definition Classes
    HashUtils
  62. def empty: LinkedHashSet[A]

    Definition Classes
    GenericSetTemplate
  63. def ensuring(cond: (LinkedHashSet[A]) ⇒ Boolean, msg: ⇒ Any): LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  64. def ensuring(cond: (LinkedHashSet[A]) ⇒ Boolean): LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  65. def ensuring(cond: Boolean, msg: ⇒ Any): LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  66. def ensuring(cond: Boolean): LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  67. def entriesIterator: Iterator[LinkedHashSet.Entry[A]]

    An iterator returning all entries.

    An iterator returning all entries.

    Attributes
    protected
    Definition Classes
    HashTable
  68. final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) 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
  69. def equals(that: Any): Boolean

    Compares this set with another object for equality.

    Compares this set with another object for equality.

    Note: This operation contains an unchecked cast: if that is a set, it will assume with an unchecked cast that it has the same element type as this set. Any subsequent ClassCastException is treated as a false result.

    that

    the other object

    returns

    true if that is a set which contains the same elements as this set.

    Definition Classes
    GenSetLikeEquals → AnyRef → Any
  70. def exists(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this linked hash set.

    Tests whether a predicate holds for some of the elements of this linked hash set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this linked hash set, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  71. def filter(p: (A) ⇒ Boolean): LinkedHashSet[A]

    Selects all elements of this linked hash set which satisfy a predicate.

    Selects all elements of this linked hash set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new linked hash set consisting of all elements of this linked hash set that satisfy the given predicate p. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
  72. def filterNot(p: (A) ⇒ Boolean): LinkedHashSet[A]

    Selects all elements of this linked hash set which do not satisfy a predicate.

    Selects all elements of this linked hash set which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new linked hash set consisting of all elements of this linked hash set that do not satisfy the given predicate p. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
  73. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
    Note

    not specified by SLS as a member of AnyRef

  74. def find(p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the linked hash set satisfying a predicate, if any.

    Finds the first element of the linked hash set satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the linked hash set that satisfies p, or None if none exists.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  75. def findEntry(key: A): LinkedHashSet.Entry[A]

    Find entry with given key in table, null if not found.

    Find entry with given key in table, null if not found.

    Attributes
    protected
    Definition Classes
    HashTable
  76. def findOrAddEntry[B](key: A, value: B): LinkedHashSet.Entry[A]

    Find entry with given key in table, or add new one if not found.

    Find entry with given key in table, or add new one if not found. May be somewhat faster then findEntry/addEntry pair as it computes entry's hash index only once. Returns entry found in table or null. New entries are created by calling createNewEntry method.

    Attributes
    protected
    Definition Classes
    HashTable
  77. var firstEntry: Entry

    Attributes
    protected
  78. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): LinkedHashSet[B]

    [use case] Builds a new collection by applying a function to all elements of this linked hash set and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this linked hash set and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of linked hash set. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be a an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new linked hash set resulting from applying the given collection-valued function f to each element of this linked hash set and concatenating the results.

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

  79. def flatten[B]: LinkedHashSet[B]

    [use case] Converts this linked hash set of traversable collections into a linked hash set formed by the elements of these traversable collections.

    [use case]

    Converts this linked hash set of traversable collections into a linked hash set formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of linked hash set. For example:

    val xs = List(Set(1, 2, 3), Set(1, 2, 3))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new linked hash set resulting from concatenating all element linked hash sets.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LinkedHashSet[B]

  80. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this linked hash set using the specified associative binary operator.

    Folds the elements of this linked hash set using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    a type parameter for the binary operator, a supertype of A.

    z

    a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  81. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this linked hash set, going left to right.

    Applies a binary operator to a start value and all elements of this linked hash set, going left to right.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash set, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  82. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this linked hash set and a start value, going right to left.

    Applies a binary operator to all elements of this linked hash set and a start value, going right to left.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash set, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this linked hash set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  83. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this linked hash set.

    Tests whether a predicate holds for all elements of this linked hash set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this linked hash set, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  84. def foreach(f: (A) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this linked hash set.

    [use case]

    Applies a function f to all elements of this linked hash set.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Definition Classes
    LinkedHashSetIterableLikeGenericTraversableTemplateTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
    Full Signature

    def foreach[U](f: (A) ⇒ U): Unit

  85. def foreachEntry[U](f: (Entry) ⇒ U): Unit

    Avoid iterator for a 2x faster traversal.

    Avoid iterator for a 2x faster traversal.

    Attributes
    protected
    Definition Classes
    LinkedHashSetHashTable
  86. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  87. def genericBuilder[B]: Builder[B, LinkedHashSet[B]]

    The generic builder that builds instances of LinkedHashSet at arbitrary element types.

    The generic builder that builds instances of LinkedHashSet at arbitrary element types.

    Definition Classes
    GenericTraversableTemplate
  88. final def getClass(): Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  89. def groupBy[K](f: (A) ⇒ K): immutable.Map[K, LinkedHashSet[A]]

    Partitions this linked hash set into a map of linked hash sets according to some discriminator function.

    Partitions this linked hash set into a map of linked hash sets according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new linked hash set.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to linked hash sets such that the following invariant holds:

    (xs partition f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a linked hash set of those elements x for which f(x) equals k.

    Definition Classes
    TraversableLikeGenTraversableLike
  90. def grouped(size: Int): Iterator[LinkedHashSet[A]]

    Partitions elements in fixed size linked hash sets.

    Partitions elements in fixed size linked hash sets.

    size

    the number of elements per group

    returns

    An iterator producing linked hash sets of size size, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method grouped

  91. def hasDefiniteSize: Boolean

    Tests whether this linked hash set is known to have a finite size.

    Tests whether this linked hash set is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  92. 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
    GenSetLike → AnyRef → Any
  93. def head: A

    Selects the first element of this linked hash set.

    Selects the first element of this linked hash set.

    returns

    the first element of this linked hash set.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the linked hash set is empty.

  94. def headOption: Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this linked hash set if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLikeGenTraversableLike
  95. def ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  96. final def improve(hcode: Int, seed: Int): Int

    Attributes
    protected
    Definition Classes
    HashUtils
  97. final def index(hcode: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable
  98. def init: LinkedHashSet[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a linked hash set consisting of all elements of this linked hash set except the last one.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the linked hash set is empty.

  99. def initWithContents(c: Contents[A, LinkedHashSet.Entry[A]]): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  100. def initialSize: Int

    The initial size of the hash table.

    The initial size of the hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  101. def inits: Iterator[LinkedHashSet[A]]

    Iterates over the inits of this linked hash set.

    Iterates over the inits of this linked hash set. The first value will be this linked hash set and the final one will be an empty linked hash set, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this linked hash set

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  102. def intersect(that: GenSet[A]): LinkedHashSet[A]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

    a new set consisting of all elements that are both in this set and in the given set that.

    Definition Classes
    GenSetLike
  103. def isEmpty: Boolean

    Tests if this set is empty.

    Tests if this set is empty.

    returns

    true if there is no element in the set, false otherwise.

    Definition Classes
    SetLikeIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  104. final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. 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 specified type.

    returns

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

    Definition Classes
    Any
  105. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  106. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  107. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  108. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable
  109. final def isTraversableAgain: Boolean

    Tests whether this linked hash set can be repeatedly traversed.

    Tests whether this linked hash set can be repeatedly traversed.

    returns

    true

    Definition Classes
    TraversableLikeGenTraversableLikeGenTraversableOnce
  110. def iterator: Iterator[A]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    Definition Classes
    LinkedHashSetGenSetLikeIterableLikeGenIterableLike
  111. def last: A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this linked hash set.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the linked hash set is empty.

  112. var lastEntry: Entry

    Attributes
    protected
  113. def lastOption: Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this linked hash set$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLikeGenTraversableLike
  114. def map[B](f: (A) ⇒ B): LinkedHashSet[B]

    [use case] Builds a new collection by applying a function to all elements of this linked hash set.

    [use case]

    Builds a new collection by applying a function to all elements of this linked hash set.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new linked hash set resulting from applying the given function f to each element of this linked hash set and collecting the results.

    Definition Classes
    SetLikeTraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

  115. def mapResult[NewTo](f: (LinkedHashSet[A]) ⇒ NewTo): Builder[A, NewTo]

    Creates a new builder by applying a transformation function to the results of this builder.

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    Definition Classes
    Builder
  116. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def max[B >: A](implicit cmp: Ordering[B]): A

  117. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  118. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this linked hash set

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def min[B >: A](implicit cmp: Ordering[B]): A

  119. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  120. def mkString: String

    Displays all elements of this linked hash set in a string.

    Displays all elements of this linked hash set in a string.

    returns

    a string representation of this linked hash set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this linked hash set follow each other without any separator string.

    Definition Classes
    TraversableOnceGenTraversableOnce
  121. def mkString(sep: String): String

    Displays all elements of this linked hash set in a string using a separator string.

    Displays all elements of this linked hash set in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this linked hash set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this linked hash set are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  122. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this linked hash set in a string using start, end, and separator strings.

    Displays all elements of this linked hash set in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this linked hash set. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this linked hash set are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  123. 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
  124. def newBuilder: Builder[A, LinkedHashSet[A]]

    A common implementation of newBuilder for all mutable sets in terms of empty.

    A common implementation of newBuilder for all mutable sets in terms of empty. Overrides the implementation in collection.SetLike for better efficiency.

    Attributes
    protected[this]
    Definition Classes
    SetLikeSetLikeTraversableLikeHasNewBuilder
  125. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  126. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  127. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  128. def nonEmpty: Boolean

    Tests whether the linked hash set is not empty.

    Tests whether the linked hash set is not empty.

    returns

    true if the linked hash set contains at least one element, false otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  129. 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
    Note

    not specified by SLS as a member of AnyRef

  130. 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
    Note

    not specified by SLS as a member of AnyRef

  131. def par: ParSet[A]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  132. def parCombiner: Combiner[A, ParSet[A]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SetLikeSetLikeTraversableLikeParallelizable
  133. def partition(p: (A) ⇒ Boolean): (LinkedHashSet[A], LinkedHashSet[A])

    Partitions this linked hash set in two linked hash sets according to a predicate.

    Partitions this linked hash set in two linked hash sets according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of linked hash sets: the first linked hash set consists of all elements that satisfy the predicate p and the second linked hash set consists of all elements that don't. The relative order of the elements in the resulting linked hash sets is the same as in the original linked hash set.

    Definition Classes
    TraversableLikeGenTraversableLike
  134. def product: A

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this linked hash set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the linked hash set and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def product[B >: A](implicit num: Numeric[B]): B

  135. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this linked hash set using the specified associative binary operator.

    Reduces the elements of this linked hash set using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the linked hash set is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this linked hash set is empty.

  136. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce
  137. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this linked hash set, going left to right.

    Optionally applies a binary operator to all elements of this linked hash set, going left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this linked hash set is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  138. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

    Reduces the elements of this linked hash set, if any, using the specified associative binary operator.

    Reduces the elements of this linked hash set, if any, using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  139. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this linked hash set, going right to left.

    Applies a binary operator to all elements of this linked hash set, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash set, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this linked hash set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this linked hash set is empty.

  140. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this linked hash set, going right to left.

    Optionally applies a binary operator to all elements of this linked hash set, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this linked hash set is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  141. def remove(elem: A): Boolean

    Removes an element from this set.

    Removes an element from this set.

    elem

    The element to be removed.

    returns

    true if the element was previously present in the set, false otherwise.

    Definition Classes
    LinkedHashSetSetLike
  142. def removeEntry(key: A): LinkedHashSet.Entry[A]

    Remove entry from table if present.

    Remove entry from table if present.

    Attributes
    protected
    Definition Classes
    HashTable
  143. def repr: LinkedHashSet[A]

    The collection of type linked hash set underlying this TraversableLike object.

    The collection of type linked hash set underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLikeGenTraversableLike
  144. def result(): LinkedHashSet[A]

    The result when this set is used as a builder

    The result when this set is used as a builder

    returns

    the set representation itself.

    Definition Classes
    SetLikeBuilder
  145. def retain(p: (A) ⇒ Boolean): Unit

    Removes all elements from the set for which do not satisfy a predicate.

    Removes all elements from the set for which do not satisfy a predicate.

    p

    the predicate used to test elements. Only elements for which p returns true are retained in the set; all others are removed.

    Definition Classes
    SetLike
  146. def reversed: List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  147. def sameElements(that: GenIterable[A]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this linked hash set.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this linked hash set.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def sameElements[B >: A](that: GenIterable[B]): Boolean

  148. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LinkedHashSet[A], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new linked hash set containing the prefix scan of the elements in this linked hash set

    Definition Classes
    TraversableLikeGenTraversableLike
  149. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

    Produces a collection containing cumulative results of applying the operator going left to right.

    Produces a collection containing cumulative results of applying the operator going left to right.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object LinkedHashSet.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  150. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]): That

    Produces a collection containing cumulative results of applying the operator going right to left.

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

    Example:

    List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object LinkedHashSet.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  151. var seedvalue: Int

    Attributes
    protected
    Definition Classes
    HashTable
  152. def seq: Set[A]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    SetSetGenSetGenSetLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  153. def size: Int

    The size of this linked hash set.

    The size of this linked hash set.

    returns

    the number of elements in this linked hash set.

    Definition Classes
    LinkedHashSetGenTraversableLikeTraversableOnceGenTraversableOnce
  154. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    Definition Classes
    Builder
  155. def sizeHint(coll: TraversableLike[_, _]): Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    Definition Classes
    Builder
  156. def sizeHint(size: Int): Unit

    Gives a hint how many elements are expected to be added when the next result is called.

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    Definition Classes
    Builder
  157. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    Definition Classes
    Builder
  158. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils
  159. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils
  160. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  161. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  162. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  163. var sizemap: Array[Int]

    The array keeping track of the number of elements in 32 element blocks.

    The array keeping track of the number of elements in 32 element blocks.

    Attributes
    protected
    Definition Classes
    HashTable
  164. def slice(from: Int, until: Int): LinkedHashSet[A]

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

    from <= indexOf(x) < until
    returns

    a linked hash set containing the elements greater than or equal to index from extending up to (but not including) index until of this linked hash set.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  165. def sliding(size: Int, step: Int): Iterator[LinkedHashSet[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups (defaults to 1)

    returns

    An iterator producing linked hash sets of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method sliding

  166. def sliding(size: Int): Iterator[LinkedHashSet[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing linked hash sets of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method sliding

  167. def span(p: (A) ⇒ Boolean): (LinkedHashSet[A], LinkedHashSet[A])

    Splits this linked hash set into a prefix/suffix pair according to a predicate.

    Splits this linked hash set into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    returns

    a pair consisting of the longest prefix of this linked hash set whose elements all satisfy p, and the rest of this linked hash set.

    Definition Classes
    TraversableLikeGenTraversableLike
  168. def splitAt(n: Int): (LinkedHashSet[A], LinkedHashSet[A])

    Splits this linked hash set into two at a given position.

    Splits this linked hash set into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of linked hash sets consisting of the first n elements of this linked hash set, and the other elements.

    Definition Classes
    TraversableLikeGenTraversableLike
  169. def stringPrefix: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this set. Unless overridden this is simply "Set".

    Definition Classes
    SetLikeTraversableLikeGenTraversableLike
  170. def subsetOf(that: GenSet[A]): Boolean

    Tests whether this set is a subset of another set.

    Tests whether this set is a subset of another set.

    that

    the set to test.

    returns

    true if this set is a subset of that, i.e. if every element of this set is also an element of that.

    Definition Classes
    GenSetLike
  171. def subsets: Iterator[LinkedHashSet[A]]

    An iterator over all subsets of this set.

    An iterator over all subsets of this set.

    returns

    the iterator.

    Definition Classes
    SetLike
  172. def subsets(len: Int): Iterator[LinkedHashSet[A]]

    An iterator over all subsets of this set of the given size.

    An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.

    len

    the size of the subsets.

    returns

    the iterator.

    Definition Classes
    SetLike
  173. def sum: A

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this linked hash set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the linked hash set and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def sum[B >: A](implicit num: Numeric[B]): B

  174. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  175. var table: Array[HashEntry[A, LinkedHashSet.Entry[A]]]

    The actual hash table.

    The actual hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  176. var tableSize: Int

    The number of mappings contained in this hash table.

    The number of mappings contained in this hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  177. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable
  178. def tail: LinkedHashSet[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a linked hash set consisting of all elements of this linked hash set except the first one.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the linked hash set is empty.

  179. def tails: Iterator[LinkedHashSet[A]]

    Iterates over the tails of this linked hash set.

    Iterates over the tails of this linked hash set. The first value will be this linked hash set and the final one will be an empty linked hash set, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this linked hash set

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  180. def take(n: Int): LinkedHashSet[A]

    Selects first n elements.

    Selects first n elements.

    n

    the number of elements to take from this linked hash set.

    returns

    a linked hash set consisting only of the first n elements of this linked hash set, or else the whole linked hash set, if it has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  181. def takeRight(n: Int): LinkedHashSet[A]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a linked hash set consisting only of the last n elements of this linked hash set, or else the whole linked hash set, if it has less than n elements.

    Definition Classes
    IterableLike
  182. def takeWhile(p: (A) ⇒ Boolean): LinkedHashSet[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    returns

    the longest prefix of this linked hash set whose elements all satisfy the predicate p.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  183. def thisCollection: collection.Iterable[A]

    The underlying collection seen as an instance of LinkedHashSet.

    The underlying collection seen as an instance of LinkedHashSet. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  184. var threshold: Int

    The next size value at which to resize (capacity * load factor).

    The next size value at which to resize (capacity * load factor).

    Attributes
    protected
    Definition Classes
    HashTable
  185. def to[Col[_]]: Col[A]

    [use case] Converts this linked hash set into another by copying all elements.

    [use case]

    Converts this linked hash set into another by copying all elements.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this linked hash set.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

  186. def toArray: Array[A]

    [use case] Converts this linked hash set to an array.

    [use case]

    Converts this linked hash set to an array.

    returns

    an array containing all elements of this linked hash set. An ClassTag must be available for the element type of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

  187. def toBuffer[A1 >: A]: Buffer[A1]

    Converts this linked hash set to a mutable buffer.

    Converts this linked hash set to a mutable buffer.

    returns

    a buffer containing all elements of this linked hash set.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  188. def toCollection(repr: LinkedHashSet[A]): collection.Iterable[A]

    A conversion from collections of type Repr to LinkedHashSet objects.

    A conversion from collections of type Repr to LinkedHashSet objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  189. def toIndexedSeq: immutable.IndexedSeq[A]

    Converts this linked hash set to an indexed sequence.

    Converts this linked hash set to an indexed sequence.

    returns

    an indexed sequence containing all elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  190. def toIterable: collection.Iterable[A]

    Converts this linked hash set to an iterable collection.

    Converts this linked hash set to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this linked hash set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  191. def toIterator: Iterator[A]

    Returns an Iterator over the elements in this linked hash set.

    Returns an Iterator over the elements in this linked hash set. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this linked hash set.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  192. def toList: List[A]

    Converts this linked hash set to a list.

    Converts this linked hash set to a list.

    returns

    a list containing all elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  193. def toMap[T, U]: collection.Map[T, U]

    [use case] Converts this linked hash set to a map.

    [use case]

    Converts this linked hash set to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toMap[T, U](implicit ev: <:<[A, (T, U)]): immutable.Map[T, U]

  194. def toParArray: ParArray[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  195. def toSeq: collection.Seq[A]

    Converts this linked hash set to a sequence.

    Converts this linked hash set to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.

    returns

    a sequence containing all elements of this linked hash set.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  196. def toSet[B >: A]: immutable.Set[B]

    Converts this linked hash set to a set.

    Converts this linked hash set to a set.

    returns

    a set containing all elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  197. def toStream: immutable.Stream[A]

    Converts this linked hash set to a stream.

    Converts this linked hash set to a stream.

    returns

    a stream containing all elements of this linked hash set.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  198. 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
    SetLikeFunction1TraversableLike → AnyRef → Any
  199. def toTraversable: collection.Traversable[A]

    Converts this linked hash set to an unspecified Traversable.

    Converts this linked hash set to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    returns

    a Traversable containing all elements of this linked hash set.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  200. def toVector: Vector[A]

    Converts this linked hash set to a Vector.

    Converts this linked hash set to a Vector.

    returns

    a vector containing all elements of this linked hash set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  201. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LinkedHashSet[LinkedHashSet[B]]

    Transposes this linked hash set of traversable collections into a linked hash set of linked hash sets.

    Transposes this linked hash set of traversable collections into a linked hash set of linked hash sets.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this linked hash set is a Traversable.

    returns

    a two-dimensional linked hash set of linked hash sets which has as nth row the nth column of this linked hash set.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this linked hash set are not of the same size.

  202. def union(that: GenSet[A]): LinkedHashSet[A]

    Computes the union between of set and another set.

    Computes the union between of set and another set.

    that

    the set to form the union with.

    returns

    a new set consisting of all elements that are in this set or in the given set that.

    Definition Classes
    SetLikeGenSetLike
  203. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LinkedHashSet[A1], LinkedHashSet[A2])

    Converts this linked hash set of pairs into two collections of the first and second half of each pair.

    Converts this linked hash set of pairs into two collections of the first and second half of each pair.

    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

    an implicit conversion which asserts that the element type of this linked hash set is a pair.

    returns

    a pair linked hash sets, containing the first, respectively second half of each element pair of this linked hash set.

    Definition Classes
    GenericTraversableTemplate
  204. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LinkedHashSet[A1], LinkedHashSet[A2], LinkedHashSet[A3])

    Converts this linked hash set of triples into three collections of the first, second, and third element of each triple.

    Converts this linked hash set of triples into three collections of the first, second, and third element of each triple.

    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this linked hash set is a triple.

    returns

    a triple linked hash sets, containing the first, second, respectively third member of each element triple of this linked hash set.

    Definition Classes
    GenericTraversableTemplate
  205. def update(elem: A, included: Boolean): Unit

    Updates the presence of a single element in this set.

    Updates the presence of a single element in this set.

    This method allows one to add or remove an element elem from this set depending on the value of parameter included. Typically, one would use the following syntax:

    set(elem) = true  // adds element
    set(elem) = false // removes element
    elem

    the element to be added or removed

    included

    a flag indicating whether element should be included or excluded.

    Definition Classes
    SetLike
  206. def view(from: Int, until: Int): IterableView[A, LinkedHashSet[A]]

    Creates a non-strict view of a slice of this linked hash set.

    Creates a non-strict view of a slice of this linked hash set.

    Note: the difference between view and slice is that view produces a view of the current linked hash set, whereas slice produces a new linked hash set.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this linked hash set, starting at index from and extending up to (but not including) index until.

    Definition Classes
    IterableLikeTraversableLike
  207. def view: IterableView[A, LinkedHashSet[A]]

    Creates a non-strict view of this linked hash set.

    Creates a non-strict view of this linked hash set.

    returns

    a non-strict view of this linked hash set.

    Definition Classes
    IterableLikeTraversableLike
  208. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  209. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  210. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  211. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, LinkedHashSet[A]]

    Creates a non-strict filter of this linked hash set.

    Creates a non-strict filter of this linked hash set.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this linked hash set which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  212. def zip[B](that: GenIterable[B]): LinkedHashSet[(A, B)]

    [use case] Returns a linked hash set formed from this linked hash set and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a linked hash set formed from this linked hash set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new linked hash set containing pairs consisting of corresponding elements of this linked hash set and that. The length of the returned collection is the minimum of the lengths of this linked hash set and that.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, B), That]): That

  213. def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): LinkedHashSet[(A, B)]

    [use case] Returns a linked hash set formed from this linked hash set and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a linked hash set formed from this linked hash set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this linked hash set is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this linked hash set.

    returns

    a new linked hash set containing pairs consisting of corresponding elements of this linked hash set and that. The length of the returned collection is the maximum of the lengths of this linked hash set and that. If this linked hash set is shorter than that, thisElem values are used to pad the result. If that is shorter than this linked hash set, thatElem values are used to pad the result.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, B), That]): That

  214. def zipWithIndex: LinkedHashSet[(A, Int)]

    [use case] Zips this linked hash set with its indices.

    [use case]

    Zips this linked hash set with its indices.

    returns

    A new linked hash set containing pairs consisting of all elements of this linked hash set paired with their index. Indices start at 0.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

  215. def |(that: GenSet[A]): LinkedHashSet[A]

    Computes the union between this set and another set.

    Computes the union between this set and another set.

    Note: Same as union.

    that

    the set to form the union with.

    returns

    a new set consisting of all elements that are in this set or in the given set that.

    Definition Classes
    GenSetLike
  216. def [B](y: B): (LinkedHashSet[A], B)

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to ArrowAssoc[LinkedHashSet[A]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implict Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashSet: StringAdd).+(other)
    Definition Classes
    StringAdd
  2. def filter(p: (A) ⇒ Boolean): TraversableOnce[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashSet: MonadOps[A]).filter(p)
    Definition Classes
    MonadOps
  3. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashSet: MonadOps[A]).flatMap(f)
    Definition Classes
    MonadOps
  4. def map[B](f: (A) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashSet: MonadOps[A]).map(f)
    Definition Classes
    MonadOps
  5. val self: Any

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (linkedHashSet: StringAdd).self
    Definition Classes
    StringAdd
  6. val self: Any

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (linkedHashSet: StringFormat).self
    Definition Classes
    StringFormat
  7. def withFilter(p: (A) ⇒ Boolean): Iterator[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashSet: MonadOps[A]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a /:\ 5)(_+_)
    b: Int = 15
    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to ArrowAssoc[LinkedHashSet[A]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (linkedHashSet: ArrowAssoc[LinkedHashSet[A]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: LinkedHashSet[A]

    Implicit information
    This member is added by an implicit conversion from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (linkedHashSet: Ensuring[LinkedHashSet[A]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from HashTable[A, LinkedHashSet.Entry[A]]

Inherited from HashUtils[A]

Inherited from AbstractSet[A]

Inherited from Set[A]

Inherited from SetLike[A, LinkedHashSet[A]]

Inherited from Cloneable[Set[A]]

Inherited from scala.Cloneable

Inherited from java.lang.Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, LinkedHashSet[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from collection.Set[A]

Inherited from collection.SetLike[A, LinkedHashSet[A]]

Inherited from Subtractable[A, LinkedHashSet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, LinkedHashSet]

Inherited from GenSetLike[A, LinkedHashSet[A]]

Inherited from (A) ⇒ Boolean

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from collection.AbstractIterable[A]

Inherited from collection.Iterable[A]

Inherited from IterableLike[A, LinkedHashSet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, LinkedHashSet[A]]

Inherited from AbstractTraversable[A]

Inherited from collection.Traversable[A]

Inherited from GenTraversable[A]

Inherited from TraversableLike[A, LinkedHashSet[A]]

Inherited from GenTraversableLike[A, LinkedHashSet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, LinkedHashSet[A]]

Inherited from HasNewBuilder[A, scala.collection.mutable.LinkedHashSet[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion traversable2ops from LinkedHashSet[A] to TraversableOps[A]

Inherited by implicit conversion MonadOps from LinkedHashSet[A] to MonadOps[A]

Inherited by implicit conversion any2stringadd from LinkedHashSet[A] to StringAdd

Inherited by implicit conversion any2stringfmt from LinkedHashSet[A] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from LinkedHashSet[A] to ArrowAssoc[LinkedHashSet[A]]

Inherited by implicit conversion any2Ensuring from LinkedHashSet[A] to Ensuring[LinkedHashSet[A]]

Inherited by implicit conversion alternateImplicit from LinkedHashSet[A] to ForceImplicitAmbiguity

Ungrouped