sealed class TreeSet[A] extends SortedSet[A] with SortedSetOps[A, TreeSet, TreeSet[A]] with StrictOptimizedIterableOps[A, Set, TreeSet[A]] with Serializable

A mutable sorted set implemented using a mutable red-black tree as underlying data structure.

A

the type of the keys contained in this tree set.

Annotations
@SerialVersionUID()
Version

2.12

Since

2.10

Linear Supertypes
Serializable, Serializable, StrictOptimizedIterableOps[A, Set, TreeSet[A]], SortedSet[A], SortedSetOps[A, TreeSet, TreeSet[A]], collection.SortedSet[A], collection.SortedSetOps[A, TreeSet, TreeSet[A]], SortedOps[A, TreeSet[A]], Set[A], Shrinkable[A], SetOps[A, Set, TreeSet[A]], collection.Set[A], collection.SetOps[A, Set, TreeSet[A]], Equals, (A) ⇒ Boolean, GrowableIterable[A], Growable[A], Iterable[A], IterableOps[A, Set, TreeSet[A]], collection.Iterable[A], collection.IterableOps[A, Set, TreeSet[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeSet
  2. Serializable
  3. Serializable
  4. StrictOptimizedIterableOps
  5. SortedSet
  6. SortedSetOps
  7. SortedSet
  8. SortedSetOps
  9. SortedOps
  10. Set
  11. Shrinkable
  12. SetOps
  13. Set
  14. SetOps
  15. Equals
  16. Function1
  17. GrowableIterable
  18. Growable
  19. Iterable
  20. IterableOps
  21. Iterable
  22. IterableOps
  23. IterableOnce
  24. AnyRef
  25. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TreeSet()(implicit ord: Ordering[A])

    Creates an empty TreeSet.

    Creates an empty TreeSet.

    ord

    the implicit ordering used to compare objects of type A.

    returns

    an empty TreeSet.

Type Members

  1. class WithFilter extends AnyRef

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    Definition Classes
    IterableOps
  2. class SortedWithFilter extends WithFilter

    Specialize WithFilter for sorted collections

    Specialize WithFilter for sorted collections

    Definition Classes
    SortedSetOps

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: collection.Set[A]): TreeSet[A]

    Alias for intersect

    Alias for intersect

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

    Alias for diff

    Alias for diff

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

    Alias for concat

    Alias for concat

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

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++:[B >: A](prefix: collection.Iterable[B]): Set[B]

    Alias for prependAll

    Alias for prependAll

    Definition Classes
    IterableOps
    Annotations
    @inline()
  8. final def ++=(xs: IterableOnce[A]): TreeSet.this.type

    Alias for addAllInPlace

    Alias for addAllInPlace

    Definition Classes
    Growable
    Annotations
    @inline()
  9. final def +=(elem1: A, elem2: A, elems: A*): TreeSet.this.type

    ${Add}s two or more elements to this $coll.

    ${Add}s two or more elements to this $coll.

    elem1

    the first element to $add.

    elem2

    the second element to $add.

    elems

    the remaining elements to $add.

    returns

    the $coll itself

    Definition Classes
    Growable
    Annotations
    @inline()
  10. final def +=(elem: A): TreeSet.this.type

    Alias for add

    Alias for add

    Definition Classes
    Growable
    Annotations
    @inline()
  11. final def --=(xs: IterableOnce[A]): TreeSet.this.type

    Alias for subtractAll

    Alias for subtractAll

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  12. final def -=(elem1: A, elem2: A, elems: A*): TreeSet.this.type

    Alias for subtract

    Alias for subtract

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  13. final def -=(elem: A): TreeSet.this.type

    Alias for subtract

    Alias for subtract

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def add(elem: A): TreeSet.this.type

    ${Add}s a single element to this mutable tree set.

    ${Add}s a single element to this mutable tree set.

    elem

    the element to $add.

    returns

    the mutable tree set itself

    Definition Classes
    TreeSet → Growable
  16. def addAll(xs: IterableOnce[A]): TreeSet.this.type

    ${Add}s all elements produced by a TraversableOnce to this $coll.

    ${Add}s all elements produced by a TraversableOnce to this $coll.

    xs

    the TraversableOnce producing the elements to $add.

    returns

    the $coll itself.

    Definition Classes
    Growable
  17. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  18. final def apply(elem: A): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

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

    elem

    the element to test for membership.

    returns

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

    Definition Classes
    SetOps → Function1
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def canEqual(that: Any): Boolean
    Definition Classes
    SetOps → Equals
  21. def className: String

    The class name of this collection.

    The class name of this collection. To be used for converting to string. Collections generally print like this:

    <className>(elem_1, ..., elem_n)

    Definition Classes
    TreeSet → IterableOps
  22. def clear(): Unit

    Clears the mutable tree set's contents.

    Clears the mutable tree set's contents. After this operation, the mutable tree set is empty.

    Definition Classes
    TreeSet → Growable
  23. def clone(): TreeSet[A]
    Definition Classes
    SetOps → AnyRef
  24. def coll: TreeSet.this.type

    The collection itself

    The collection itself

    Attributes
    protected[this]
    Definition Classes
    Iterable → IterableOps
  25. def collect[B](pf: PartialFunction[A, B])(implicit arg0: Ordering[B]): TreeSet[B]
    Definition Classes
    SortedSetOps
  26. def collect[B](pf: PartialFunction[A, B]): Set[B]
    Definition Classes
    IterableOps
  27. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def concat(that: IterableOnce[A]): TreeSet[A]

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

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

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

    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 $coll with the given elements added, omitting duplicates.

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

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

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

    B

    the element type of the returned collection.

    suffix

    the traversable to append.

    returns

    a new collection of type CC[B] which contains all elements of this $coll followed by all elements of suffix.

    Definition Classes
    IterableOps
  30. def contains(elem: A): Boolean
    Definition Classes
    TreeSet → SetOps
  31. def copyToArray[B >: A](xs: Array[B], start: Int = 0): xs.type

    Copy all elements of this collection to array xs, starting at start.

    Copy all elements of this collection to array xs, starting at start.

    Definition Classes
    IterableOps
  32. def count(p: (A) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOps
  33. def diff(that: collection.Set[A]): TreeSet[A]

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

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

    Definition Classes
    SetOps → SetOps
  34. def drop(n: Int): TreeSet[A]

    The rest of the collection without its n first elements.

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

    Definition Classes
    IterableOps
  35. def dropRight(n: Int): TreeSet[A]

    The rest of the collection without its n last elements.

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

    Definition Classes
    IterableOps
  36. def dropWhile(p: (A) ⇒ Boolean): TreeSet[A]

    Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.

    Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.

    p

    the predicate used to skip elements.

    returns

    an iterator consisting of the remaining elements

    Definition Classes
    IterableOps
    Note

    Reuse: $consumesAndProducesIterator

  37. def empty: TreeSet[A]

    The empty set of the same type as this set

    The empty set of the same type as this set

    returns

    an empty set of type C.

    Definition Classes
    TreeSet → SetOps
  38. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def equals(that: Any): Boolean
    Definition Classes
    SetOps → Equals → AnyRef → Any
  40. def exists(p: (A) ⇒ Boolean): Boolean

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

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

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  41. def filter(pred: (A) ⇒ Boolean): TreeSet[A]

    Selects all elements of this $coll which satisfy a predicate.

    Selects all elements of this $coll which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  42. def filterInPlace(p: (A) ⇒ Boolean): TreeSet.this.type
    Definition Classes
    SetOps
  43. def filterNot(pred: (A) ⇒ Boolean): TreeSet[A]

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  44. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. def find(p: (A) ⇒ Boolean): Option[A]

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

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

    $mayNotTerminateInf $orderDependent

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  46. def firstKey: A

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
    SortedSetOps → SortedOps
  47. def flatMap[B](f: (A) ⇒ IterableOnce[B])(implicit arg0: Ordering[B]): TreeSet[B]

    Flatmap

    Flatmap

    Definition Classes
    SortedSetOps
  48. def flatMap[B](f: (A) ⇒ IterableOnce[B]): Set[B]

    Flatmap

    Flatmap

    Definition Classes
    IterableOps
  49. def flatMapInPlace(f: (A) ⇒ IterableOnce[A]): TreeSet.this.type
    Definition Classes
    SetOps
  50. def flatten[B](implicit ev: (A) ⇒ IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
  51. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Fold left

    Fold left

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

    Fold right

    Fold right

    Definition Classes
    IterableOps
  53. def forall(p: (A) ⇒ Boolean): Boolean

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

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

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  54. def foreach[U](f: (A) ⇒ U): Unit

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

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

    Definition Classes
    TreeSet → IterableOps
  55. def fromIterable[E](it: collection.Iterable[E]): Set[E]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  56. def fromSpecificIterable(coll: collection.Iterable[A]): TreeSet[A]
    Attributes
    protected[this]
    Definition Classes
    TreeSet → IterableOps
  57. def get(elem: A): Option[A]

    elem

    The element to get.

    returns

    The reference of the contained element that is equal to elem, if found, otherwise None

    Definition Classes
    TreeSet → SetOps
  58. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  59. def groupBy[K](f: (A) ⇒ K): immutable.Map[K, TreeSet[A]]

    Partitions this $coll into a map of ${coll}s according to some discriminator function.

    Partitions this $coll into a map of ${coll}s according to some discriminator function.

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

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to ${coll}s 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 $coll of those elements x for which f(x) equals k.

    Definition Classes
    IterableOps
  60. def grouped(size: Int): Iterator[TreeSet[A]]

    Partitions elements in fixed size ${coll}s.

    Partitions elements in fixed size ${coll}s.

    size

    the number of elements per group

    returns

    An iterator producing ${coll}s 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
    Definition Classes
    SetOps → AnyRef → Any
  62. def head: A

    The first element of the collection.

    The first element of the collection.

    Definition Classes
    TreeSet → IterableOps
  63. def init: TreeSet[A]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Definition Classes
    IterableOps
  64. def insert(elem: A): Boolean
    Definition Classes
    SetOps
  65. def intersect(that: collection.Set[A]): TreeSet[A]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

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

    Definition Classes
    SetOps
  66. def isEmpty: Boolean

    Is the collection empty?

    Is the collection empty?

    Definition Classes
    TreeSet → IterableOps
  67. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  68. def iterableFactory: Set.type
    Definition Classes
    TreeSet → IterableOps
  69. def iterator(): Iterator[A]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    TreeSet → IterableOnce
  70. def keysIteratorFrom(start: A): Iterator[A]

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection.

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection. x.keysIteratorFrom(y) is equivalent to but often more efficient than x.from(y).keysIterator.

    start

    The lower bound (inclusive) on the keys to be returned

    Definition Classes
    TreeSet → SortedOps
  71. def knownSize: Int

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

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

    Definition Classes
    IterableOps
  72. def last: A

    Selects the last element.

    Selects the last element. $orderDependent

    returns

    The last element of this mutable tree set.

    Definition Classes
    TreeSet → IterableOps
    Exceptions thrown

    NoSuchElementException If the mutable tree set is empty.

  73. def lastKey: A

    Returns the last key of the collection.

    Returns the last key of the collection.

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

    Optionally selects the last element.

    Optionally selects the last element. $orderDependent

    returns

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

    Definition Classes
    IterableOps
  75. def map[B](f: (A) ⇒ B)(implicit arg0: Ordering[B]): TreeSet[B]

    Map

    Map

    Definition Classes
    SortedSetOps
  76. def map[B](f: (A) ⇒ B): Set[B]

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

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    IterableOps
  77. def mapInPlace(f: (A) ⇒ A): TreeSet.this.type
    Definition Classes
    SetOps
  78. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable tree set.

    Definition Classes
    IterableOps
    Full Signature

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

  79. def maxBy[B](f: (A) ⇒ B): A

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

    [use case]

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

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOps
    Full Signature

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

  80. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable tree set

    Definition Classes
    IterableOps
    Full Signature

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

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

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

    [use case]

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

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOps
    Full Signature

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

  82. def mkString: String
    Definition Classes
    IterableOps
  83. def mkString(sep: String): String
    Definition Classes
    IterableOps
  84. def mkString(start: String, sep: String, end: String): String

    A string showing all elements of this collection, separated by string sep.

    A string showing all elements of this collection, separated by string sep.

    Definition Classes
    IterableOps
  85. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  86. def newSpecificBuilder(): Builder[A, TreeSet[A]]

    returns

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

    Attributes
    protected[this]
    Definition Classes
    TreeSet → IterableOps
  87. def nonEmpty: Boolean

    Is the collection not empty?

    Is the collection not empty?

    Definition Classes
    IterableOps
  88. final def notify(): Unit
    Definition Classes
    AnyRef
  89. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  90. implicit val ordering: Ordering[A]
    Definition Classes
    TreeSet → SortedOps
  91. def partition(p: (A) ⇒ Boolean): (TreeSet[A], TreeSet[A])

    Optimized, push-based version of partition.

    Optimized, push-based version of partition.

    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  92. def prependAll[B](that: <error>): <error>

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

    [use case]

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

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

    Example:

    scala> val x = List(1)
x: List[Int] = List(1)

scala> val y = Vector(2)
y: scala.collection.immutable.Vector[Int] = Vector(2)

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

    the element type of the returned collection.

    returns

    a new mutable tree set which contains all elements of prefix followed by all the elements of this mutable tree set.

    Definition Classes
    IterableOps
    Full Signature

    def prependAll[B >: A](prefix: collection.Iterable[B]): Set[B]

  93. def product: A

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Definition Classes
    IterableOps
    Full Signature

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

  94. def range(from: A, until: A): TreeSet[A]

    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
  95. def rangeImpl(from: Option[A], until: Option[A]): TreeSet[A]

    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
    TreeSet → SortedOps
  96. def reduce[B >: A](op: (B, B) ⇒ B): B

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

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

    $undefinedorder

    B

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

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the $coll is nonempty.

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    IterableOps
  99. def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]

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

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

    $undefinedorder

    B

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

    op

    A binary operator that must be associative.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

    Definition Classes
    IterableOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    IterableOps
  102. def remove(elem: A): Option[A]
    Definition Classes
    SetOps
  103. def reversed: collection.Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  104. 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 $coll containing the prefix scan of the elements in this $coll

    Definition Classes
    IterableOps
  105. def scanLeft[B](z: B)(op: (B, A) ⇒ B): Set[B]

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

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

    $willNotTerminateInf $orderDependent

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  106. def 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. $willNotTerminateInf $orderDependent

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

    The number of elements in this collection.

    The number of elements in this collection. Does not terminate for infinite collections.

    Definition Classes
    TreeSet → IterableOps
  108. def slice(from: Int, until: Int): TreeSet[A]

    Selects an interval of elements.

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

    from <= indexOf(x) < until

    $orderDependent

    from

    the lowest index to include from this $coll.

    until

    the lowest index to EXCLUDE from this $coll.

    returns

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

    Definition Classes
    IterableOps
  109. def sliding(size: Int, step: Int): Iterator[TreeSet[A]]

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

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

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups

    returns

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

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  110. def sliding(size: Int): Iterator[TreeSet[A]]

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

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

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  111. def sortedFromIterable[B](it: collection.Iterable[B])(implicit arg0: Ordering[B]): TreeSet[B]
    Attributes
    protected[this]
    Definition Classes
    TreeSet → SortedSetOps
  112. def sortedIterableFactory: TreeSet.type
    Definition Classes
    TreeSet → SortedSetOps
  113. def span(p: (A) ⇒ Boolean): (TreeSet[A], TreeSet[A])

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

    Splits this $coll 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. $orderDependent

    p

    the test predicate

    returns

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

    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  114. def splitAt(n: Int): (TreeSet[A], TreeSet[A])

    Splits this $coll into two at a given position.

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

    n

    the position at which to split.

    returns

    a pair of ${coll}s consisting of the first n elements of this $coll, and the other elements.

    Definition Classes
    IterableOps
  115. 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
  116. def subsets(): Iterator[TreeSet[A]]

    An iterator over all subsets of this set.

    An iterator over all subsets of this set.

    returns

    the iterator.

    Definition Classes
    SetOps
  117. def subsets(len: Int): Iterator[TreeSet[A]]

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

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

    len

    the size of the subsets.

    returns

    the iterator.

    Definition Classes
    SetOps
  118. def subtract(elem: A): TreeSet.this.type

    Removes a single element from this mutable tree set.

    Removes a single element from this mutable tree set.

    elem

    the element to remove.

    returns

    the mutable tree set itself

    Definition Classes
    TreeSet → Shrinkable
  119. def subtract(elem1: A, elem2: A, elems: A*): TreeSet.this.type

    Removes two or more elements from this shrinkable collection.

    Removes two or more elements from this shrinkable collection.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  120. def subtractAll(xs: IterableOnce[A]): TreeSet.this.type

    Removes all elements produced by an iterator from this shrinkable collection.

    Removes all elements produced by an iterator from this shrinkable collection.

    xs

    the iterator producing the elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  121. def sum: A

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

    [use case]

    Sums up the elements of this collection.

    returns

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

    Definition Classes
    IterableOps
    Full Signature

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

  122. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  123. def tail: TreeSet[A]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  124. def take(n: Int): TreeSet[A]

    A collection containing the first n elements of this collection.

    A collection containing the first n elements of this collection.

    Definition Classes
    IterableOps
  125. def takeRight(n: Int): TreeSet[A]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Definition Classes
    IterableOps
  126. def takeWhile(p: (A) ⇒ Boolean): TreeSet[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate. $orderDependent

    p

    The predicate used to test elements.

    returns

    the longest prefix of this $coll whose elements all satisfy the predicate p.

    Definition Classes
    IterableOps
  127. def to[C1](f: CanBuild[A, C1]): C1

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

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

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

    Definition Classes
    IterableOps
  128. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOps
  129. def toString(): String
    Definition Classes
    SetOps → Function1 → IterableOps → AnyRef → Any
  130. def unconstrained: collection.Set[A]
  131. final def union(that: IterableOnce[A]): TreeSet[A]

    Computes the union between of set and another set.

    Computes the union between of set and another set.

    that

    the set to form the union with.

    returns

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

    Definition Classes
    SetOps
    Annotations
    @inline()
  132. def unzip[A1, A2](implicit asPair: <:<[A, (A1, A2)]): (Set[A1], Set[A2])

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

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

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

    returns

    a pair of ${coll}s, containing the first, respectively second half of each element pair of this $coll.

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

    A view representing the elements of this collection.

    A view representing the elements of this collection.

    Definition Classes
    IterableOps
  134. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  135. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  136. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  137. def withFilter(p: (A) ⇒ Boolean): SortedWithFilter

    Creates a non-strict filter of this $coll.

    Creates a non-strict filter of this $coll.

    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. $orderDependent

    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 $coll which satisfy the predicate p.

    Definition Classes
    SortedSetOps → IterableOps
  138. def zip[B](xs: IterableOnce[B])(implicit ev: Ordering[(A, B)]): TreeSet[(A, B)]

    Zip.

    Zip. Interesting because it requires to align to source collections.

    Definition Classes
    SortedSetOps
  139. def zip[B](xs: IterableOnce[B]): Set[(A, B)]

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

    Returns a $coll formed from this $coll 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

    xs

    The iterable providing the second half of each result pair

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this $coll and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

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

    Zips this $coll with its indices.

    Zips this $coll with its indices.

    returns

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

    Definition Classes
    IterableOps
    Example:

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

  141. final def |(that: IterableOnce[A]): TreeSet[A]

    Alias for union

    Alias for union

    Definition Classes
    SetOps
    Annotations
    @inline()

Inherited from Serializable

Inherited from Serializable

Inherited from StrictOptimizedIterableOps[A, Set, TreeSet[A]]

Inherited from SortedSet[A]

Inherited from SortedSetOps[A, TreeSet, TreeSet[A]]

Inherited from collection.SortedSet[A]

Inherited from collection.SortedSetOps[A, TreeSet, TreeSet[A]]

Inherited from SortedOps[A, TreeSet[A]]

Inherited from Set[A]

Inherited from Shrinkable[A]

Inherited from SetOps[A, Set, TreeSet[A]]

Inherited from collection.Set[A]

Inherited from collection.SetOps[A, Set, TreeSet[A]]

Inherited from Equals

Inherited from (A) ⇒ Boolean

Inherited from GrowableIterable[A]

Inherited from Growable[A]

Inherited from Iterable[A]

Inherited from IterableOps[A, Set, TreeSet[A]]

Inherited from collection.Iterable[A]

Inherited from collection.IterableOps[A, Set, TreeSet[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped