Scala Standard Library2.13.8 < Back


# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

  The scala package contains core types like `Int`, `Float`, `Array` or `Option` which are accessible in all Scala compilation units without explicit qualification or imports.

  Notable packages include:

  - `scala.collection` and its sub-packages contain Scala's collections framework
    - `scala.collection.immutable` - Immutable, sequential data-structures such as `Vector`, `List`, `Range`, `HashMap` or `HashSet`
    - `scala.collection.mutable` - Mutable, sequential data-structures such as `ArrayBuffer`, `StringBuilder`, `HashMap` or `HashSet`
    - `scala.collection.concurrent` - Mutable, concurrent data-structures such as `TrieMap`
  - `scala.concurrent` - Primitives for concurrent programming such as `Futures` and `Promises`
  - `scala.io` - Input and output operations
  - `scala.math` - Basic math functions and additional numeric types like `BigInt` and `BigDecimal`
  - `scala.sys` - Interaction with other processes and the operating system
  - `scala.util.matching` - Regular expressions

  Other packages exist. See the complete list on the right.

  Additional parts of the standard library are shipped as separate libraries. These include:

  - `scala.reflect` - Scala's reflection API (scala-reflect.jar)
  - `scala.xml` - XML parsing, manipulation, and serialization (scala-xml.jar)
  - `scala.collection.parallel` - Parallel collections (scala-parallel-collections.jar)
  - `scala.util.parsing` - Parser combinators (scala-parser-combinators.jar)
  - `scala.swing` - A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)

  #### Automatic imports

  Identifiers in the scala package and the `scala.Predef` object are always in scope by default.

  Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example, `List` is an alias for `scala.collection.immutable.List`.

  Other aliases refer to classes provided by the underlying platform. For example, on the JVM, `String` is an alias for `java.lang.String`.

  Definition Classes
    root
-  package scala

  Core Scala types.

  Core Scala types. They are always available without an explicit import.

  Definition Classes
    root
-  package collection
  Definition Classes
    scala
-  package concurrent
  Definition Classes
    collection
-  package convert
  Definition Classes
    collection
-  package generic
  Definition Classes
    collection
-  package immutable
  Definition Classes
    collection
-  package mutable
  Definition Classes
    collection
- +:
- :+
- AbstractIndexedSeqView
- AbstractIterable
- AbstractIterator
- AbstractMap
- AbstractMapView
- AbstractSeq
- AbstractSeqView
- AbstractSet
- AbstractView
- AnyStepper
- ArrayOps
- BitSet
- BitSetOps
- BufferedIterator
- BuildFrom
- BuildFromLowPriority1
- BuildFromLowPriority2
- ClassTagIterableFactory
- ClassTagSeqFactory
- DefaultMap
- DoubleStepper
- EvidenceIterableFactory
- EvidenceIterableFactoryDefaults
- Factory
- Hashing
- IndexedSeq
- IndexedSeqOps
- IndexedSeqView
- IntStepper
- Iterable
- IterableFactory
- IterableFactoryDefaults
- IterableOnce
- IterableOnceExtensionMethods
- IterableOnceOps
- IterableOps
- Iterator
- JavaConverters
- LazyZip2
- LazyZip3
- LazyZip4
- LinearSeq
- LinearSeqOps
- LongStepper
- Map
- MapFactory
- MapFactoryDefaults
- MapOps
- MapView
- MapViewFactory
- Searching
- Seq
- SeqFactory
- SeqMap
- SeqOps
- SeqView
- Set
- SetOps
- SortedIterableFactory
- SortedMap
- SortedMapFactory
- SortedMapFactoryDefaults
- SortedMapOps
- SortedOps
- SortedSet
- SortedSetFactoryDefaults
- SortedSetOps
- SpecificIterableFactory
- Stepper
- StepperShape
- StepperShapeLowPriority1
- StepperShapeLowPriority2
- StrictOptimizedClassTagSeqFactory
- StrictOptimizedIterableOps
- StrictOptimizedLinearSeqOps
- StrictOptimizedMapOps
- StrictOptimizedSeqFactory
- StrictOptimizedSeqOps
- StrictOptimizedSetOps
- StrictOptimizedSortedMapOps
- StrictOptimizedSortedSetOps
- StringOps
- StringView
- View
- WithFilter

t

scala.collection

# StrictOptimizedSortedSetOps

###

#### trait StrictOptimizedSortedSetOps[A, +CC[X] <: SortedSet[X], +C <: SortedSetOps[A, CC, C]] extends SortedSetOps[A, CC, C] with StrictOptimizedSetOps[A, Set, C]

Trait that overrides sorted set operations to take advantage of strict builders.

A

  Elements type

CC

  Collection type constructor

C

  Collection type

Source
  StrictOptimizedSortedSetOps.scala

Linear Supertypes
StrictOptimizedSetOps[A, Set, C], StrictOptimizedIterableOps[A, Set, C], SortedSetOps[A, CC, C], SortedOps[A, C], SetOps[A, Set, C], (A) => Boolean, IterableOps[A, Set, C], IterableOnceOps[A, Set, C], IterableOnce[A], AnyRef, Any
Known Subclasses
BitSet, StrictOptimizedSortedSetOps, TreeSet, BitSet, TreeSet, BitSet1, BitSet2, BitSetN
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. StrictOptimizedSortedSetOps
2. StrictOptimizedSetOps
3. StrictOptimizedIterableOps
4. SortedSetOps
5. SortedOps
6. SetOps
7. Function1
8. IterableOps
9. IterableOnceOps
10. IterableOnce
11. AnyRef
12. Any

Implicitly

1. by iterableOnceExtensionMethods
2. by any2stringadd
3. by StringFormat
4. by Ensuring
5. by ArrowAssoc

1. Hide All
2. Show All

Visibility

1. Public
2. Protected

### Abstract Value Members

1.  abstract def coll: C

   returns

     This collection as a `C`.

   Attributes
     protected
   Definition Classes
     IterableOps
2.  abstract def contains(elem: A): Boolean
   Definition Classes
     SetOps
3.  abstract def diff(that: Set[A]): C

   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
     SetOps
4.  abstract def fromSpecific(coll: IterableOnce[A]): C

   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
     IterableOps
   Note

     When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

     ,

     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.

5.  abstract def iterableFactory: IterableFactory[Set]

   The companion object of this set, providing various factory methods.

   The companion object of this set, providing various factory methods.

   Definition Classes
     IterableOps
   Note

     When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

6.  abstract def iterator: Iterator[A]

   Iterator can be used only once

   Iterator can be used only once

   Definition Classes
     IterableOnce
7.  abstract def iteratorFrom(start: A): Iterator[A]

   Creates an iterator that contains all values from this collection greater than or equal to `start` according to the ordering of this collection.

   Creates an iterator that contains all values from this collection greater than or equal to `start` according to the ordering of this collection. x.iteratorFrom(y) is equivalent to but will usually be more efficient than x.from(y).iterator

   start

     The lower-bound (inclusive) of the iterator

   Definition Classes
     SortedSetOps
8.  abstract def newSpecificBuilder: Builder[A, C]

   returns

     a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.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 `fromSpecific` instead of this method.

   Attributes
     protected
   Definition Classes
     IterableOps
   Note

     When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

     ,

     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.

9.  abstract def ordering: Ordering[A]
   Definition Classes
     SortedOps
10.  abstract def rangeImpl(from: Option[A], until: Option[A]): C

    Creates a ranged projection of this collection.

    Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa.

    Note: keys are not guaranteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.

    from

      The lower-bound (inclusive) of the ranged projection. `None` if there is no lower bound.

    until

      The upper-bound (exclusive) of the ranged projection. `None` if there is no upper bound.

    Definition Classes
      SortedOps
11.  abstract def sortedIterableFactory: SortedIterableFactory[CC]

    The companion object of this sorted set, providing various factory methods.

    The companion object of this sorted set, providing various factory methods.

    Definition Classes
      SortedSetOps
    Note

      When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

12.  abstract def unsorted: Set[A]
    Definition Classes
      SortedSetOps
13.  abstract def toIterable: Iterable[A]

    returns

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

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

### Concrete 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: Set[A]): C

   Alias for `intersect`

   Alias for `intersect`

   Definition Classes
     SetOps
   Annotations
     @inline()
4.  final def &~(that: Set[A]): C

   Alias for `diff`

   Alias for `diff`

   Definition Classes
     SetOps
   Annotations
     @inline()
5.  final def ++(that: IterableOnce[A]): C

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     SetOps
   Annotations
     @inline()
6.  final def ++[B >: A](suffix: IterableOnce[B]): Set[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
7.  def ->[B](y: B): (StrictOptimizedSortedSetOps[A, CC, C], B)
   Implicit
     This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toArrowAssoc[StrictOptimizedSortedSetOps[A, CC, C]] 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.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder

   Appends all elements of this set to a string builder.

   Appends all elements of this set to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this set 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
   Annotations
     @inline()
10.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder

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

    Appends all elements of this 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 set, 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
    Annotations
      @inline()
11.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder

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

    Appends all elements of this 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 set 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): (A) => A

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

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

    A

      the result type of function `g`

    g

      a function R => A

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()
13.  final 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
      SetOps → Function1
    Annotations
      @inline()
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 clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

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

      not specified by SLS as a member of AnyRef

16.  def collect[B](pf: PartialFunction[A, B])(implicit ev: Ordering[B]): CC[B]

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

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the set.

    returns

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

    Definition Classes
      StrictOptimizedSortedSetOps → SortedSetOps
17.  def collect[B](pf: PartialFunction[A, B]): Set[B]

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

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

    B

      the element type of the returned set.

    pf

      the partial function which filters and maps the set.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
18.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

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

    Note: may not terminate for infinite-sized collections.

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

    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)`

19.  def compose[A](g: (A) => A): (A) => Boolean

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

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

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()
20.  def concat(that: IterableOnce[A]): C

    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
      StrictOptimizedSetOps → SetOps
21.  def concat[B >: A](suffix: IterableOnce[B]): Set[B]

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

    Returns a new set containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the set 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 set which contains all elements of this set followed by all elements of `suffix`.

    Definition Classes
      IterableOps
22.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with at most `len` elements of this set.

    Copying will stop once either all the elements of this set have been copied, 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 of xs.

    len

      the maximal number of elements to copy.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

23.  def copyToArray[B >: A](xs: Array[B], start: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this set.

    Copying will stop once either all the elements of this set have been copied, 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 of xs.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

24.  def copyToArray[B >: A](xs: Array[B]): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this set.

    Copying will stop once either all the elements of this set have been copied, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

25.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Note: will not terminate for infinite-sized collections.

    B

      the type of the elements of `that`

    that

      the other collection

    p

      the test predicate, which relates elements from both collections

    returns

      `true` if both collections have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this iterator and `y` of `that`, otherwise `false`

    Definition Classes
      IterableOnceOps
26.  def count(p: (A) => Boolean): Int

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

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

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      IterableOnceOps
27.  def drop(n: Int): C

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

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
28.  def dropRight(n: Int): C

    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.

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

    n

      the number of elements to drop from this set.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps
29.  def dropWhile(p: (A) => Boolean): C

    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 set whose first element does not satisfy the predicate `p`.

    Definition Classes
      IterableOps → IterableOnceOps
30.  def empty: C

    The empty iterable of the same type as this iterable

    The empty iterable of the same type as this iterable

    returns

      an empty iterable of type `C`.

    Definition Classes
      IterableOps
31.  def ensuring(cond: (StrictOptimizedSortedSetOps[A, CC, C]) => Boolean, msg: => Any): StrictOptimizedSortedSetOps[A, CC, C]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toEnsuring[StrictOptimizedSortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
32.  def ensuring(cond: (StrictOptimizedSortedSetOps[A, CC, C]) => Boolean): StrictOptimizedSortedSetOps[A, CC, C]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toEnsuring[StrictOptimizedSortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
33.  def ensuring(cond: Boolean, msg: => Any): StrictOptimizedSortedSetOps[A, CC, C]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toEnsuring[StrictOptimizedSortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
34.  def ensuring(cond: Boolean): StrictOptimizedSortedSetOps[A, CC, C]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toEnsuring[StrictOptimizedSortedSetOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
35.  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
36.  def equals(arg0: AnyRef): Boolean

    The equality method for reference types.

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

    See also `equals` in scala.Any.

    returns

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

    Definition Classes
      AnyRef → Any
37.  def exists(p: (A) => Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
38.  def filter(pred: (A) => Boolean): C

    Selects all elements of this set which satisfy a predicate.

    Selects all elements of this set which satisfy a predicate.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
39.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): C
    Attributes
      protected[collection]
    Definition Classes
      StrictOptimizedIterableOps
40.  def filterNot(pred: (A) => Boolean): C

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

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

    pred

      the predicate used to test elements.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
41.  def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

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

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

      not specified by SLS as a member of AnyRef

42.  def find(p: (A) => Boolean): Option[A]

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

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

    Note: may not terminate for infinite-sized collections.

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
43.  def firstKey: A

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
      SortedSetOps → SortedOps
44.  def flatMap[B](f: (A) => IterableOnce[B])(implicit ev: Ordering[B]): CC[B]

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

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      StrictOptimizedSortedSetOps → SortedSetOps
45.  def flatMap[B](f: (A) => IterableOnce[B]): Set[B]

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

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

    For example:

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

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

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

        // lettersOf will return a Set[Char], not a Seq
        def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => 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 set resulting from applying the given collection-valued function `f` to each element of this set and concatenating the results.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
46.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Set[B]

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

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

    The resulting collection's type will be guided by the type of set. 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.

    returns

      a new set resulting from concatenating all element sets.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
47.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1

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

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

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

    Note: will not terminate for infinite-sized collections.

    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 set is empty.

    Definition Classes
      IterableOnceOps
48.  def foldLeft[B](z: B)(op: (B, A) => B): B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    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 set, going left to right with the start value `z` on the left: `op(...op(z, x1), x2, ..., xn)` where `x1, ..., xn` are the elements of this set. Returns `z` if this set is empty.

    Definition Classes
      IterableOnceOps
49.  def foldRight[B](z: B)(op: (A, B) => B): B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    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 set, going right to left with the start value `z` on the right: `op(x1, op(x2, ... op(xn, z)...))` where `x1, ..., xn` are the elements of this set. Returns `z` if this set is empty.

    Definition Classes
      IterableOnceOps
50.  def forall(p: (A) => Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
51.  def foreach[U](f: (A) => 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
52.  final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

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

    Definition Classes
      AnyRef → Any
    Annotations
      @native()
53.  def groupBy[K](f: (A) => K): immutable.Map[K, C]

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

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

    Note: Even 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 sets 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 set of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      IterableOps
54.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, Set[B]]

    Partitions this set into a map of sets according to a discriminator function `key`.

    Partitions this set into a map of sets 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)

    Note: Even 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

    B

      the type of values returned by the transformation function

    key

      the discriminator function

    f

      the element transformation function

    Definition Classes
      IterableOps
55.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]

    Partitions this set into a map according to a discriminator function `key`.

    Partitions this set into a map according to a discriminator function `key`. All the values that have the same discriminator are then transformed by the `f` 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)(_ + _)

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

    Definition Classes
      IterableOps
56.  def grouped(size: Int): Iterator[C]

    Partitions elements in fixed size sets.

    Partitions elements in fixed size sets.

    size

      the number of elements per group

    returns

      An iterator producing sets 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`

