Packages

class LinkedKeySet extends KeySet

Attributes
protected
Annotations
@SerialVersionUID()
Source
LinkedHashMap.scala
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinkedKeySet
  2. KeySet
  3. GenKeySet
  4. Serializable
  5. Serializable
  6. AbstractSet
  7. Set
  8. Equals
  9. SetOps
  10. Function1
  11. AbstractIterable
  12. Iterable
  13. IterableOps
  14. IterableOnceOps
  15. IterableOnce
  16. AnyRef
  17. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by toLazyZipOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LinkedKeySet()

Type Members

  1. type IterableCC[X] = collection.Set[X]

    Type alias to CC.

    Type alias to CC. It is used to provide a default implementation of the fromSpecificIterable and newSpecificBuilder operations.

    Due to the @uncheckedVariance annotation, usage of this type member can be unsound and is therefore not recommended.

    Attributes
    protected
    Definition Classes
    IterableOps

Value Members

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. final def &(that: collection.Set[K]): collection.Set[K]

    Alias for intersect

    Alias for intersect

    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: collection.Set[K]): collection.Set[K]

    Alias for diff

    Alias for diff

    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def ++(that: collection.Iterable[K]): collection.Set[K]

    Alias for concat

    Alias for concat

    Definition Classes
    SetOps
    Annotations
    @inline()
  6. final def ++[B >: K](suffix: collection.Iterable[B]): collection.Set[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. def ->[B](y: B): (LinkedKeySet, B)
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toArrowAssoc[LinkedKeySet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean

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

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

    returns

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

    Definition Classes
    AnyRef → Any
  9. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this $coll to a string builder.

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

    Example:

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

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
  10. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this $coll to a string builder using a separator string.

    Appends all elements of this $coll 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 $coll, separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(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
    IterableOnceOps
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type

    Appends all elements of this $coll to a string builder using start, end, and separator strings.

    Appends all elements of this $coll 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 $coll are separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(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
    IterableOnceOps
  12. def andThen[A](g: (Boolean) ⇒ A): (K) ⇒ 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()
  13. def apply(elem: K): 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
    SetOpsFunction1
    Annotations
    @deprecatedOverriding(message = "This method should be final, but is not due to scala/bug#10853", since = "2.13.0")
  14. 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.

  15. def canEqual(that: Any): Boolean

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

    the value being probed for possible equality

    returns

    true if this instance can possibly equal that, otherwise false

    Definition Classes
    SetEquals
  16. def className: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for ListMap this method should return "ListMap", not "Map" (the supertype) or "Node" (an implementation subclass).

    It is recommended to overwrite this method even if the default implementation returns the correct name, to avoid the implementation using reflection.

    returns

    a string representation which starts the result of toString applied to this iterable collection. By default the string prefix is the simple name of the collection class iterable collection.

    Definition Classes
    IterableOps
  17. def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.CloneNotSupportedException])
    Note

    not specified by SLS as a member of AnyRef

  18. def coll: LinkedKeySet.this.type

    returns

    This collection as a C.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
  19. def collect[B](pf: PartialFunction[K, B]): collection.Set[B]

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

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

    B

    the element type of the returned iterable collection.

    pf

    the partial function which filters and maps the iterable collection.

    returns

    a new iterable collection 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
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  20. def collectFirst[B](pf: PartialFunction[K, B]): Option[B]

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    $mayNotTerminateInf $orderDependent

    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
    IterableOnceOps
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  21. def compose[A](g: (A) ⇒ K): (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()
  22. def concat(that: collection.Iterable[K]): collection.Set[K]

    Creates a new set by adding all elements contained in another collection to this set, omitting duplicates.

    Creates a new set by adding all elements contained in another collection to this set, omitting duplicates.

    This method takes a collection of elements and adds all elements, omitting duplicates, into set.

    Example:

    scala> val a = Set(1, 2) concat Set(2, 3)
    a: scala.collection.immutable.Set[Int] = Set(1, 2, 3)
    that

    the collection containing the elements to add.

    returns

    a new set with the given elements added, omitting duplicates.

    Definition Classes
    SetOps
  23. def concat[B >: K](suffix: collection.Iterable[B]): collection.Set[B]

    Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

    the element type of the returned collection.

    suffix

    the traversable to append.

    returns

    a new iterable collection which contains all elements of this iterable collection followed by all elements of suffix.

    Definition Classes
    IterableOps
  24. def contains(key: K): Boolean
    Definition Classes
    GenKeySet
  25. def copyToArray(xs: Array[K], start: Int, len: Int): Unit

    [use case] Note: will not terminate for infinite-sized collections.

    [use case]

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index of xs.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableOnceOps
    Full Signature

    def copyToArray[B >: K](xs: Array[B], start: Int, len: Int): xs.type

  26. def copyToArray(xs: Array[K], start: Int): Unit

    [use case] Note: will not terminate for infinite-sized collections.

    [use case]

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index of xs.

    Definition Classes
    IterableOnceOps
    Full Signature

    def copyToArray[B >: K](xs: Array[B], start: Int = 0): xs.type

  27. def count(p: (K) ⇒ Boolean): Int

    Counts the number of elements in the $coll which satisfy a predicate.

    Counts the number of elements in the $coll which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  28. def diff(that: collection.Set[K]): collection.Set[K]

    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
    KeySetSetOps
  29. def drop(n: Int): collection.Set[K]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this iterable collection.

    returns

    a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  30. def dropRight(n: Int): collection.Set[K]

    The rest of the collection without its n last elements.

    The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

    Definition Classes
    IterableOps
  31. def dropWhile(p: (K) ⇒ Boolean): collection.Set[K]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this iterable collection whose first element does not satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  32. def empty: IterableCC[K]

    The empty set of the same type as this set

    The empty set of the same type as this set

    returns

    an empty set of type C.

    Definition Classes
    SetSetOps
  33. def ensuring(cond: (LinkedKeySet) ⇒ Boolean, msg: ⇒ Any): LinkedKeySet
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toEnsuring[LinkedKeySet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: (LinkedKeySet) ⇒ Boolean): LinkedKeySet
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toEnsuring[LinkedKeySet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean, msg: ⇒ Any): LinkedKeySet
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toEnsuring[LinkedKeySet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. def ensuring(cond: Boolean): LinkedKeySet
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toEnsuring[LinkedKeySet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. final def eq(arg0: AnyRef): Boolean

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

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

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

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

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

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

    Definition Classes
    AnyRef
  38. def equals(that: Any): Boolean

    The universal equality method defined in AnyRef.

    The universal equality method defined in AnyRef.

    Definition Classes
    SetEquals → AnyRef → Any
  39. def exists(p: (K) ⇒ Boolean): Boolean

    Tests whether a predicate holds for at least one element of this $coll.

    Tests whether a predicate holds for at least one element of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this $coll, otherwise false

    Definition Classes
    IterableOnceOps
  40. def filter(pred: (K) ⇒ Boolean): collection.Set[K]

    Selects all elements of this iterable collection which satisfy a predicate.

    Selects all elements of this iterable collection which satisfy a predicate.

    returns

    a new iterator consisting of all elements of this iterable collection that satisfy the given predicate p. The order of the elements is preserved.

    Definition Classes
    IterableOpsIterableOnceOps
  41. def filterNot(pred: (K) ⇒ Boolean): collection.Set[K]

    Selects all elements of this iterable collection which do not satisfy a predicate.

    Selects all elements of this iterable collection which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new iterable collection consisting of all elements of this iterable collection that do not satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    IterableOpsIterableOnceOps
  42. 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(classOf[java.lang.Throwable])
    Note

    not specified by SLS as a member of AnyRef

  43. def find(p: (K) ⇒ Boolean): Option[K]

    Finds the first element of the $coll satisfying a predicate, if any.

    Finds the first element of the $coll satisfying a predicate, if any.

    $mayNotTerminateInf $orderDependent

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the $coll that satisfies p, or None if none exists.

    Definition Classes
    IterableOnceOps
  44. def flatMap[B](f: (K) ⇒ IterableOnce[B]): collection.Set[B]

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

    Builds a new iterable collection by applying a function to all elements of this iterable collection 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 iterable collection. 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 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 iterable collection resulting from applying the given collection-valued function f to each element of this iterable collection and concatenating the results.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  45. def flatten[B](implicit asIterable: (K) ⇒ IterableOnce[B]): collection.Set[B]

    Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.

    Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of iterable collection. For example:

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

    the type of the elements of each traversable collection.

    asIterable

    an implicit conversion which asserts that the element type of this iterable collection is a GenTraversable.

    returns

    a new iterable collection resulting from concatenating all element iterable collections.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  46. def fold[A1 >: K](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this $coll using the specified associative binary operator.

    Folds the elements of this $coll using the specified associative binary operator. The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

    $undefinedorder $willNotTerminateInf

    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 the fold operator op between all the elements and z, or z if this $coll is empty.

    Definition Classes
    IterableOnceOps
  47. def foldLeft[B](z: B)(op: (B, K) ⇒ B): B

    Applies a binary operator to a start value and all elements of this $coll, going left to right.

    Applies a binary operator to a start value and all elements of this $coll, going left to right.

    $willNotTerminateInf $orderDependentFold

    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 $coll, 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 $coll. Returns z if this $coll is empty.

    Definition Classes
    IterableOnceOps
  48. def foldRight[B](z: B)(op: (K, B) ⇒ B): B

    Applies a binary operator to all elements of this $coll and a start value, going right to left.

    Applies a binary operator to all elements of this $coll and a start value, going right to left.

    $willNotTerminateInf $orderDependentFold

    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 $coll, 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 $coll. Returns z if this $coll is empty.

    Definition Classes
    IterableOnceOps
  49. def forall(p: (K) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this $coll.

    Tests whether a predicate holds for all elements of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if this $coll is empty or the given predicate p holds for all elements of this $coll, otherwise false.

    Definition Classes
    IterableOnceOps
  50. def foreach[U](f: (K) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    IterableOnceOps
  51. 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
    This member is added by an implicit conversion from LinkedKeySet toStringFormat[LinkedKeySet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  52. final def fromIterable[E](it: collection.Iterable[E]): collection.Set[E]

    Similar to fromSpecificIterable, but for a (possibly) different type of element.

    Similar to fromSpecificIterable, but for a (possibly) different type of element. Note that the return type is now CC[E].

    Attributes
    protected
    Definition Classes
    IterableOps
    Annotations
    @inline()
  53. def fromSpecificIterable(coll: collection.Iterable[K]): IterableCC[K]

    Defines how to turn a given Iterable[A] into a collection of type C.

    Defines how to turn a given Iterable[A] into a collection of type C.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
    Note

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as it is called with an Iterable[A] obtained from this collection (as it is the case in the implementations of operations where we use a View[A]), it is safe.

  54. final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

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

    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  55. def groupBy[K](f: (K) ⇒ K): immutable.Map[K, collection.Set[K]]

    Partitions this iterable collection into a map of iterable collections according to some discriminator function.

    Partitions this iterable collection into a map of iterable collections according to some discriminator function.

    Note: When applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to iterable collections such that the following invariant holds:

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

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

    Definition Classes
    IterableOps
  56. def groupMap[K, B](key: (K) ⇒ K)(f: (K) ⇒ B): immutable.Map[K, collection.Set[B]]

    Partitions this iterable collection into a map of iterable collections according to a discriminator function key.

    Partitions this iterable collection into a map of iterable collections according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

    It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

    case class User(name: String, age: Int)
    
    def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
      users.groupMap(_.age)(_.name)
    K

    the type of keys returned by the discriminator function

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  57. def groupMapReduce[K, B](key: (K) ⇒ K)(f: (K) ⇒ B)(reduce: (B, B) ⇒ B): immutable.Map[K, B]

    Partitions this iterable collection into a map according to a discriminator function key.

    Partitions this iterable collection into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the value function and then reduced into a single value with the reduce function.

    It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

    def occurrences[A](as: Seq[A]): Map[A, Int] =
      as.groupMapReduce(identity)(_ => 1)(_ + _)
    Definition Classes
    IterableOps
  58. def grouped(size: Int): Iterator[collection.Set[K]]

    Partitions elements in fixed size iterable collections.

    Partitions elements in fixed size iterable collections.

    size

    the number of elements per group

    returns

    An iterator producing iterable collections of size size, except the last will be less than size size if the elements don't divide evenly.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method grouped

  59. 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
    Set → AnyRef → Any
  60. def head: K

    Selects the first element of this iterable collection.

    Selects the first element of this iterable collection.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException if the iterable collection is empty.

  61. def headOption: Option[K]

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this iterable collection if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  62. def init: collection.Set[K]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Definition Classes
    IterableOps
  63. def inits: Iterator[collection.Set[K]]

    Iterates over the inits of this iterable collection.

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

    returns

    an iterator over all the inits of this iterable collection

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

  64. def intersect(that: collection.Set[K]): collection.Set[K]

    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
    SetOps
  65. def isEmpty: Boolean

    Tests whether the $coll is empty.

    Tests whether the $coll is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the $coll contains no elements, false otherwise.

    Definition Classes
    IterableOnceOps
  66. 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
  67. def iterableFactory: IterableFactory[collection.Set]

    returns

    The factory of this collection.

    Definition Classes
    LinkedKeySetSetIterableIterableOps
    Note

    This operation has to be overridden by concrete collection classes to effectively return an IterableFactory[IterableCC]. The implementation in Iterable only returns an IterableFactory[Iterable], but the compiler will not throw an error if the effective IterableCC type constructor is more specific than Iterable.

  68. def iterator: Iterator[K]
    Definition Classes
    GenKeySet
  69. def knownSize: Int

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise.

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
    IterableOnceOps
  70. def last: K

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    The last element of this iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException If the iterable collection is empty.

  71. def lastOption: Option[K]

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the last element of this iterable collection$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  72. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[K, B, collection.AbstractSet[K]]

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

    val xs = List(1, 2, 3)
    val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
    // res == List(4, 8, 12)
    B

    the type of the second element in each eventual pair

    that

    the iterable providing the second element of each eventual pair

    returns

    a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

    Implicit
    This member is added by an implicit conversion from LinkedKeySet toLazyZipOps[K, collection.AbstractSet[K]] performed by method toLazyZipOps in scala.collection.Iterable.
    Definition Classes
    LazyZipOps
  73. def map[B](f: (K) ⇒ B): collection.Set[B]

    Builds a new iterable collection by applying a function to all elements of this iterable collection.

    Builds a new iterable collection by applying a function to all elements of this iterable collection.

    B

    the element type of the returned iterable collection.

    f

    the function to apply to each element.

    returns

    a new iterable collection resulting from applying the given function f to each element of this iterable collection and collecting the results.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  74. def max: K

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    an option value containing the largest element of this set.

    Definition Classes
    IterableOnceOps
    Full Signature

    def maxOption[B >: K](implicit ord: math.Ordering[B]): Option[K]

  75. def max: K

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this set.

    Definition Classes
    IterableOnceOps
    Full Signature

    def max[B >: K](implicit ord: math.Ordering[B]): K

    Exceptions thrown

    UnsupportedOperationException if this set is empty.

  76. def maxBy[B](f: (K) ⇒ B): K

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    an option value containing the first element of this set with the largest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def maxByOption[B](f: (K) ⇒ B)(implicit cmp: math.Ordering[B]): Option[K]

  77. def maxBy[B](f: (K) ⇒ B): K

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this set with the largest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def maxBy[B](f: (K) ⇒ B)(implicit cmp: math.Ordering[B]): K

    Exceptions thrown

    UnsupportedOperationException if this set is empty.

  78. def min: K

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    an option value containing the smallest element of this set.

    Definition Classes
    IterableOnceOps
    Full Signature

    def minOption[B >: K](implicit ord: math.Ordering[B]): Option[K]

  79. def min: K

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this set

    Definition Classes
    IterableOnceOps
    Full Signature

    def min[B >: K](implicit ord: math.Ordering[B]): K

    Exceptions thrown

    UnsupportedOperationException if this set is empty.

  80. def minBy[B](f: (K) ⇒ B): K

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    an option value containing the first element of this set with the smallest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def minByOption[B](f: (K) ⇒ B)(implicit cmp: math.Ordering[B]): Option[K]

  81. def minBy[B](f: (K) ⇒ B): K

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this set with the smallest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def minBy[B](f: (K) ⇒ B)(implicit cmp: math.Ordering[B]): K

    Exceptions thrown

    UnsupportedOperationException if this set is empty.

  82. def mkString: String

    Displays all elements of this $coll in a string.

    Displays all elements of this $coll in a string.

    returns

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

    Definition Classes
    IterableOnceOps
  83. def mkString(sep: String): String

    Displays all elements of this $coll in a string using a separator string.

    Displays all elements of this $coll in a string using a separator string.

    sep

    the separator string.

    returns

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

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

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

    Displays all elements of this $coll in a string using start, end, and separator strings.

    Displays all elements of this $coll 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 $coll. 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 $coll are separated by the string sep.

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

  85. 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
  86. def newSpecificBuilder: Builder[K, IterableCC[K]]

    returns

    a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented with fromSpecificIterable instead of this method.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
    Note

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as the returned builder is only fed with A values taken from this instance, it is safe.

  87. def nonEmpty: Boolean

    Tests whether the $coll is not empty.

    Tests whether the $coll is not empty.

    returns

    true if the $coll contains at least one element, false otherwise.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
  88. final def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  89. final def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  90. def partition(p: (K) ⇒ Boolean): (collection.Set[K], collection.Set[K])

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not.

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not. Interesting because it splits a collection in two.

    The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in Buildable, which requires only a single traversal.

    Definition Classes
    IterableOps
  91. def product: K

    [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 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 set and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOnceOps
    Full Signature

    def product[B >: K](implicit num: math.Numeric[B]): B

  92. def reduce[B >: K](op: (B, B) ⇒ B): B

    Reduces the elements of this $coll using the specified associative binary operator.

    Reduces the elements of this $coll using the specified associative binary operator.

    $undefinedorder

    B

    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 $coll is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  93. def reduceLeft[B >: K](op: (B, K) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going left to right.

    Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going left to right:

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

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  94. def reduceLeftOption[B >: K](op: (B, K) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going left to right.

    Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOnceOps
  95. def reduceOption[B >: K](op: (B, B) ⇒ B): Option[B]

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    $undefinedorder

    B

    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
    IterableOnceOps
  96. def reduceRight[B >: K](op: (K, B) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going right to left.

    Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going right to left:

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

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  97. def reduceRightOption[B >: K](op: (K, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going right to left.

    Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOnceOps
  98. def reversed: collection.Iterable[K]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  99. def scan[B >: K](z: B)(op: (B, B) ⇒ B): collection.Set[B]

    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

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new iterable collection containing the prefix scan of the elements in this iterable collection

    Definition Classes
    IterableOps
  100. def scanLeft[B](z: B)(op: (B, K) ⇒ B): collection.Set[B]

    Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  101. def scanRight[B](z: B)(op: (K, B) ⇒ B): collection.Set[B]

    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.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Example:

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

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  102. def size: Int
    Definition Classes
    GenKeySet
  103. def slice(from: Int, until: Int): collection.Set[K]

    Selects an interval of elements.

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

    from <= indexOf(x) < until

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the lowest index to include from this iterable collection.

    until

    the lowest index to EXCLUDE from this iterable collection.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  104. def sliding(size: Int, step: Int): Iterator[collection.Set[K]]

    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

    returns

    An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  105. def sliding(size: Int): Iterator[collection.Set[K]]

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

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

    size

    the number of elements per group

    returns

    An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  106. def span(p: (K) ⇒ Boolean): (collection.Set[K], collection.Set[K])

    Splits this iterable collection into a prefix/suffix pair according to a predicate.

    Splits this iterable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this iterable collection whose elements all satisfy p, and the rest of this iterable collection.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesOneAndProducesTwoIterators

  107. def splitAt(n: Int): (collection.Set[K], collection.Set[K])

    Splits this iterable collection into two at a given position.

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.

    Definition Classes
    IterableOps
  108. def subsetOf(that: collection.Set[K]): 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
    SetOps
  109. def subsets(): Iterator[collection.Set[K]]

    An iterator over all subsets of this set.

    An iterator over all subsets of this set.

    returns

    the iterator.

    Definition Classes
    SetOps
  110. def subsets(len: Int): Iterator[collection.Set[K]]

    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
    SetOps
  111. def sum: K

    [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 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 set and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOnceOps
    Full Signature

    def sum[B >: K](implicit num: math.Numeric[B]): B

  112. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  113. def tail: collection.Set[K]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  114. def tails: Iterator[collection.Set[K]]

    Iterates over the tails of this iterable collection.

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

    returns

    an iterator over all the tails of this iterable collection

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

  115. def take(n: Int): collection.Set[K]

    Selects first n elements.

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take from this iterable collection.

    returns

    a iterable collection consisting only of the first n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements. If n is negative, returns an empty iterable collection.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  116. def takeRight(n: Int): collection.Set[K]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Definition Classes
    IterableOps
  117. def takeWhile(p: (K) ⇒ Boolean): collection.Set[K]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this iterable collection whose elements all satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  118. val this: collection.AbstractSet[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toLazyZipOps[K, collection.AbstractSet[K]] performed by method toLazyZipOps in scala.collection.Iterable.
    Definition Classes
    LazyZipOps
  119. def to[C1](factory: Factory[K, C1]): C1

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:

    xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

    Definition Classes
    IterableOnceOps
  120. def toArray[B >: K](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOnceOps
  121. def toIndexedSeq: immutable.IndexedSeq[K]
    Definition Classes
    IterableOnceOps
  122. final def toIterable: LinkedKeySet.this.type

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    IterableIterableOps
  123. def toList: immutable.List[K]
    Definition Classes
    IterableOnceOps
  124. def toMap[K, V](implicit ev: <:<[K, (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  125. def toSeq: immutable.Seq[K]

    returns

    This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.

    Definition Classes
    IterableOnceOps
  126. def toSet[B >: K]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  127. 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
    SetOpsFunction1IterableOps → AnyRef → Any
  128. def toVector: immutable.Vector[K]
    Definition Classes
    IterableOnceOps
  129. def transpose[B](implicit asIterable: (K) ⇒ collection.Iterable[B]): collection.Set[collection.Set[B]]

    Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

    Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

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

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))
    B

    the type of the elements of each iterable collection.

    asIterable

    an implicit conversion which asserts that the element type of this iterable collection is an Iterable.

    returns

    a two-dimensional iterable collection of iterable collections which has as nth row the nth column of this iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this iterable collection are not of the same size.

  130. final def union(that: collection.Iterable[K]): collection.Set[K]

    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
    SetOps
    Annotations
    @inline()
  131. def unzip[A1, A2](implicit asPair: (K) ⇒ (A1, A2)): (collection.Set[A1], collection.Set[A2])

    Converts this iterable collection of pairs into two collections of the first and second half of each pair.

    Converts this iterable collection of pairs into two collections of the first and second half of each pair.

    val xs = Iterable(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (Iterable(1, 2, 3),
    //        Iterable(one, two, three))
    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 iterable collection is a pair.

    returns

    a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.

    Definition Classes
    IterableOps
  132. def unzip3[A1, A2, A3](implicit asTriple: (K) ⇒ (A1, A2, A3)): (collection.Set[A1], collection.Set[A2], collection.Set[A3])

    Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.

    Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.

    val xs = Iterable(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (Iterable(1, 2, 3),
    //        Iterable(one, two, three),
    //        Iterable(1, 2, 3))
    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 iterable collection is a triple.

    returns

    a triple of iterable collections, containing the first, second, respectively third member of each element triple of this iterable collection.

    Definition Classes
    IterableOps
  133. def view: View[K]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    IterableOps
  134. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  135. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  136. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.InterruptedException])
  137. def withFilter(p: (K) ⇒ Boolean): WithFilter[K, collection.Set]

    Creates a non-strict filter of this iterable collection.

    Creates a non-strict filter of this iterable collection.

    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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 iterable collection which satisfy the predicate p.

    Definition Classes
    IterableOps
  138. def zip[B](that: collection.Iterable[B]): collection.Set[(K, B)]

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

    Returns a iterable collection formed from this iterable collection 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 iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.

    Definition Classes
    IterableOps
  139. def zipAll[A1 >: K, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): collection.Set[(A1, B)]

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

    Returns a iterable collection formed from this iterable collection 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 iterable collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this iterable collection.

    returns

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

    Definition Classes
    IterableOps
  140. def zipWithIndex: collection.Set[(K, Int)]

    Zips this iterable collection with its indices.

    Zips this iterable collection with its indices.

    returns

    A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at 0.

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

    Note

    Reuse: $consumesAndProducesIterator

  141. final def |(that: collection.Iterable[K]): collection.Set[K]

    Alias for union

    Alias for union

    Definition Classes
    SetOps
    Annotations
    @inline()
  142. def [B](y: B): (LinkedKeySet, B)
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toArrowAssoc[LinkedKeySet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toany2stringadd[LinkedKeySet] 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:
    (linkedKeySet: any2stringadd[LinkedKeySet]).+(other)
    Definition Classes
    any2stringadd

Deprecated Value Members

  1. def +(elem: K): collection.Set[K]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union

  2. final def --(that: collection.Set[K]): collection.Set[K]
    Definition Classes
    SetOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use &- or diff instead of --

  3. def /:[B](z: B)(op: (B, K) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead of /: on IterableOnce

  4. final def /:[B](z: B)(op: (B, K) ⇒ B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  5. def :\[B](z: B)(op: (K, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead of :\ on IterableOnce

  6. final def :\[B](z: B)(op: (K, B) ⇒ B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  7. final def copyToBuffer[B >: K](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  8. def find(p: (K) ⇒ Boolean): Option[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead of .find on IterableOnce

  9. def flatMap[B](f: (K) ⇒ IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead of .flatMap on IterableOnce or consider requiring an Iterable

  10. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead of .fold on IterableOnce

  11. def foldLeft[B](z: B)(op: (B, K) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead of .foldLeft on IterableOnce

  12. def foldRight[B](z: B)(op: (K, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead of .foldLeft on IterableOnce

  13. def foreach[U](f: (K) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead of .foreach(...) on IterableOnce

  14. final def hasDefiniteSize: Boolean
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .knownSize >=0 instead of .hasDefiniteSize

  15. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead of .isEmpty on IterableOnce

  16. def map[B](f: (K) ⇒ B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead of .map on IterableOnce or consider requiring an Iterable

  17. def mkString: String
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead of .mkString on IterableOnce

  18. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead of .mkString on IterableOnce

  19. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead of .mkString on IterableOnce

  20. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements for sameElements on Iterable or IterableOnce

  21. def seq: LinkedKeySet.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  22. final def stringPrefix: String
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use className instead of stringPrefix

  23. def to[C1](factory: Factory[K, C1]): C1
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use factory.from(it) instead of it.to(factory) for IterableOnce

  24. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it).toArray

  25. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  26. final def toBuffer[B >: K]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  27. final def toIterable: collection.Iterable[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Iterable.from(it) instead of it.toIterable

  28. def toIterator: Iterator[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) toIterator has been renamed to iterator

  29. final def toIterator: Iterator[K]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  30. def toList: immutable.List[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use List.from(it) instead of it.toList

  31. def toMap[K, V](implicit ev: <:<[K, (K, V)]): immutable.Map[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use Map.from(it) instead of it.toVector on IterableOnce

  32. def toSeq: immutable.Seq[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Seq.from(it) instead of it.toSeq

  33. def toSet[B >: A]: immutable.Set[B]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Set.from(it) instead of it.toSet

  34. def toStream: immutable.Stream[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Stream.from(it) instead of it.toStream

  35. final def toStream: immutable.Stream[K]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Stream.from(it) instead of it.toStream

  36. def toVector: immutable.Vector[K]
    Implicit
    This member is added by an implicit conversion from LinkedKeySet toIterableOnceExtensionMethods[K] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (linkedKeySet: IterableOnceExtensionMethods[K]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Vector.from(it) instead of it.toVector on IterableOnce

  37. final def view(from: Int, until: Int): View[K]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from LinkedHashMap.KeySet

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from collection.AbstractSet[K]

Inherited from collection.Set[K]

Inherited from Equals

Inherited from (K) ⇒ Boolean

Inherited from collection.AbstractIterable[K]

Inherited from collection.Iterable[K]

Inherited from IterableOnce[K]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromLinkedKeySet to IterableOnceExtensionMethods[K]

Inherited by implicit conversion toLazyZipOps fromLinkedKeySet to LazyZipOps[K, collection.AbstractSet[K]]

Inherited by implicit conversion any2stringadd fromLinkedKeySet to any2stringadd[LinkedKeySet]

Inherited by implicit conversion StringFormat fromLinkedKeySet to StringFormat[LinkedKeySet]

Inherited by implicit conversion Ensuring fromLinkedKeySet to Ensuring[LinkedKeySet]

Inherited by implicit conversion ArrowAssoc fromLinkedKeySet to ArrowAssoc[LinkedKeySet]

Ungrouped