Packages

t

scala.collection.immutable

StrictOptimizedSortedSetOps

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

Source
SortedSet.scala
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StrictOptimizedSortedSetOps
  2. StrictOptimizedSetOps
  3. StrictOptimizedSortedSetOps
  4. StrictOptimizedSetOps
  5. StrictOptimizedIterableOps
  6. SortedSetOps
  7. SortedSetOps
  8. SortedOps
  9. SetOps
  10. SetOps
  11. Function1
  12. IterableOps
  13. IterableOnceOps
  14. IterableOnce
  15. AnyRef
  16. 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 excl(elem: A): C

    Creates a new set with a given element removed from this set.

    Creates a new set with a given element removed from this set.

    elem

    the element to be removed

    returns

    a new set that contains all elements of this set but that does not contain elem.

    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 incl(elem: A): C

    Creates a new set with an additional element, unless the element is already present.

    Creates a new set with an additional element, unless the element is already present.

    elem

    the element to be added

    returns

    a new set that contains all elements of this set and that also contains elem.

    Definition Classes
    SetOps
  6. abstract def iterableFactory: IterableFactory[[_]Set[_]]

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

    The companion object of this immutable sorted 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).

  7. abstract def iterator: Iterator[A]

    An scala.collection.Iterator over the elements of this immutable sorted set.

    An scala.collection.Iterator over the elements of this immutable sorted set.

    If an IterableOnce object is in fact an scala.collection.Iterator, this method always returns itself, in its current state, but if it is an scala.collection.Iterable, this method always returns a new scala.collection.Iterator.

    Definition Classes
    IterableOnce
  8. 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
  9. 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.

  10. abstract def ordering: Ordering[A]
    Definition Classes
    SortedOps
  11. 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
  12. 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).

  13. abstract def unsorted: Set[A]
    Definition Classes
    SortedSetOpsSortedSetOps
  14. abstract def toIterable: collection.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: collection.Set[A]): C

    Alias for intersect

    Alias for intersect

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

    Alias for diff

    Alias for diff

    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def +(elem: A): C

    Alias for incl

    Alias for incl

    Definition Classes
    SetOpsSetOps
  6. final def ++(that: IterableOnce[A]): C

    Alias for concat

    Alias for concat

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

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  8. final def -(elem: A): C

    Alias for excl

    Alias for excl

    Definition Classes
    SetOpsSetOps
    Annotations
    @inline()
  9. final def --(that: IterableOnce[A]): C

    Alias for removedAll

    Alias for removedAll

    Definition Classes
    SetOpsSetOps
  10. 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()
  11. 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
  12. final def addString(b: mutable.StringBuilder): b.type

    Appends all elements of this immutable sorted set to a string builder.

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

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

    Appends all elements of this immutable sorted 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 immutable sorted 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()
  14. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

    Appends all elements of this immutable sorted 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 immutable sorted 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
  15. 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()
  16. 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
    SetOpsFunction1
    Annotations
    @inline()
  17. 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.

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

  19. 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 immutable sorted set on which the function is defined.

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the immutable sorted set.

    returns

    a new immutable sorted 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
    StrictOptimizedSortedSetOpsSortedSetOps
  20. def collect[B](pf: PartialFunction[A, B]): Set[B]

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

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

    B

    the element type of the returned immutable sorted set.

    pf

    the partial function which filters and maps the immutable sorted set.

    returns

    a new immutable sorted 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
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  21. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

    Finds the first element of the immutable sorted 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)

  22. 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()
  23. def concat(that: IterableOnce[A]): C

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

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

    This method takes a collection of elements and adds all elements, omitting duplicates, into immutable sorted 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 immutable sorted set with the given elements added, omitting duplicates.

    Definition Classes
    StrictOptimizedSetOpsStrictOptimizedSetOpsSetOps
  24. def concat[B >: A](suffix: IterableOnce[B]): Set[B]

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

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

    B

    the element type of the returned collection.

    suffix

    the iterable to append.

    returns

    a new immutable sorted set which contains all elements of this immutable sorted set followed by all elements of suffix.

    Definition Classes
    IterableOps
  25. 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 immutable sorted set.

    Copying will stop once either all the elements of this immutable sorted 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.

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

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

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

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

    Copying will stop once either all the elements of this immutable sorted 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.

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

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

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

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

    Copying will stop once either all the elements of this immutable sorted 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.

  28. 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
  29. def count(p: (A) => Boolean): Int

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

    Counts the number of elements in the immutable sorted 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
  30. def diff(that: collection.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
    SetOpsSetOps
  31. def drop(n: Int): C

    Selects all elements except the first n ones.

    Selects all elements except the 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 immutable sorted set.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  32. 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 immutable sorted set.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  33. def dropWhile(p: (A) => Boolean): C

    Selects all elements except the longest prefix that satisfies a predicate.

    Selects all elements except the longest prefix that satisfies a predicate.

    The matching prefix starts with the first element of this immutable sorted set, and the element following the prefix is the first element that does not satisfy the predicate. The matching prefix may be empty, so that this method returns the entire immutable sorted set.

    Example:

    scala> List(1, 2, 3, 100, 4).dropWhile(n => n < 10)
    val res0: List[Int] = List(100, 4)
    
    scala> List(1, 2, 3, 100, 4).dropWhile(n => n == 0)
    val res1: List[Int] = List(1, 2, 3, 100, 4)

    Use span to obtain both the prefix and suffix. Use filterNot to drop all elements that satisfy the 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 immutable sorted set whose first element does not satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  34. 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
  35. 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
  36. 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
  37. 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
  38. 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
  39. 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
  40. 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
  41. def exists(p: (A) => Boolean): Boolean

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

    Tests whether a predicate holds for at least one element of this immutable sorted 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 immutable sorted set, otherwise false

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

    Selects all elements of this immutable sorted set which satisfy a predicate.

    Selects all elements of this immutable sorted set which satisfy a predicate.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  43. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): C
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  44. def filterNot(pred: (A) => Boolean): C

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  45. 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

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

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

    Finds the first element of the immutable sorted 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 immutable sorted set that satisfies p, or None if none exists.

    Definition Classes
    IterableOnceOps
  47. def firstKey: A

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
    SortedSetOpsSortedOps
  48. 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 immutable sorted set and using the elements of the resulting collections.

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

    Definition Classes
    StrictOptimizedSortedSetOpsSortedSetOps
  49. def flatMap[B](f: (A) => IterableOnce[B]): Set[B]

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

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  50. def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Set[B]

    Converts this immutable sorted set of iterable collections into a immutable sorted set formed by the elements of these iterable collections.

    Converts this immutable sorted set of iterable collections into a immutable sorted set formed by the elements of these iterable collections.

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

    returns

    a new immutable sorted set resulting from concatenating all element immutable sorted sets.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  51. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1

    Applies the given binary operator op to the given initial value z and all elements of this immutable sorted set.

    Applies the given binary operator op to the given initial value z and all elements of this immutable sorted set.

    For each application of the operator, each operand is either an element of this immutable sorted set, the initial value, or another such application of the operator.

    The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation. The initial value may be used an arbitrary number of times, but at least once.

    If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative. In either case, it is also necessary that the initial value be a neutral value for the operator, e.g. Nil for List concatenation or 1 for multiplication.

    The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

    Note: will not terminate for infinite-sized collections.

    A1

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

    z

    An initial value; may be used an arbitrary number of times in the computation of the result; must be a neutral value for op for the result to always be the same across runs.

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of applying op between all the elements and z, or z if this immutable sorted set is empty.

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

    Applies the given binary operator op to the given initial value z and all elements of this immutable sorted set, going left to right.

    Applies the given binary operator op to the given initial value z and all elements of this immutable sorted set, going left to right. Returns the initial value if this immutable sorted set is empty.

    "Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this immutable sorted set, the result is op( op( ... op( op(z, x1), x2) ... ), xn).

    If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the initial value, and each other left operand is itself an application of the operator. The elements of this immutable sorted set and the initial value all appear exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator.

    z

    An initial value.

    op

    A binary operator.

    returns

    The result of applying op to z and all elements of this immutable sorted set, going left to right. Returns z if this immutable sorted set is empty.

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

    Applies the given binary operator op to all elements of this immutable sorted set and the given initial value z, going right to left.

    Applies the given binary operator op to all elements of this immutable sorted set and the given initial value z, going right to left. Returns the initial value if this immutable sorted set is empty.

    "Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this immutable sorted set, the result is op(x1, op(x2, op( ... op(xn, z) ... ))).

    If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the initial value, and each other right operand is itself an application of the operator. The elements of this immutable sorted set and the initial value all appear exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator.

    z

    An initial value.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this immutable sorted set and z, going right to left. Returns z if this immutable sorted set is empty.

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

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  55. def foreach[U](f: (A) => U): Unit

    Applies f to each element for its side effects.

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

    Definition Classes
    IterableOnceOps
  56. 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()
  57. def groupBy[K](f: (A) => K): Map[K, C]

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

    Partitions this immutable sorted set into a map of immutable sorted 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 immutable sorted 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 immutable sorted set of those elements x for which f(x) equals k.

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

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

    Partitions this immutable sorted set into a map of immutable sorted 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
  59. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]

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

    Partitions this immutable sorted 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
  60. def grouped(size: Int): Iterator[C]

    Partitions elements in fixed size immutable sorted sets.

    Partitions elements in fixed size immutable sorted sets.

    size

    the number of elements per group

    returns

    An iterator producing immutable sorted 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

  61. 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()
  62. def head: A

    Selects the first element of this immutable sorted set.

    Selects the first element of this immutable sorted set.

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

    returns

    the first element of this immutable sorted set.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException if the immutable sorted set is empty.

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

    Definition Classes
    IterableOps
  64. 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
  65. def inits: Iterator[C]

    Iterates over the inits of this immutable sorted set.

    Iterates over the inits of this immutable sorted set. The first value will be this immutable sorted set and the final one will be an empty immutable sorted 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 immutable sorted set

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

  66. def intersect(that: collection.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
  67. def isEmpty: Boolean

    Tests whether the immutable sorted set is empty.

    Tests whether the immutable sorted set is empty.

    Note: The default implementation creates and discards an iterator.

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

    returns

    true if the immutable sorted set contains no elements, false otherwise.

    Definition Classes
    IterableOnceOps
  68. 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.

  69. def isTraversableAgain: Boolean

    Tests whether this immutable sorted set can be repeatedly traversed.

    Tests whether this immutable sorted 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
    IterableOpsIterableOnceOps
  70. def knownSize: Int

    The number of elements in this immutable sorted set, if it can be cheaply computed, -1 otherwise.

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

    Definition Classes
    IterableOnce
  71. 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 immutable sorted set.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException If the immutable sorted set is empty.

  72. def lastKey: A

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
    SortedSetOpsSortedOps
  73. 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 immutable sorted set$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  74. 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 immutable sorted set.

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedSortedSetOpsSortedSetOps
  75. def map[B](f: (A) => B): Set[B]

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

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

    B

    the element type of the returned immutable sorted set.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  76. 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 immutable sorted set with respect to the ordering ord.

    Definition Classes
    SortedSetOpsIterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

  77. 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
  78. def maxBy[B](f: (A) => B)(implicit ord: 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.

    returns

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

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

  79. def maxByOption[B](f: (A) => B)(implicit ord: 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.

    returns

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

    Definition Classes
    IterableOnceOps
  80. 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 immutable sorted set with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  81. 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 immutable sorted set with respect to the ordering ord.

    Definition Classes
    SortedSetOpsIterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

  82. 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
  83. def minBy[B](f: (A) => B)(implicit ord: 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.

    returns

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

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

  84. def minByOption[B](f: (A) => B)(implicit ord: 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.

    returns

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

    Definition Classes
    IterableOnceOps
  85. 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 immutable sorted set with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  86. final def mkString: String

    Displays all elements of this immutable sorted set in a string.

    Displays all elements of this immutable sorted set in a string.

    Delegates to addString, which can be overridden.

    returns

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

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

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

    Displays all elements of this immutable sorted 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 immutable sorted set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable sorted set are separated by the string sep.

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

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

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

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

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

  89. 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
  90. def nonEmpty: Boolean

    Tests whether the immutable sorted set is not empty.

    Tests whether the immutable sorted set is not empty.

    returns

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

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

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

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

    The two immutable sorted set correspond to the result of filter and filterNot, respectively.

    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
    StrictOptimizedIterableOpsIterableOps
  94. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Set[A1], Set[A2])

    Applies a function f to each element of the immutable sorted set and returns a pair of immutable sorted 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 immutable sorted set and returns a pair of immutable sorted 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 = `immutable.SortedSet`(1, "one", 2, "two", 3, "three") partitionMap {
     case i: Int => Left(i)
     case s: String => Right(s)
    }
    // xs == (`immutable.SortedSet`(1, 2, 3),
    //        `immutable.SortedSet`(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 immutable sorted set to an scala.util.Either

    returns

    a pair of immutable sorted 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
    StrictOptimizedIterableOpsIterableOps
  95. def product[B >: A](implicit num: math.Numeric[B]): B

    Multiplies together the elements of this collection.

    Multiplies together the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

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

    Definition Classes
    IterableOnceOps
  96. 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
  97. 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
  98. 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
    SortedSetOpsSortedOps
  99. 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
  100. def reduce[B >: A](op: (B, B) => B): B

    Applies the given binary operator op to all elements of this immutable sorted set.

    Applies the given binary operator op to all elements of this immutable sorted set.

    For each application of the operator, each operand is either an element of this immutable sorted set or another such application of the operator. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

    If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

    Note: will not terminate for infinite-sized collections.

    B

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

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of applying op between all the elements if the immutable sorted set is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

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

    Applies the given binary operator op to all elements of this immutable sorted set, going left to right.

    Applies the given binary operator op to all elements of this immutable sorted set, going left to right.

    "Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this immutable sorted set, the result is op( op( op( ... op(x1, x2) ... ), xn-1), xn).

    If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the first element of this immutable sorted set and each other left operand is itself an application of the operator. Each element appears exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this immutable sorted set, going left to right.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

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

    If this immutable sorted set is nonempty, reduces it with the given binary operator op, going left to right.

    If this immutable sorted set is nonempty, reduces it with the given binary operator op, going left to right.

    The behavior is the same as reduceLeft except that the value is None if the immutable sorted set is empty. Each element appears exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of reducing this immutable sorted set with op going left to right if the immutable sorted set is nonempty, inside a Some, and None otherwise.

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

    If this immutable sorted set is nonempty, reduces it with the given binary operator op.

    If this immutable sorted set is nonempty, reduces it with the given binary operator op.

    The behavior is the same as reduce except that the value is None if the immutable sorted set is empty. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

    Note: will not terminate for infinite-sized collections.

    B

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

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of reducing this immutable sorted set with op if the immutable sorted set is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  104. def reduceRight[B >: A](op: (A, B) => B): B

    Applies the given binary operator op to all elements of this immutable sorted set, going right to left.

    Applies the given binary operator op to all elements of this immutable sorted set, going right to left.

    "Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this immutable sorted set, the result is op(x1, op(x2, op( ... op(xn-1, xn) ... ))).

    If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the last element of this immutable sorted set and each other right operand is itself an application of the operator. Each element appears exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this immutable sorted set, going right to left.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this immutable sorted set is empty.

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

    If this immutable sorted set is nonempty, reduces it with the given binary operator op, going right to left.

    If this immutable sorted set is nonempty, reduces it with the given binary operator op, going right to left.

    The behavior is the same as reduceRight except that the value is None if the immutable sorted set is empty. Each element appears exactly once in the computation.

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

    Note: will not terminate for infinite-sized collections.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of reducing this immutable sorted set with op going right to left if the immutable sorted set is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  106. def removedAll(that: IterableOnce[A]): C

    Creates a new immutable sorted set from this immutable sorted set by removing all elements of another collection.

    Creates a new immutable sorted set from this immutable sorted set by removing all elements of another collection.

    that

    the collection containing the elements to remove.

    returns

    a new immutable sorted set with the given elements removed, omitting duplicates.

    Definition Classes
    SetOps
  107. def reversed: collection.Iterable[A]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  108. 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 immutable sorted set containing the prefix scan of the elements in this immutable sorted set

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

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

    Produces a immutable sorted 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
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  110. 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
  111. def size: Int

    The size of this immutable sorted set.

    The size of this immutable sorted set.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this immutable sorted set.

    Definition Classes
    IterableOnceOps
  112. def sizeCompare(that: collection.Iterable[_]): Int

    Compares the size of this immutable sorted set to the size of another Iterable.

    Compares the size of this immutable sorted set to the size of another Iterable.

    that

    the Iterable whose size is compared with this immutable sorted 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
  113. def sizeCompare(otherSize: Int): Int

    Compares the size of this immutable sorted set to a test value.

    Compares the size of this immutable sorted 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

  114. final def sizeIs: SizeCompareOps

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

    Returns a value class containing operations for comparing the size of this immutable sorted 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()
  115. def slice(from: Int, until: Int): C

    Selects an interval of elements.

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

    until

    the lowest index to EXCLUDE from this immutable sorted set.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  116. 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 immutable sorted 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. ,
    3. List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

    See also

    scala.collection.Iterator, method sliding

  117. 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 immutable sorted 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. ,
    3. List(1).sliding(2) = Iterator(List(1))

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

    6. ,
    7. List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

    See also

    scala.collection.Iterator, method sliding

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

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

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  119. def splitAt(n: Int): (C, C)

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

    Splits this immutable sorted 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 immutable sorted sets consisting of the first n elements of this immutable sorted set, and the other elements.

    Definition Classes
    IterableOpsIterableOnceOps
  120. 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.

    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
  121. 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()
  122. 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()
  123. 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()
  124. 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()
  125. 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()
  126. 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()
  127. def subsetOf(that: collection.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
  128. 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
  129. 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
  130. def sum[B >: A](implicit num: math.Numeric[B]): B

    Sums the elements of this collection.

    Sums the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

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

    Definition Classes
    IterableOnceOps
  131. 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
  132. def tail: C

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  133. def tails: Iterator[C]

    Iterates over the tails of this immutable sorted set.

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

    returns

    an iterator over all the tails of this immutable sorted set

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

  134. 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 immutable sorted set.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  135. 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 immutable sorted set.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  136. 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 immutable sorted set whose elements all satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  137. 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 immutable sorted set

    returns

    The same logical collection as this

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  138. def to[C1](factory: Factory[A, C1]): C1

    Given a collection factory factory, converts this immutable sorted set to the appropriate representation for the current element type A.

    Given a collection factory factory, converts this immutable sorted set 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
  139. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Converts this immutable sorted set to an Array.

    Converts this immutable sorted set to an Array.

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

    B

    The type of elements of the result, a supertype of A.

    returns

    This immutable sorted set as an Array[B].

    Definition Classes
    IterableOnceOps
  140. final def toBuffer[B >: A]: Buffer[B]

    Converts this immutable sorted set to a Buffer.

    Converts this immutable sorted set to a Buffer.

    B

    The type of elements of the result, a supertype of A.

    returns

    This immutable sorted set as a Buffer[B].

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  141. def toIndexedSeq: IndexedSeq[A]

    Converts this immutable sorted set to an IndexedSeq.

    Converts this immutable sorted set to an IndexedSeq.

    returns

    This immutable sorted set as an IndexedSeq[A].

    Definition Classes
    IterableOnceOps
  142. def toList: List[A]

    Converts this immutable sorted set to a List.

    Converts this immutable sorted set to a List.

    returns

    This immutable sorted set as a List[A].

    Definition Classes
    IterableOnceOps
  143. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]

    Converts this immutable sorted set to a Map, given an implicit coercion from the immutable sorted set's type to a key-value tuple.

    Converts this immutable sorted set to a Map, given an implicit coercion from the immutable sorted set's type to a key-value tuple.

    K

    The key type for the resulting map.

    V

    The value type for the resulting map.

    ev

    An implicit coercion from A to [K, V].

    returns

    This immutable sorted set as a Map[K, V].

    Definition Classes
    IterableOnceOps
  144. def toSeq: Seq[A]

    returns

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

    Definition Classes
    IterableOnceOps
  145. def toSet[B >: A]: Set[B]

    Converts this immutable sorted set to a Set.

    Converts this immutable sorted set to a Set.

    B

    The type of elements of the result, a supertype of A.

    returns

    This immutable sorted set as a Set[B].

    Definition Classes
    IterableOnceOps
  146. 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
  147. def toVector: Vector[A]

    Converts this immutable sorted set to a Vector.

    Converts this immutable sorted set to a Vector.

    returns

    This immutable sorted set as a Vector[A].

    Definition Classes
    IterableOnceOps
  148. def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Set[Set[B]]

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

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

    The resulting collection's type will be guided by the static type of immutable sorted 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 immutable sorted set is an Iterable.

    returns

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

    Definition Classes
    IterableOps
    Exceptions thrown

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

  149. final def union(that: collection.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()
  150. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Set[A1], Set[A2])

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

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

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

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  151. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

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

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

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  152. def view: View[A]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    IterableOps
  153. final def wait(): Unit

    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

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

    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

  155. final def wait(arg0: Long): Unit

    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

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

    Creates a non-strict filter of this immutable sorted set.

    Creates a non-strict filter of this immutable sorted 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 immutable sorted set which satisfy the predicate p.

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

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

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

    Definition Classes
    StrictOptimizedSortedSetOpsSortedSetOps
  158. def zip[B](that: IterableOnce[B]): Set[(A, B)]

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

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  159. def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]

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

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

    thatElem

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

    returns

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

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

    Zips this immutable sorted set with its indices.

    Zips this immutable sorted set with its indices.

    returns

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

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

  161. final def |(that: collection.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 ++:[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

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

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

  5. 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 /:

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

  7. 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 :\

  8. def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    Since this method degenerates to foldLeft for sequential (non-parallel) collections, where the combining operation is ignored, it is advisable to prefer foldLeft for that case.

    For parallel collections, use the aggregate method specified by scala.collection.parallel.ParIterableLike.

    B

    the result type, produced by seqop, combop, and by this function as a final result.

    z

    the start value, a neutral element for seqop.

    seqop

    the binary operator used to accumulate the result.

    combop

    an associative operator for combining sequential results, unused for sequential collections.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.

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

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  26. def hasDefiniteSize: Boolean

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

    Tests whether this immutable sorted 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

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

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

    (Since version 2.13.0) Use iteratorFrom instead.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  53. def toIndexedSeq: collection.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

  54. final def toIterable: collection.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

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

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

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

  57. def toList: 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

  58. def toMap[K, V](implicit ev: <:<[A, (K, V)]): 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

  59. def toSeq: 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

  60. def toSet[B >: A]: 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

  61. def toStream: 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

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

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

  63. final def toTraversable: collection.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

  64. final def toTraversable: collection.Traversable[A]

    Converts this immutable sorted set to an unspecified Iterable.

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

    returns

    An Iterable containing all elements of this immutable sorted 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

  65. def toVector: 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

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

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

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

  69. 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 collection.StrictOptimizedSetOps[A, [_]Set[_], C]

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

Inherited from SortedSetOps[A, CC, C]

Inherited from collection.SortedSetOps[A, CC, C]

Inherited from SortedOps[A, C]

Inherited from SetOps[A, Set, C]

Inherited from collection.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