57.  def hashCode(): Int

    The hashCode method for reference types.

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

    returns

      the hash code value for this object.

    Definition Classes
      AnyRef → Any
    Annotations
      @native()
58.  def head: A

    Selects the first element of this set.

    Selects the first element of this set.

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

    returns

      the first element of this set.

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` if the set is empty.

59.  def headOption: Option[A]

    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 set if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
60.  def init: C

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

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

    Definition Classes
      IterableOps
61.  def inits: Iterator[C]

    Iterates over the inits of this set.

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

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

    returns

      an iterator over all the inits of this set

    Definition Classes
      IterableOps
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

62.  def intersect(that: Set[A]): C

    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
63.  def isEmpty: Boolean

    Tests whether the set is empty.

    Tests whether the set 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 set contains no elements, `false` otherwise.

    Definition Classes
      IterableOnceOps
64.  final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Depending on what `T0` is, the test is done in one of the below ways:

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

    This is exactly equivalent to the type pattern `_: T0`

    returns

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

    Definition Classes
      Any
    Note

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

65.  def isTraversableAgain: Boolean

    Tests whether this set can be repeatedly traversed.

    Tests whether this set can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

      `true` if it is repeatedly traversable, `false` otherwise.

    Definition Classes
      IterableOps → IterableOnceOps
66.  def knownSize: Int

    returns

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

    Definition Classes
      IterableOnce
67.  def last: A

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

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` If the set is empty.

68.  def lastKey: A

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
      SortedSetOps → SortedOps
69.  def lastOption: Option[A]

    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 set$ if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
70.  def map[B](f: (A) => B)(implicit ev: Ordering[B]): CC[B]

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

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      StrictOptimizedSortedSetOps → SortedSetOps
71.  def map[B](f: (A) => B): Set[B]

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

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

    B

      the element type of the returned set.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
72.  def max[B >: A](implicit ord: Ordering[B]): A

    Finds the largest element.

    Finds the largest element.

    Note: will not terminate for infinite-sized collections.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      the largest element of this set with respect to the ordering `ord`.

    Definition Classes
      SortedSetOps → IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

73.  def maxBefore(key: A): Option[A]

    Find the largest element less than a given key.

    Find the largest element less than a given key.

    key

      The given key.

    returns

      `None` if there is no such node.

    Definition Classes
      SortedSetOps
74.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A

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

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

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the function f.

    f

      The measuring function.

    cmp

      An ordering to be used for comparing elements.

    returns

      the first element of this set with the largest value measured by function f with respect to the ordering `cmp`.

    Definition Classes
      IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

75.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]

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

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

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the function f.

    f

      The measuring function.

    cmp

      An ordering to be used for comparing elements.

    returns

      an option value containing the first element of this set with the largest value measured by function f with respect to the ordering `cmp`.

    Definition Classes
      IterableOnceOps
76.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

    Finds the largest element.

    Finds the largest element.

    Note: will not terminate for infinite-sized collections.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      an option value containing the largest element of this set with respect to the ordering `ord`.

    Definition Classes
      IterableOnceOps
77.  def min[B >: A](implicit ord: Ordering[B]): A

    Finds the smallest element.

    Finds the smallest element.

    Note: will not terminate for infinite-sized collections.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      the smallest element of this set with respect to the ordering `ord`.

    Definition Classes
      SortedSetOps → IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

78.  def minAfter(key: A): Option[A]

    Find the smallest element larger than or equal to a given key.

    Find the smallest element larger than or equal to a given key.

    key

      The given key.

    returns

      `None` if there is no such node.

    Definition Classes
      SortedSetOps
79.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A

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

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

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the function f.

    f

      The measuring function.

    cmp

      An ordering to be used for comparing elements.

    returns

      the first element of this set with the smallest value measured by function f with respect to the ordering `cmp`.

    Definition Classes
      IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

80.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]

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

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

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the function f.

    f

      The measuring function.

    cmp

      An ordering to be used for comparing elements.

    returns

      an option value containing the first element of this set with the smallest value measured by function f with respect to the ordering `cmp`.

    Definition Classes
      IterableOnceOps
81.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

    Finds the smallest element.

    Finds the smallest element.

    Note: will not terminate for infinite-sized collections.

    B

      The type over which the ordering is defined.

    ord

      An ordering to be used for comparing elements.

    returns

      an option value containing the smallest element of this set with respect to the ordering `ord`.

    Definition Classes
      IterableOnceOps
