scala.collection.mutable

LinkedHashSet

class LinkedHashSet [A] extends Set[A] with GenericSetTemplate[A, LinkedHashSet] with SetLike[A, LinkedHashSet[A]] with FlatHashTable[A]

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.

go to: companion
linear super types: FlatHashTable[A], Set[A], SetLike[A, LinkedHashSet[A]], Cloneable[Set[A]], Shrinkable[A], Builder[A, LinkedHashSet[A]], Growable[A], Scriptable[A], Set[A], SetLike[A, LinkedHashSet[A]], Subtractable[A, LinkedHashSet[A]], Addable[A, LinkedHashSet[A]], GenericSetTemplate[A, LinkedHashSet], (A) ⇒ Boolean, Iterable[A], Iterable[A], IterableLike[A, LinkedHashSet[A]], Equals, Traversable[A], Mutable, Traversable[A], GenericTraversableTemplate[A, LinkedHashSet], TraversableLike[A, LinkedHashSet[A]], TraversableOnce[A], FilterMonadic[A, LinkedHashSet[A]], HasNewBuilder[A, LinkedHashSet[A]], AnyRef, Any
source: LinkedHashSet.scala
    version
  1. 2.0, 31/12/2006

    since
  1. 1

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LinkedHashSet
  2. FlatHashTable
  3. Set
  4. SetLike
  5. Cloneable
  6. Shrinkable
  7. Builder
  8. Growable
  9. Scriptable
  10. Set
  11. SetLike
  12. Subtractable
  13. Addable
  14. GenericSetTemplate
  15. Function1
  16. Iterable
  17. Iterable
  18. IterableLike
  19. Equals
  20. Traversable
  21. Mutable
  22. Traversable
  23. GenericTraversableTemplate
  24. TraversableLike
  25. TraversableOnce
  26. FilterMonadic
  27. HasNewBuilder
  28. AnyRef
  29. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new LinkedHashSet ()

Type Members

  1. type Self = LinkedHashSet[A]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

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

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def & (that: Set[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: SetLike
  7. def &~ (that: Set[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: SetLike
  8. def ** (that: Set[A]) : LinkedHashSet[A]

    This method is an alias for intersect.

    This method is an alias for intersect. It computes an intersection with set that. It removes all the elements that are not present in that.

    that

    the set to intersect with

    definition classes: SetLike
      deprecated:
    1. use & instead

  9. 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: SetLikeAddable
  10. 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: SetLikeSetLikeAddable
  11. def ++ (xs: TraversableOnce[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 cconsisting of elements of this set and those in xs.

    definition classes: SetLikeAddable
  12. def ++ (that: TraversableOnce[A]) : LinkedHashSet[A]

    [use case] Concatenates this linked hash set with the elements of a traversable collection.

    [use case]

    Concatenates this linked hash set with the elements of a traversable 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.

    attributes: abstract
    definition classes: TraversableLike
  13. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

    Concatenates this linked hash set with the elements of a traversable collection.

    Concatenates this linked hash set with the elements of a traversable collection.

    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 and the new element type B.

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

    returns

    the linked hash set itself.

    definition classes: Growable
  15. def += (elem: A) : LinkedHashSet.this.type

    Adds a single element to the set.

    Adds a single element to the [email protected] elem the element to be added.

    returns

    the builder itself.

    definition classes: LinkedHashSetSetLikeBuilderGrowable
  16. 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
  17. 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
  18. 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: SetLikeSetLikeSubtractable
  19. def -- (xs: TraversableOnce[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
  20. 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.

    returns

    the linked hash set itself

    definition classes: Shrinkable
  21. 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
  22. 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
  23. 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.

    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, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: TraversableOnce
  24. 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.

    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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: TraversableOnce
  25. 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
  26. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  27. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  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 (elem: A) : Boolean

    Add entry if not yet in table.

    Add entry if not yet in table.

    returns

    Returns true if a new entry was added, false otherwise.

    definition classes: FlatHashTable
  30. def addString (b: StringBuilder) : 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.

    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: StringBuilder, sep: String) : 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.

    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: StringBuilder, start: String, sep: String, end: String) : 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.

    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 andThen [A] (g: (Boolean) ⇒ A) : (A) ⇒ A

    (f andThen g)(x) == g(f(x))

    (f andThen g)(x) == g(f(x))

    definition classes: Function1
  34. 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: SetLike
  35. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  36. 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
  37. 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: LinkedHashSetSetLikeBuilderGrowable
  38. def clearTable () : Unit

    attributes: protected
    definition classes: FlatHashTable
  39. def clone () : LinkedHashSet[A]

    This method creates and returns a copy of the receiver object.

    This method creates and returns 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
  40. 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.

    attributes: abstract
    definition classes: TraversableLike
  41. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

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

    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.

    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.

    pf

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

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  42. 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: LinkedHashSetSetSetIterableIterableTraversableTraversableGenericTraversableTemplate
  43. def compose [A] (g: (A) ⇒ A) : (A) ⇒ Boolean

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  44. 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: LinkedHashSetSetLike
  45. def containsEntry (elem: A) : Boolean

    Checks whether an element is contained in the hash table.

    Checks whether an element is contained in the hash table.

    definition classes: FlatHashTable
  46. 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.

    attributes: abstract
    definition classes: TraversableLike
  47. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    Copies elements of this linked hash set to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  48. 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.

    attributes: abstract
    definition classes: TraversableOnce
  49. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this linked hash set to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  50. 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, after skipping start values. 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.

    attributes: abstract
    definition classes: TraversableOnce
  51. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this linked hash set to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  52. 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
  53. 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: TraversableOnce
  54. def diff (that: Set[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: SetLike
  55. 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: TraversableLike
  56. 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 first n ones, or else the empty linked hash set, if this linked hash set has less than n elements.

    definition classes: IterableLike
  57. 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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  58. def elemHashCode (elem: A) : Int

    attributes: protected
    definition classes: FlatHashTable
  59. def elements : Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  60. def empty : LinkedHashSet[A]

    definition classes: GenericSetTemplate
  61. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other 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).

    arg0

    the object to compare against this object for reference equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  62. 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: SetLikeEquals → AnyRef → Any
  63. 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: IterableLikeTraversableLikeTraversableOnce
  64. 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: TraversableLike
  65. 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: TraversableLike
  66. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected[lang]
    definition classes: AnyRef
  67. 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: IterableLikeTraversableLikeTraversableOnce
  68. def findEntry (elem: A) : Option[A]

    Finds an entry in the hash table if such an element exists.

    Finds an entry in the hash table if such an element exists.

    definition classes: FlatHashTable
  69. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  70. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  71. def flatMap [B] (f: (A) ⇒ Traversable[B]) : LinkedHashSet[B]

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

    [use case]

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

    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.

    attributes: abstract
    definition classes: TraversableLike
  72. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

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

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

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

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

    definition classes: TraversableLikeFilterMonadic
  73. def flatten [B] : LinkedHashSet[B]

    [use case] Converts this linked hash set of traversable collections into a linked hash set in which all element collections are concatenated.

    [use case]

    Converts this linked hash set of traversable collections into a linked hash set in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

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

    attributes: abstract
    definition classes: GenericTraversableTemplate
  74. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : LinkedHashSet[B]

    Converts this linked hash set of traversable collections into a linked hash set in which all element collections are concatenated.

    Converts this linked hash set of traversable collections into a linked hash set in which all element collections are concatenated.

    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 new linked hash set resulting from concatenating all element linked hash sets.

    definition classes: GenericTraversableTemplate
  75. 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, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: TraversableOnce
  76. 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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: IterableLikeTraversableOnce
  77. 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: IterableLikeTraversableLikeTraversableOnce
  78. 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.

    f

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

    attributes: abstract
    definition classes: IterableLike
  79. def foreach [U] (f: (A) ⇒ U) : Unit

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

    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.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

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

  80. 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
  81. def getClass () : java.lang.Class[_ <: java.lang.Object]

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

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

    attributes: final
    definition classes: AnyRef
  82. def groupBy [K] (f: (A) ⇒ K) : 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: TraversableLike
  83. 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:
    1. Iterator#grouped

  84. 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: TraversableLikeTraversableOnce
  85. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: SetLike → AnyRef → Any
  86. 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: IterableLikeTraversableLike
  87. 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: TraversableLike
  88. def improve (hcode: Int) : Int

    attributes: protected final
    definition classes: FlatHashTable
  89. def index (hcode: Int) : Int

    attributes: protected final
    definition classes: FlatHashTable
  90. 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: TraversableLike
  91. def initialSize : Int

    The initial size of the hash table.

    The initial size of the hash table.

    attributes: protected
    definition classes: FlatHashTable
  92. def intersect (that: Set[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: SetLike
  93. 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: SetLikeIterableLikeTraversableLikeTraversableOnce
  94. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.

    returns

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

    attributes: final
    definition classes: Any
  95. 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

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  96. 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: LinkedHashSetFlatHashTableIterableLike
  97. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this linked hash set.

    definition classes: TraversableLike
  98. 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: TraversableLike
  99. def loadFactor : Int

    The load factor for the hash table; must be < 500 (0.

    The load factor for the hash table; must be < 500 (0.5)

    attributes: protected
    definition classes: FlatHashTable
  100. def loadFactorDenum : Int

    attributes: protected final
    definition classes: FlatHashTable
  101. 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.

    attributes: abstract
    definition classes: TraversableLike
  102. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

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

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

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

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

    definition classes: SetLikeTraversableLikeFilterMonadic
  103. 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
  104. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this linked hash set.

    attributes: abstract
    definition classes: TraversableOnce
  105. def max [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this linked hash set with respect to the ordering cmp.

    definition classes: TraversableOnce
  106. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this linked hash set

    attributes: abstract
    definition classes: TraversableOnce
  107. def min [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this linked hash set with respect to the ordering cmp.

    definition classes: TraversableOnce
  108. 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: TraversableOnce
  109. 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: TraversableOnce
  110. 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: TraversableOnce
  111. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  112. 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
  113. 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: TraversableOnce
  114. 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.

    attributes: final
    definition classes: AnyRef
  115. 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.

    attributes: final
    definition classes: AnyRef
  116. 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: TraversableLike
  117. 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.

    attributes: abstract
    definition classes: TraversableOnce
  118. def product [B >: A] (implicit num: Numeric[B]) : B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this linked hash set with respect to the * operator in num.

    definition classes: TraversableOnce
  119. def projection : IterableView[A, LinkedHashSet[A]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: IterableLike
      deprecated:
    1. use view' instead

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

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

    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

    the result of inserting op between consecutive elements of this linked hash set, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: TraversableOnce
  121. 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: TraversableOnce
  122. 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(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this linked hash set.

    definition classes: IterableLikeTraversableOnce
  123. 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: TraversableOnce
  124. 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
  125. def removeEntry (elem: A) : Option[A]

    Removes an entry from the hash table, returning an option value with the element, or None if it didn't exist.

    Removes an entry from the hash table, returning an option value with the element, or None if it didn't exist.

    definition classes: FlatHashTable
  126. 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: TraversableLike
  127. 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
  128. 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
  129. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  130. def sameElements (that: Iterable[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.

    attributes: abstract
    definition classes: IterableLike
  131. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IterableLike
  132. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

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

    Produces a collection containing cummulative 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 and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  133. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashSet[A], B, That]) : That

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

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

    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 and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  134. 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: LinkedHashSetTraversableOnce
  135. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int =0) : 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 ot 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
  136. 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
  137. def sizeHintBounded (size: Int, boundingColl: scala.collection.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
  138. def slice (from: Int, until: Int) : LinkedHashSet[A]

    Selects an interval of elements.

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    from

    the index of the first returned element in this linked hash set.

    until

    the index one past the last returned element in this linked hash set.

    returns

    a linked hash set containing the elements starting at index from and extending up to (but not including) index until of this linked hash set.

    definition classes: IterableLikeTraversableLike
  139. def sliding [B >: A] (size: Int, step: Int) : Iterator[LinkedHashSet[A]]

    definition classes: IterableLike
  140. def sliding [B >: A] (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:
    1. Iterator#sliding

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

    p

    the test predicate

    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: TraversableLike
  142. 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: TraversableLike
  143. 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: SetLikeTraversableLike
  144. def subsetOf (that: Set[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: SetLike
  145. 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.

    attributes: abstract
    definition classes: TraversableOnce
  146. def sum [B >: A] (implicit num: Numeric[B]) : B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this linked hash set with respect to the + operator in num.

    definition classes: TraversableOnce
  147. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  148. var table : Array[AnyRef]

    The actual hash table.

    The actual hash table.

    attributes: protected
    definition classes: FlatHashTable
  149. 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: FlatHashTable
  150. 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: TraversableLike
  151. def take (n: Int) : LinkedHashSet[A]

    Selects first n elements.

    Selects first n elements.

    n

    Tt 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: IterableLikeTraversableLike
  152. 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
  153. 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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLike
  154. def thisCollection : 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
  155. 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: FlatHashTable
  156. 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. A ClassManifest must be available for the element type of this linked hash set.

    attributes: abstract
    definition classes: TraversableOnce
  157. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this linked hash set to an array.

    Converts this linked hash set to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this linked hash set.

    definition classes: TraversableOnce
  158. def toBuffer [B >: A] : Buffer[B]

    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: TraversableOnce
  159. def toCollection (repr: LinkedHashSet[A]) : 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
  160. def toIndexedSeq [B >: A] : IndexedSeq[B]

    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: TraversableOnce
  161. def toIterable : 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: IterableLikeTraversableOnce
  162. 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: TraversableLikeTraversableOnce
  163. 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: TraversableOnce
  164. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    Converts this linked hash set to a map.

    Converts this linked hash set to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) 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 containing all elements of this linked hash set.

    definition classes: TraversableOnce
  165. def toSeq : Seq[A]

    Converts this linked hash set to a sequence.

    Converts this linked hash set to a sequence.

    returns

    a sequence containing all the elements of this linked hash set.

    definition classes: IterableLikeTraversableOnce
  166. def toSet [B >: A] : 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: TraversableOnce
  167. def toStream : 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: IterableLikeTraversableLikeTraversableOnce
  168. def toString () : String

    Converts this linked hash set to a string.

    Converts this linked hash set to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this linked hash set, followed by all elements separated by commas and enclosed in parentheses.

    definition classes: SetLikeTraversableLike → AnyRef → Any
  169. def toTraversable : 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: TraversableLikeTraversableOnce
  170. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[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
  171. def union (that: Set[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: SetLike
  172. 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 halfs of each pair.

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

    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
  173. 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
  174. 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
  175. 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
  176. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  177. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  178. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  179. 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
  180. def zip [B] (that: Iterable[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.

    attributes: abstract
    definition classes: IterableLike
  181. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, B), That]) : That

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

    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.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That 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: IterableLike
  182. def zipAll [B] (that: 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.

    attributes: abstract
    definition classes: IterableLike
  183. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, B), That]) : That

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

    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.

    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 collection of type That 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: IterableLike
  184. 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. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  185. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[LinkedHashSet[A], (A1, Int), That]) : That

    Zips this linked hash set with its indices.

    Zips this linked hash set with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

    definition classes: IterableLike
  186. def | (that: Set[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: SetLike

Inherited from FlatHashTable[A]

Inherited from Set[A]

Inherited from SetLike[A, LinkedHashSet[A]]

Inherited from Cloneable[Set[A]]

Inherited from Shrinkable[A]

Inherited from Builder[A, LinkedHashSet[A]]

Inherited from Growable[A]

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, LinkedHashSet[A]]

Inherited from Subtractable[A, LinkedHashSet[A]]

Inherited from Addable[A, LinkedHashSet[A]]

Inherited from GenericSetTemplate[A, LinkedHashSet]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, LinkedHashSet[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, LinkedHashSet]

Inherited from TraversableLike[A, LinkedHashSet[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, LinkedHashSet[A]]

Inherited from HasNewBuilder[A, LinkedHashSet[A]]

Inherited from AnyRef

Inherited from Any