82.  final def mkString: String

    Displays all elements of this set in a string.

    Displays all elements of this set in a string.

    Delegates to addString, which can be overridden.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
83.  final def mkString(sep: String): String

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

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

    Delegates to addString, which can be overridden.

    sep

      the separator string.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
    Example:

    1. `List(1, 2, 3).mkString("|") = "1|2|3"`

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

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

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

    Delegates to addString, which can be overridden.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

      a string representation of this 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 set 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 nonEmpty: Boolean

    Tests whether the set is not empty.

    Tests whether the set is not empty.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
87.  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

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

89.  def partition(p: (A) => Boolean): (C, C)

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

    A pair of, first, all elements that satisfy predicate `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 `StrictOptimizedIterableOps`, which requires only a single traversal.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps
90.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Set[A1], Set[A2])

    Applies a function `f` to each element of the set and returns a pair of sets: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Applies a function `f` to each element of the set and returns a pair of sets: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Example:

        val xs = `Set`(1, "one", 2, "two", 3, "three") partitionMap {
         case i: Int => Left(i)
         case s: String => Right(s)
        }
        // xs == (`Set`(1, 2, 3),
        //        `Set`(one, two, three))

    A1

      the element type of the first resulting collection

    A2

      the element type of the second resulting collection

    f

      the 'split function' mapping the elements of this set to an scala.util.Either

    returns

      a pair of sets: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps
91.  def product[B >: A](implicit num: math.Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    Note: will not terminate for infinite-sized collections.

    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 set with respect to the `*` operator in `num`.

    Definition Classes
      IterableOnceOps
92.  def range(from: A, until: A): C

    Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

    Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

    from

      The lower-bound (inclusive) of the ranged projection.

    until

      The upper-bound (exclusive) of the ranged projection.

    Definition Classes
      SortedOps
93.  def rangeFrom(from: A): C

    Creates a ranged projection of this collection with no upper-bound.

    Creates a ranged projection of this collection with no upper-bound.

    from

      The lower-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedOps
94.  def rangeTo(to: A): C

    Create a range projection of this collection with no lower-bound.

    Create a range projection of this collection with no lower-bound.

    to

      The upper-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedSetOps → SortedOps
95.  def rangeUntil(until: A): C

    Creates a ranged projection of this collection with no lower-bound.

    Creates a ranged projection of this collection with no lower-bound.

    until

      The upper-bound (exclusive) of the ranged projection.

    Definition Classes
      SortedOps
96.  def reduce[B >: A](op: (B, B) => B): B

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

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

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

    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 set is nonempty.

    Definition Classes
      IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

97.  def reduceLeft[B >: A](op: (B, A) => B): B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

      the result type of the binary operator.

    op

      the binary operator.

    returns

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

    Definition Classes
      IterableOnceOps
    Exceptions thrown

      `UnsupportedOperationException` if this set is empty.

98.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

      the result type of the binary operator.

    op

      the binary operator.

    returns

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

    Definition Classes
      IterableOnceOps
99.  def reduceOption[B >: A](op: (B, B) => B): Option[B]

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

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

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

    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
100.  def reduceRight[B >: A](op: (A, B) => B): B

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

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

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this set is empty.

101.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]

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

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

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
102.  def reversed: Iterable[A]
     Attributes
       protected
     Definition Classes
       IterableOnceOps
103.  def scan[B >: A](z: B)(op: (B, B) => B): 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 set containing the prefix scan of the elements in this set

     Definition Classes
       IterableOps
104.  def scanLeft[B](z: B)(op: (B, A) => B): Set[B]

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

     Produces a set 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
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
105.  def scanRight[B](z: B)(op: (A, B) => B): 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.

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

     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
106.  def size: Int

     The size of this set.

     The size of this set.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this set.

     Definition Classes
       IterableOnceOps
107.  def sizeCompare(that: Iterable[_]): Int

     Compares the size of this set to the size of another `Iterable`.

     Compares the size of this set to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this set's size.

     returns

       A value `x` where

           x <  0       if this.size <  that.size
           x == 0       if this.size == that.size
           x >  0       if this.size >  that.size

       The method as implemented here does not call `size` directly; its running time is `O(this.size min that.size)` instead of `O(this.size + that.size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       IterableOps
108.  def sizeCompare(otherSize: Int): Int

     Compares the size of this set to a test value.

     Compares the size of this set to a test value.

     otherSize

       the test value that gets compared with the size.

     returns

       A value `x` where

           x <  0       if this.size <  otherSize
           x == 0       if this.size == otherSize
           x >  0       if this.size >  otherSize

       The method as implemented here does not call `size` directly; its running time is `O(size min otherSize)` instead of `O(size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       IterableOps
     See also

       sizeIs

109.  final def sizeIs: SizeCompareOps

     Returns a value class containing operations for comparing the size of this set to a test value.

     Returns a value class containing operations for comparing the size of this set to a test value.

     These operations are implemented in terms of `sizeCompare(Int)`, and allow the following more readable usages:

         this.sizeIs < size     // this.sizeCompare(size) < 0
         this.sizeIs <= size    // this.sizeCompare(size) <= 0
         this.sizeIs == size    // this.sizeCompare(size) == 0
         this.sizeIs != size    // this.sizeCompare(size) != 0
         this.sizeIs >= size    // this.sizeCompare(size) >= 0
         this.sizeIs > size     // this.sizeCompare(size) > 0

     Definition Classes
       IterableOps
     Annotations
       @inline()
110.  def slice(from: Int, until: Int): C

     Selects an interval of elements.

     Selects an interval of elements. The returned set 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 set.

     until

       the lowest index to EXCLUDE from this set.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
111.  def sliding(size: Int, step: Int): Iterator[C]

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

     The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

     size

       the number of elements per group

     step

       the distance between the first elements of successive groups

     returns

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

     Definition Classes
       IterableOps
     Examples:

     1. `List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))`

     ,

     2. `List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))`

     See also

       scala.collection.Iterator, method `sliding`

112.  def sliding(size: Int): Iterator[C]

     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`.)

     An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

     size

       the number of elements per group

     returns

       An iterator producing sets of size `size`, except for a non-empty collection with less than `size` elements, which returns an iterator that produces the source collection itself as its only element.

     Definition Classes
       IterableOps
     Examples:

     1. `List().sliding(2) = empty iterator`

     ,

     2. `List(1).sliding(2) = Iterator(List(1))`

     ,

     3. `List(1, 2).sliding(2) = Iterator(List(1, 2))`

     ,

     4. `List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))`

     See also

       scala.collection.Iterator, method `sliding`

113.  def span(p: (A) => Boolean): (C, C)

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

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

     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 set whose elements all satisfy `p`, and the rest of this set.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
114.  def splitAt(n: Int): (C, C)

     Splits this set into a prefix/suffix pair at a given position.

     Splits this set into a prefix/suffix pair 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 sets consisting of the first `n` elements of this set, and the other elements.

     Definition Classes
       IterableOps → IterableOnceOps
115.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S

     Returns a scala.collection.Stepper for the elements of this collection.

     Returns a scala.collection.Stepper for the elements of this collection.

     The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

     The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

     - For collections of `Int`, `Short`, `Byte` or `Char`, an scala.collection.IntStepper is returned
     - For collections of `Double` or `Float`, a scala.collection.DoubleStepper is returned
     - For collections of `Long` a scala.collection.LongStepper is returned
     - For any other element type, an scala.collection.AnyStepper is returned

     Note that this method is overridden in subclasses and the return type is refined to `S with EfficientSplit`, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

     Definition Classes
       IterableOnce
116.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     pf

       Element transformation partial function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
117.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2

     B

       Type of elements of the resulting collections (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     that

       Elements to concatenate to this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
118.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
119.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     b

       Builder to use to build the resulting collection

     toIterableOnce

       Evidence that `A` can be seen as an `IterableOnce[B]`

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
120.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
121.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2

     B

       Type of elements of the second collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[(Int, String)]`)

     that

       Collection to zip with this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
122.  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
       SetOps
123.  def subsets(): Iterator[C]

     An iterator over all subsets of this set.

     An iterator over all subsets of this set.

     returns

       the iterator.

     Definition Classes
       SetOps
124.  def subsets(len: Int): Iterator[C]

     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
125.  def sum[B >: A](implicit num: math.Numeric[B]): B

     Sums up the elements of this collection.

     Sums up the elements of this collection.

     Note: will not terminate for infinite-sized collections.

     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 set with respect to the `+` operator in `num`.

     Definition Classes
       IterableOnceOps
126.  final def synchronized[T0](arg0: => T0): T0

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

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

     returns

       the result of `body`

     Definition Classes
       AnyRef
127.  def tail: C

     The rest of the collection without its first element.

     The rest of the collection without its first element.

     Definition Classes
       IterableOps
128.  def tails: Iterator[C]

     Iterates over the tails of this set.

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

     returns

       an iterator over all the tails of this set

     Definition Classes
       IterableOps
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

129.  def take(n: Int): C

     Selects the first n elements.

     Selects the 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 set.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
130.  def takeRight(n: Int): C

     A collection containing the last `n` elements of this collection.

     A collection containing the last `n` elements of this collection.

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

     n

       the number of elements to take from this set.

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
131.  def takeWhile(p: (A) => Boolean): C

     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 set whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableOps → IterableOnceOps
132.  def tapEach[U](f: (A) => U): C

     Applies a side-effecting function to each element in this collection.

     Applies a side-effecting function to each element in this collection. Strict collections will apply `f` to their elements immediately, while lazy collections like Views and LazyLists will only apply `f` on each element if and when that element is evaluated, and each time that element is evaluated.

     U

       the return type of f

     f

       a function to apply to each element in this set

     returns

       The same logical collection as this

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
133.  def to[C1](factory: Factory[A, 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
134.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

     Convert collection to array.

     Convert collection to array.

     Implementation note: DO NOT call Array.from from this method.

     Definition Classes
       IterableOnceOps
135.  final def toBuffer[B >: A]: Buffer[B]
     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
136.  def toIndexedSeq: immutable.IndexedSeq[A]
     Definition Classes
       IterableOnceOps
137.  def toList: immutable.List[A]
     Definition Classes
       IterableOnceOps
138.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
     Definition Classes
       IterableOnceOps
139.  def toSeq: immutable.Seq[A]

     returns

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

     Definition Classes
       IterableOnceOps
140.  def toSet[B >: A]: immutable.Set[B]
     Definition Classes
       IterableOnceOps
141.  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
       Function1 → AnyRef → Any
142.  def toVector: immutable.Vector[A]
     Definition Classes
       IterableOnceOps
143.  def transpose[B](implicit asIterable: (A) => Iterable[B]): Set[Set[B]]

     Transposes this set of iterable collections into a set of sets.

     Transposes this set of iterable collections into a set of sets.

     The resulting collection's type will be guided by the static type of set. 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))

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

     B

       the type of the elements of each iterable collection.

     asIterable

       an implicit conversion which asserts that the element type of this set is an `Iterable`.

     returns

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

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this set are not of the same size.

144.  final def union(that: Set[A]): C

     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()
145.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Set[A1], Set[A2])

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

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

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

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
146.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

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

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

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
147.  def view: View[A]

     A view over the elements of this collection.

     A view over the elements of this collection.

     Definition Classes
       IterableOps
148.  final def wait(): Unit

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

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

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

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

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

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

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

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

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

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

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

       not specified by SLS as a member of AnyRef

151.  def withFilter(p: (A) => Boolean): WithFilter[A, Set]

     Creates a non-strict filter of this set.

     Creates a non-strict filter of this 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.

     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 set which satisfy the predicate `p`.

     Definition Classes
       IterableOps
152.  def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(A, B)]): CC[(A, B)]

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

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

     Definition Classes
       StrictOptimizedSortedSetOps → SortedSetOps
153.  def zip[B](that: IterableOnce[B]): Set[(A, B)]

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

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
154.  def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]

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

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

     thatElem

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

     returns

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

     Definition Classes
       IterableOps
155.  def zipWithIndex: Set[(A, Int)]

     Zips this set with its indices.

     Zips this set with its indices.

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
     Example:

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

156.  final def |(that: Set[A]): C

     Alias for `union`

     Alias for `union`

     Definition Classes
       SetOps
     Annotations
       @inline()

### Shadowed Implicit Value Members

1.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toany2stringadd[StrictOptimizedSortedSetOps[A, CC, C]] 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:

         (strictOptimizedSortedSetOps: any2stringadd[StrictOptimizedSortedSetOps[A, CC, C]]).+(other)

   Definition Classes
     any2stringadd

### Deprecated Value Members

1.  def +(elem1: A, elem2: A, elems: A*): C
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

2.  def +(elem: A): C
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

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

3.  def ++:[B >: A](that: IterableOnce[B]): Set[B]
   Definition Classes
     IterableOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

4.  def -(elem1: A, elem2: A, elems: A*): C
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

5.  def -(elem: A): C
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

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

6.  def --(that: IterableOnce[A]): C
   Definition Classes
     SetOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Consider requiring an immutable Set

7.  def /:[B](z: B)(op: (B, A) => B): B
   Implicit
     This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A])./:(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldLeft instead

8.  final def /:[B](z: B)(op: (B, A) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldLeft instead of /:

9.  def :\[B](z: B)(op: (A, B) => B): B
   Implicit
     This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).:\(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldRight instead

10.  final def :\[B](z: B)(op: (A, B) => B): B
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use foldRight instead of :\

11.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.

12.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).collectFirst(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.collectFirst(...) instead

13.  def companion: IterableFactory[Set]
    Definition Classes
      IterableOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use iterableFactory instead

14.  def compare(k0: A, k1: A): Int

    Comparison function that orders keys.

    Comparison function that orders keys.

    Definition Classes
      SortedOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use ordering.compare instead

15.  def copyToBuffer(dest: Buffer[A]): Unit
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).copyToBuffer(dest)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

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

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

17.  def count(f: (A) => Boolean): Int
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).count(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.count(...) instead

18.  def exists(f: (A) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).exists(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.exists(...) instead

19.  def filter(f: (A) => Boolean): Iterator[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).filter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.filter(...) instead

20.  def find(p: (A) => Boolean): Option[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).find(p)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.find instead

21.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).flatMap(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

22.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).fold(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.fold instead

23.  def foldLeft[B](z: B)(op: (B, A) => B): B
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).foldLeft(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

24.  def foldRight[B](z: B)(op: (A, B) => B): B
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).foldRight(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

25.  def forall(f: (A) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).forall(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.forall(...) instead

26.  def foreach[U](f: (A) => U): Unit
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).foreach(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foreach(...) instead

27.  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 StrictOptimizedSortedSetOps[A, CC, C] toStringFormat[StrictOptimizedSortedSetOps[A, CC, C]] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.12.16) Use `formatString.format(value)` instead of `value.formatted(formatString)`, or use the `f""` string interpolator. In Java 15 and later, `formatted` resolves to the new method in String which has reversed parameters.

28.  final def from(from: A): C

    Creates a ranged projection of this collection with no upper-bound.

    Creates a ranged projection of this collection with no upper-bound.

    from

      The lower-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeFrom

29.  def hasDefiniteSize: Boolean

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

    Tests whether this 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. Non-empty Iterators usually return `false` even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that `hasDefiniteSize` returns `true`. However, checking `hasDefiniteSize` can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

      method `knownSize` for a more useful alternative

30.  def isEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).isEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.isEmpty instead

31.  def keysIteratorFrom(start: A): Iterator[A]
    Definition Classes
      SortedSetOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `iteratorFrom` instead.

32.  def map[B](f: (A) => B): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).map(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

33.  def max(implicit ord: math.Ordering[A]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).max(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.max instead

34.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.maxBy(...) instead

35.  def min(implicit ord: math.Ordering[A]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).min(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.min instead

36.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).minBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.minBy(...) instead

37.  def mkString: String
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).mkString

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

38.  def mkString(sep: String): String
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).mkString(sep)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

39.  def mkString(start: String, sep: String, end: String): String
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).mkString(start, sep, end)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

40.  def nonEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).nonEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.nonEmpty instead

41.  def product(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).product(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

42.  def reduce(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduce(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduce(...) instead

43.  def reduceLeft(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduceLeft(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

44.  def reduceLeftOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduceLeftOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

45.  def reduceOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduceOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceOption(...) instead

46.  def reduceRight(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduceRight(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRight(...) instead

47.  def reduceRightOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).reduceRightOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

48.  final def repr: C
    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

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

      (Since version 2.13.0) Use .iterator.sameElements instead

50.  def size: Int
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

51.  def sum(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).sum(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

52.  def to[C1](factory: Factory[A, C1]): C1
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).to(factory)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(factory) instead

53.  final def to(to: A): C

    Create a range projection of this collection with no lower-bound.

    Create a range projection of this collection with no lower-bound.

    to

      The upper-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeTo

54.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toArray(arg0)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

55.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

56.  def toIndexedSeq: IndexedSeq[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

57.  final def toIterable: Iterable[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

58.  def toIterator: Iterator[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

59.  final def toIterator: Iterator[A]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

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

60.  def toList: immutable.List[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(List) instead

61.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toMap(ev)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Map) instead

62.  def toSeq: immutable.Seq[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Seq) instead

63.  def toSet[B >: A]: immutable.Set[B]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Set) instead

64.  def toStream: immutable.Stream[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(LazyList) instead

65.  final def toStream: immutable.Stream[A]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .to(LazyList) instead of .toStream

66.  final def toTraversable: Traversable[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

67.  final def toTraversable: Traversable[A]

    Converts this set to an unspecified Iterable.

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

    returns

      An Iterable containing all elements of this set.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

68.  def toVector: immutable.Vector[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Vector) instead

69.  final def until(until: A): C

    Creates a ranged projection of this collection with no lower-bound.

    Creates a ranged projection of this collection with no lower-bound.

    until

      The upper-bound (exclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeUntil

70.  def view(from: Int, until: Int): View[A]

    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
    Deprecated

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

71.  def withFilter(f: (A) => Boolean): Iterator[A]
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (strictOptimizedSortedSetOps: IterableOnceExtensionMethods[A]).withFilter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.withFilter(...) instead

72.  def →[B](y: B): (StrictOptimizedSortedSetOps[A, CC, C], B)
    Implicit
      This member is added by an implicit conversion from StrictOptimizedSortedSetOps[A, CC, C] toArrowAssoc[StrictOptimizedSortedSetOps[A, CC, C]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use `->` instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

### Inherited from StrictOptimizedSetOps[A, Set, C]

### Inherited from StrictOptimizedIterableOps[A, Set, C]

### Inherited from SortedSetOps[A, CC, C]

### Inherited from SortedOps[A, C]

### Inherited from SetOps[A, Set, C]

### Inherited from (A) => Boolean

### Inherited from IterableOps[A, Set, C]

### Inherited from IterableOnceOps[A, Set, C]

### Inherited from IterableOnce[A]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion iterableOnceExtensionMethods fromStrictOptimizedSortedSetOps[A, CC, C] to IterableOnceExtensionMethods[A]

### Inherited by implicit conversion any2stringadd fromStrictOptimizedSortedSetOps[A, CC, C] to any2stringadd[StrictOptimizedSortedSetOps[A, CC, C]]

### Inherited by implicit conversion StringFormat fromStrictOptimizedSortedSetOps[A, CC, C] to StringFormat[StrictOptimizedSortedSetOps[A, CC, C]]

### Inherited by implicit conversion Ensuring fromStrictOptimizedSortedSetOps[A, CC, C] to Ensuring[StrictOptimizedSortedSetOps[A, CC, C]]

### Inherited by implicit conversion ArrowAssoc fromStrictOptimizedSortedSetOps[A, CC, C] to ArrowAssoc[StrictOptimizedSortedSetOps[A, CC, C]]

### Ungrouped