scala.collection.immutable

TreeSet

class TreeSet [A] extends RedBlack[A] with SortedSet[A] with SortedSetLike[A, TreeSet[A]] with Serializable

This class implements immutable sets using a tree.

A

the type of the elements contained in this tree set

Annotations
@SerialVersionUID( uid = 234066569443569402L )
Source
TreeSet.scala
Version

2.0, 02/01/2007

Since

1

Linear Supertypes
SortedSet[A], SortedSet[A], SortedSetLike[A, TreeSet[A]], Sorted[A, TreeSet[A]], Set[A], Set[A], SetLike[A, TreeSet[A]], Subtractable[A, TreeSet[A]], GenSet[A], GenericSetTemplate[A, Set], GenSetLike[A, TreeSet[A]], (A) ⇒ Boolean, Iterable[A], Iterable[A], IterableLike[A, TreeSet[A]], Equals, GenIterable[A], GenIterableLike[A, TreeSet[A]], Traversable[A], Immutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Set], TraversableLike[A, TreeSet[A]], GenTraversableLike[A, TreeSet[A]], Parallelizable[A, ParSet[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, TreeSet[A]], HasNewBuilder[A, TreeSet[A]], RedBlack[A], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. TreeSet
  2. SortedSet
  3. SortedSet
  4. SortedSetLike
  5. Sorted
  6. Set
  7. Set
  8. SetLike
  9. Subtractable
  10. GenSet
  11. GenericSetTemplate
  12. GenSetLike
  13. Function1
  14. Iterable
  15. Iterable
  16. IterableLike
  17. Equals
  18. GenIterable
  19. GenIterableLike
  20. Traversable
  21. Immutable
  22. Traversable
  23. GenTraversable
  24. GenericTraversableTemplate
  25. TraversableLike
  26. GenTraversableLike
  27. Parallelizable
  28. TraversableOnce
  29. GenTraversableOnce
  30. FilterMonadic
  31. HasNewBuilder
  32. RedBlack
  33. Serializable
  34. Serializable
  35. AnyRef
  36. Any
Visibility
  1. Public
  2. All

Instance Constructors

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

  2. new TreeSet (size: Int, t: Tree[Unit])(implicit ordering: Ordering[A])

    ordering

    the implicit ordering used to compare objects of type A

Type Members

  1. case class BlackTree [+B] (key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product with Serializable

  2. class NonEmpty [+B] extends Tree[B] with Serializable

    Attributes
    abstract
  3. case class RedTree [+B] (key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product with Serializable

  4. type Self = TreeSet[A]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  5. class Tree [+B] extends Serializable

    Attributes
    abstract
  6. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

    Attributes
    final
    Definition Classes
    AnyRef
  2. def != (arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. 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.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def & (that: Set[A]): TreeSet[A]

    Definition Classes
    GenSetLike
    Annotations
    @bridge()
  5. def & (that: GenSet[A]): TreeSet[A]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    Note: Same as intersect.

    that

    the set to intersect with.

    returns

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

    Definition Classes
    GenSetLike
  6. def &~ (that: Set[A]): TreeSet[A]

    Definition Classes
    GenSetLike
    Annotations
    @bridge()
  7. def &~ (that: GenSet[A]): TreeSet[A]

    The difference of this set and another set.

    The difference of this set and another set.

    Note: Same as diff.

    that

    the set of elements to exclude.

    returns

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

    Definition Classes
    GenSetLike
  8. def + (elem: A): TreeSet[A]

    Creates a new TreeSet with the entry added.

    Creates a new TreeSet with the entry added.

    elem

    a new element to add.

    returns

    a new immutable tree set containing elem and all the elements of this immutable tree set.

    Definition Classes
    TreeSetSetLike → GenSetLike
  9. def + (elem1: A, elem2: A, elems: A*): TreeSet[A]

    Creates a new immutable tree set with additional elements.

    Creates a new immutable tree set with additional elements.

    This method takes two or more elements to be added. Another overloaded variant of this method handles the case where a single element is added.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new immutable tree set with the given elements added.

    Definition Classes
    SetLike
  10. def ++ (elems: TraversableOnce[A]): TreeSet[A]

    Definition Classes
    SetLike
    Annotations
    @bridge()
  11. def ++ (elems: GenTraversableOnce[A]): TreeSet[A]

    Creates a new immutable tree set by adding all elements contained in another collection to this immutable tree set.

    Creates a new immutable tree set by adding all elements contained in another collection to this immutable tree set.

    elems

    the collection containing the added elements.

    returns

    a new immutable tree set with the given elements added.

    Definition Classes
    SetLike
  12. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  13. def ++ [B] (that: GenTraversableOnce[B]): immutable.TreeSet[B]

    [use case] Concatenates this immutable tree set with the elements of a traversable collection.

    [use case]

    Concatenates this immutable tree set with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this immutable tree set followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  14. def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

    Concatenates this immutable tree set with the elements of a traversable collection.

    Concatenates this immutable tree set with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this immutable tree set followed by all elements of that.

    Definition Classes
    TraversableLike → GenTraversableLike
  15. def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

    Definition Classes
    TraversableLike
  16. def ++: [B] (that: TraversableOnce[B]): immutable.TreeSet[B]

    [use case] Concatenates this immutable tree set with the elements of a traversable collection.

    [use case]

    Concatenates this immutable tree set with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this immutable tree set followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  17. def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

    Concatenates this immutable tree set with the elements of a traversable collection.

    Concatenates this immutable tree set with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this immutable tree set followed by all elements of that.

    Definition Classes
    TraversableLike
  18. def - (elem: A): TreeSet[A]

    Creates a new TreeSet with the entry removed.

    Creates a new TreeSet with the entry removed.

    elem

    a new element to add.

    returns

    a new immutable tree set containing all the elements of this immutable tree set except elem.

    Definition Classes
    TreeSetSetLikeSubtractable → GenSetLike
  19. def - (elem1: A, elem2: A, elems: A*): TreeSet[A]

    Creates a new immutable tree set from this immutable tree set with some elements removed.

    Creates a new immutable tree set from this immutable tree set with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new immutable tree set that contains all elements of the current immutable tree set except one less occurrence of each of the given elements.

    Definition Classes
    Subtractable
  20. def -- (xs: TraversableOnce[A]): TreeSet[A]

    Definition Classes
    Subtractable
    Annotations
    @bridge()
  21. def -- (xs: GenTraversableOnce[A]): TreeSet[A]

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

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

    returns

    a new immutable tree set that contains all elements of the current immutable tree set except one less occurrence of each of the elements of elems.

    Definition Classes
    Subtractable
  22. def /: [B] (z: B)(op: (B, A) ⇒ B): B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable tree set, going left to right with the start value z on the left:

                op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  23. def /:\ [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  24. def :\ [B] (z: B)(op: (A, B) ⇒ B): B

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this immutable tree set, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  25. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  26. def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  27. object Empty extends Tree[Nothing] with Product with Serializable

  28. def addString (b: StringBuilder): StringBuilder

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

    Appends all elements of this immutable tree 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 tree set without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  29. def addString (b: StringBuilder, sep: String): StringBuilder

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

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

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  30. def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

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

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  31. 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.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  32. 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
  33. 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
    GenSetLike → Function1
  34. 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.

    Attributes
    final
    Definition Classes
    Any
  35. def canEqual (that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this immutable tree set should be compared

    returns

    true, if this immutable tree set can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  36. 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()
  37. def collect [B] (pf: PartialFunction[A, B]): immutable.TreeSet[B]

    [use case] Builds a new collection by applying a partial function to all elements of this immutable tree set on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this immutable tree 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 tree set.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  38. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

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

    pf

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

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  39. def collectFirst [B] (pf: PartialFunction[A, B]): Option[B]

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

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

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

  40. def companion : GenericCompanion[Set]

    The factory companion object that builds instances of class immutable.

    The factory companion object that builds instances of class immutable.TreeSet. (or its Iterable superclass where class immutable.TreeSet is not a Seq.)

    Definition Classes
    SetSetGenSetIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  41. def compare (k0: A, k1: A): Int

    Comparison function that orders keys.

    Comparison function that orders keys.

    Definition Classes
    Sorted
  42. 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
  43. def contains (elem: A): Boolean

    Checks if this set contains element elem.

    Checks if this set contains element elem.

    elem

    the element to check for membership.

    returns

    true, iff elem is contained in this set.

    Definition Classes
    TreeSetSetLike → GenSetLike
  44. def copyToArray (xs: Array[A], start: Int, len: Int): Unit

    [use case] Copies elements of this immutable tree set to an array.

    [use case]

    Copies elements of this immutable tree set to an array. Fills the given array xs with at most len elements of this immutable tree set, starting at position start. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  45. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this immutable tree set to an array.

    Copies elements of this immutable tree set to an array. Fills the given array xs with at most len elements of this immutable tree set, starting at position start. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  46. def copyToArray (xs: Array[A]): Unit

    [use case] Copies values of this immutable tree set to an array.

    [use case]

    Copies values of this immutable tree set to an array. Fills the given array xs with values of this immutable tree set. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached.

    xs

    the array to fill.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  47. def copyToArray [B >: A] (xs: Array[B]): Unit

    Copies values of this immutable tree set to an array.

    Copies values of this immutable tree set to an array. Fills the given array xs with values of this immutable tree set. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  48. def copyToArray (xs: Array[A], start: Int): Unit

    [use case] Copies values of this immutable tree set to an array.

    [use case]

    Copies values of this immutable tree set to an array. Fills the given array xs with values of this immutable tree set, beginning at index start. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  49. def copyToArray [B >: A] (xs: Array[B], start: Int): Unit

    Copies values of this immutable tree set to an array.

    Copies values of this immutable tree set to an array. Fills the given array xs with values of this immutable tree set, beginning at index start. Copying will stop once either the end of the current immutable tree set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  50. def copyToBuffer [B >: A] (dest: Buffer[B]): Unit

    Copies all elements of this immutable tree set to a buffer.

    Copies all elements of this immutable tree set to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  51. def count (p: (A) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  52. def diff (that: Set[A]): TreeSet[A]

    Definition Classes
    SetLike
    Annotations
    @bridge()
  53. def diff (that: GenSet[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
    SetLike → GenSetLike
  54. def drop (n: Int): TreeSet[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this immutable tree set.

    returns

    a immutable tree set consisting of all elements of this immutable tree set except the first n ones, or else the empty immutable tree set, if this immutable tree set has less than n elements.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  55. def dropRight (n: Int): TreeSet[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a immutable tree set consisting of all elements of this immutable tree set except the last n ones, or else the empty immutable tree set, if this immutable tree set has less than n elements.

    Definition Classes
    IterableLike
  56. def dropWhile (p: (A) ⇒ Boolean): TreeSet[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this immutable tree set whose first element does not satisfy the predicate p.

    Definition Classes
    TraversableLike → GenTraversableLike
  57. def empty : TreeSet[A]

    A factory to create empty sets of the same type of keys.

    A factory to create empty sets of the same type of keys.

    returns

    an empty set of type This.

    Definition Classes
    TreeSetSortedSetSortedSetSetLikeGenericSetTemplate
  58. def eq (arg0: AnyRef): Boolean

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

    Tests whether the argument (arg0) 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.

    Attributes
    final
    Definition Classes
    AnyRef
  59. def equals (that: Any): Boolean

    Compares this set with another object for equality.

    Compares this set with another object for equality.

    Note: This operation contains an unchecked cast: if that is a set, it will assume with an unchecked cast that it has the same element type as this set. Any subsequent ClassCastException is treated as a false result.

    that

    the other object

    returns

    true if that is a set which contains the same elements as this set.

    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  60. def exists (p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this immutable tree set.

    Tests whether a predicate holds for some of the elements of this immutable tree set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this immutable tree set, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  61. def filter (p: (A) ⇒ Boolean): TreeSet[A]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterNot (p: (A) ⇒ Boolean): TreeSet[A]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  63. 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()
  64. def find (p: (A) ⇒ Boolean): Option[A]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  65. def firstKey : A

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
    TreeSetSortedSetLikeSorted
  66. def flatMap [B] (f: (A) ⇒ GenTraversableOnce[B]): immutable.TreeSet[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  67. def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

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

    f

    the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  68. def flatten [B] : immutable.TreeSet[B]

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

    [use case]

    Converts this immutable tree set of traversable collections into a immutable tree set in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  69. def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[B]

    Converts this immutable tree set of traversable collections into a immutable tree set in which all element collections are concatenated.

    Converts this immutable tree set of traversable collections into a immutable tree set in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable tree set is a Traversable.

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  70. def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

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

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  71. def foldLeft [B] (z: B)(op: (B, A) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable tree set, going left to right with the start value z on the left:

                op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable tree set, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  73. def forall (p: (A) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this immutable tree set, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  74. def foreach (f: (A) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this immutable tree set.

    [use case]

    Applies a function f to all elements of this immutable tree set.

    f

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

    Attributes
    abstract
    Definition Classes
    IterableLike
  75. def foreach [U] (f: (A) ⇒ U): Unit

    Applies a function f to all elements of this immutable tree set.

    Applies a function f to all elements of this immutable tree set.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

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

    f

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

    Definition Classes
    TreeSetIterableLikeGenericTraversableTemplateTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  76. def from (from: A): TreeSet[A]

    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
    SortedSetLikeSorted
  77. def genericBuilder [B] : Builder[B, Set[B]]

    The generic builder that builds instances of immutable.

    The generic builder that builds instances of immutable.TreeSet at arbitrary element types.

    Definition Classes
    GenericTraversableTemplate
  78. def getClass (): java.lang.Class[_ <: java.lang.Object]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  79. def groupBy [K] (f: (A) ⇒ K): Map[K, TreeSet[A]]

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new immutable tree set.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to immutable tree sets such that the following invariant holds:

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  80. def grouped (size: Int): Iterator[TreeSet[A]]

    Partitions elements in fixed size immutable tree sets.

    Partitions elements in fixed size immutable tree sets.

    size

    the number of elements per group

    returns

    An iterator producing immutable tree sets of size size, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  81. def hasAll (j: Iterator[A]): Boolean

    Attributes
    protected
    Definition Classes
    Sorted
  82. def hasDefiniteSize : Boolean

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

    Tests whether this immutable tree set is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

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

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  83. def hashCode (): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    GenSetLike → AnyRef → Any
  84. def head : A

    Selects the first element of this immutable tree set.

    Selects the first element of this immutable tree set.

    returns

    the first element of this immutable tree set.

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
  85. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this immutable tree set if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  86. def init : TreeSet[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a immutable tree set consisting of all elements of this immutable tree set except the last one.

    Definition Classes
    TraversableLike
  87. def inits : Iterator[TreeSet[A]]

    Iterates over the inits of this immutable tree set.

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

    returns

    an iterator over all the inits of this immutable tree set

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

  88. def insert (elem: A): TreeSet[A]

    A new TreeSet with the entry added is returned, assuming that elem is not in the TreeSet.

    A new TreeSet with the entry added is returned, assuming that elem is not in the TreeSet.

    elem

    a new element to add.

    returns

    a new immutable tree set containing elem and all the elements of this immutable tree set.

  89. def intersect (that: Set[A]): TreeSet[A]

    Definition Classes
    GenSetLike
    Annotations
    @bridge()
  90. def intersect (that: GenSet[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
    GenSetLike
  91. def isEmpty : Boolean

    Tests if this set is empty.

    Tests if this set is empty.

    returns

    true if there is no element in the set, false otherwise.

    Definition Classes
    SetLikeIterableLike → GenIterableLike → TraversableLikeTraversableOnceGenTraversableOnce
  92. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  93. def isSmaller (x: A, y: A): Boolean

    Definition Classes
    TreeSetRedBlack
  94. def isTraversableAgain : Boolean

    Tests whether this immutable tree set can be repeatedly traversed.

    Tests whether this immutable tree set can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  95. def iterator : Iterator[A]

    Creates a new iterator over all elements contained in this object.

    Creates a new iterator over all elements contained in this object.

    returns

    the new iterator

    Definition Classes
    TreeSet → GenSetLike → IterableLike → GenIterableLike
  96. def keySet : TreeSet[A]

    return as a projection the set of keys in this collection

    return as a projection the set of keys in this collection

    Definition Classes
    SortedSetLikeSorted
  97. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this immutable tree set.

    Definition Classes
    TraversableLike
  98. def lastKey : A

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
    TreeSetSortedSetLikeSorted
  99. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this immutable tree set$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  100. def map [B] (f: (A) ⇒ B): immutable.TreeSet[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable tree set.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  101. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

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

    f

    the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
    SetLikeTraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    "Set.map now returns a Set, so it will discard duplicate values."

  102. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable tree set with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  103. def max [B >: A] (implicit cmp: Ordering[B]): A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this immutable tree set with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  104. def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  105. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable tree set with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  106. def min [B >: A] (implicit cmp: Ordering[B]): A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this immutable tree set with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  107. def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  108. def mkString : String

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

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

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  109. def mkString (sep: String): String

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

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

    sep

    the separator string.

    returns

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

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

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this immutable tree 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 tree set are separated by the string sep.

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  112. def newBuilder : Builder[A, TreeSet[A]]

    A common implementation of newBuilder for all sets in terms of empty.

    A common implementation of newBuilder for all sets in terms of empty. Overridden for mutable sets in mutable.SetLike.

    Attributes
    protected[this]
    Definition Classes
    SetLikeTraversableLikeHasNewBuilder
  113. def nonEmpty : Boolean

    Tests whether the immutable tree set is not empty.

    Tests whether the immutable tree set is not empty.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  114. def notify (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  115. def notifyAll (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  116. implicit val ordering : Ordering[A]

    the implicit ordering used to compare objects of type A

    the implicit ordering used to compare objects of type A

    Attributes
    implicit
    Definition Classes
    TreeSetSortedSetLikeSorted
  117. def par : ParSet[A]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  118. def parCombiner : Combiner[A, ParSet[A]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected
    Definition Classes
    SetSetLikeIterableTraversableLikeParallelizable
  119. def partition (p: (A) ⇒ Boolean): (TreeSet[A], TreeSet[A])

    Partitions this immutable tree set in two immutable tree sets according to a predicate.

    Partitions this immutable tree set in two immutable tree sets according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of immutable tree sets: the first immutable tree set consists of all elements that satisfy the predicate p and the second immutable tree set consists of all elements that don't. The relative order of the elements in the resulting immutable tree sets is the same as in the original immutable tree set.

    Definition Classes
    TraversableLike → GenTraversableLike
  120. 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 of this immutable tree set with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  121. def product [B >: A] (implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

    the product of all elements of this immutable tree set with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  122. 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 upper-bound (exclusive) of the ranged projection.

    until

    ...

    returns

    ...

    Definition Classes
    SortedSetLikeSorted
  123. 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 garuanteed 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
    TreeSetSortedSetLikeSorted
  124. def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

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

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

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

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  125. def reduceLeft [B >: A] (op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce
  126. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B): Option[B]

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  127. def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

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

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    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
    TraversableOnceGenTraversableOnce
  128. def reduceRight [B >: A] (op: (A, B) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable tree set, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  129. def reduceRightOption [B >: A] (op: (A, B) ⇒ B): Option[B]

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  130. def repr : TreeSet[A]

    The collection of type immutable tree set underlying this TraversableLike object.

    The collection of type immutable tree set underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLike → GenTraversableLike
  131. def reversed : List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  132. def sameElements [B >: A] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  133. def sameElements (that: GenIterable[A]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this immutable tree set.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this immutable tree set.

    that

    the collection to compare with.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  134. def sameElements [B >: A] (that: GenIterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this immutable tree set.

    Checks if the other iterable collection contains the same elements in the same order as this immutable tree set.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  135. def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TreeSet[A], B, That]): That

    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

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new immutable tree set containing the prefix scan of the elements in this immutable tree set

    Definition Classes
    TraversableLike → GenTraversableLike
  136. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
  137. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

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

    Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  138. def seq : Set[A]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    SetSetGenSet → GenSetLike → IterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  139. val size : Int

    The size of this immutable tree set.

    The size of this immutable tree set.

    returns

    the number of elements in this immutable tree set.

    Definition Classes
    TreeSet → GenTraversableLike → TraversableOnceGenTraversableOnce
  140. 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
    
    from

    the lowest index to include from this immutable tree set.

    until

    the highest index to EXCLUDE from this immutable tree set.

    returns

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  141. def sliding [B >: A] (size: Int, step: Int): Iterator[TreeSet[A]]

    Definition Classes
    IterableLike
  142. def sliding [B >: A] (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.

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

    size

    the number of elements per group

    returns

    An iterator producing immutable tree sets of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

  143. def span (p: (A) ⇒ Boolean): (TreeSet[A], TreeSet[A])

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

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

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this immutable tree set whose elements all satisfy p, and the rest of this immutable tree set.

    Definition Classes
    TraversableLike → GenTraversableLike
  144. def splitAt (n: Int): (TreeSet[A], TreeSet[A])

    Splits this immutable tree set into two at a given position.

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

    n

    the position at which to split.

    returns

    a pair of immutable tree sets consisting of the first n elements of this immutable tree set, and the other elements.

    Definition Classes
    TraversableLike → GenTraversableLike
  145. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this set. Unless overridden this is simply "Set".

    Definition Classes
    TreeSetSetLikeTraversableLike → GenTraversableLike
  146. def subsetOf (that: GenSet[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
    SortedSetLike → GenSetLike
  147. def subsetOf (that: Set[A]): Boolean

    Definition Classes
    GenSetLike
    Annotations
    @bridge()
  148. 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
    SetLike
  149. 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
    SetLike
  150. 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 of this immutable tree set with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  151. def sum [B >: A] (implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

    the sum of all elements of this immutable tree set with respect to the + operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  152. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  153. def tail : TreeSet[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a immutable tree set consisting of all elements of this immutable tree set except the first one.

    Definition Classes
    TraversableLike → GenTraversableLike
  154. def tails : Iterator[TreeSet[A]]

    Iterates over the tails of this immutable tree set.

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

    returns

    an iterator over all the tails of this immutable tree set

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

  155. def take (n: Int): TreeSet[A]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this immutable tree set.

    returns

    a immutable tree set consisting only of the first n elements of this immutable tree set, or else the whole immutable tree set, if it has less than n elements.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  156. def takeRight (n: Int): TreeSet[A]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a immutable tree set consisting only of the last n elements of this immutable tree set, or else the whole immutable tree set, if it has less than n elements.

    Definition Classes
    IterableLike
  157. 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.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this immutable tree set whose elements all satisfy the predicate p.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  158. def thisCollection : Iterable[A]

    The underlying collection seen as an instance of immutable.TreeSet.

    The underlying collection seen as an instance of immutable.TreeSet. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  159. def to (to: A): TreeSet[A]

    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
    Sorted
  160. def toArray : Array[A]

    [use case] Converts this immutable tree set to an array.

    [use case]

    Converts this immutable tree set to an array.

    returns

    an array containing all elements of this immutable tree set.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  161. def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

    Converts this immutable tree set to an array.

    Converts this immutable tree set to an array.

    B

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

    returns

    an array containing all elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  162. def toBuffer [A1 >: A] : Buffer[A1]

    Converts this immutable tree set to a mutable buffer.

    Converts this immutable tree set to a mutable buffer.

    returns

    a buffer containing all elements of this immutable tree set.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  163. def toCollection (repr: TreeSet[A]): Iterable[A]

    A conversion from collections of type Repr to immutable.TreeSet objects.

    A conversion from collections of type Repr to immutable.TreeSet objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  164. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this immutable tree set to an indexed sequence.

    Converts this immutable tree set to an indexed sequence.

    returns

    an indexed sequence containing all elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  165. def toIterable : Iterable[A]

    Converts this immutable tree set to an iterable collection.

    Converts this immutable tree set to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this immutable tree set.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  166. def toIterator : Iterator[A]

    Returns an Iterator over the elements in this immutable tree set.

    Returns an Iterator over the elements in this immutable tree set. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this immutable tree set.

    Definition Classes
    TraversableLikeGenTraversableOnce
  167. def toList : List[A]

    Converts this immutable tree set to a list.

    Converts this immutable tree set to a list.

    returns

    a list containing all elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  168. def toMap [T, U] : Map[T, U]

    [use case] Converts this immutable tree set to a map.

    [use case]

    Converts this immutable tree set to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this immutable tree set.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  169. def toMap [T, U] (implicit ev: <:<[A, (T, U)]): Map[T, U]

    Converts this immutable tree set to a map.

    Converts this immutable tree set to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this immutable tree set.

    Definition Classes
    TraversableOnceGenTraversableOnce
  170. def toSeq : Seq[A]

    Overridden for efficiency.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this immutable tree set.

    Definition Classes
    SetLikeTraversableOnceGenTraversableOnce
  171. def toSet [B >: A] : Set[B]

    Converts this immutable tree set to a set.

    Converts this immutable tree set to a set.

    returns

    a set containing all elements of this immutable tree set.

    Definition Classes
    SetTraversableOnceGenTraversableOnce
  172. def toStream : Stream[A]

    Converts this immutable tree set to a stream.

    Converts this immutable tree set to a stream.

    returns

    a stream containing all elements of this immutable tree set.

    Definition Classes
    TreeSetIterableLikeTraversableLikeGenTraversableOnce
  173. 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
    SetLikeFunction1TraversableLike → AnyRef → Any
  174. def toTraversable : Traversable[A]

    Converts this immutable tree set to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this immutable tree set.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  175. def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

    Transposes this immutable tree set of traversable collections into a immutable tree set of immutable tree sets.

    Transposes this immutable tree set of traversable collections into a immutable tree set of immutable tree sets.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable tree set is a Traversable.

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  176. val tree : Tree[Unit]

    Attributes
    protected
  177. def union (that: Set[A]): TreeSet[A]

    Definition Classes
    SetLike
    Annotations
    @bridge()
  178. def union (that: GenSet[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
    SetLike → GenSetLike
  179. def until (until: A): TreeSet[A]

    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
    SortedSetLikeSorted
  180. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])

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

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

    asPair

    an implicit conversion which asserts that the element type of this immutable tree set is a pair.

    returns

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

    Definition Classes
    GenericTraversableTemplate
  181. def unzip3 [A1, A2, A3] (implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  182. def view (from: Int, until: Int): IterableView[A, TreeSet[A]]

    Creates a non-strict view of a slice of this immutable tree set.

    Creates a non-strict view of a slice of this immutable tree set.

    Note: the difference between view and slice is that view produces a view of the current immutable tree set, whereas slice produces a new immutable tree set.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this immutable tree set, starting at index from and extending up to (but not including) index until.

    Definition Classes
    IterableLikeTraversableLike
  183. def view : IterableView[A, TreeSet[A]]

    Creates a non-strict view of this immutable tree set.

    Creates a non-strict view of this immutable tree set.

    returns

    a non-strict view of this immutable tree set.

    Definition Classes
    IterableLikeTraversableLike
  184. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  185. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  186. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  187. def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, TreeSet[A]]

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

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

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this immutable tree set which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  188. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[TreeSet[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  189. def zip [B] (that: GenIterable[B]): immutable.TreeSet[(A, B)]

    [use case] Returns a immutable tree set formed from this immutable tree set and another iterable collection by combining corresponding elements in pairs.

    [use case]

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  190. def zip [A1 >: A, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[TreeSet[A], (A1, B), That]): That

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

    Returns a immutable tree set formed from this immutable tree set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    A1

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

    B

    the type of the second half of the returned pairs

    That

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

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  191. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TreeSet[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  192. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B): immutable.TreeSet[(A, B)]

    [use case] Returns a immutable tree set formed from this immutable tree set and another iterable collection by combining corresponding elements in pairs.

    [use case]

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

    thatElem

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

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  193. def zipAll [B, A1 >: A, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TreeSet[A], (A1, B), That]): That

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

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

    thatElem

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  194. def zipWithIndex : immutable.TreeSet[(A, Int)]

    [use case] Zips this immutable tree set with its indices.

    [use case]

    Zips this immutable tree set with its indices.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  195. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[TreeSet[A], (A1, Int), That]): That

    Zips this immutable tree set with its indices.

    Zips this immutable tree set with its indices.

    A1

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

    That

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  196. def | (that: Set[A]): TreeSet[A]

    Definition Classes
    GenSetLike
    Annotations
    @bridge()
  197. def | (that: GenSet[A]): TreeSet[A]

    Computes the union between this set and another set.

    Computes the union between this set and another set.

    Note: Same as union.

    that

    the set to form the union with.

    returns

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

    Definition Classes
    GenSetLike
  198. def ** (that: Set[A]): TreeSet[A]

    This method is an alias for intersect.

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

    that

    the set to intersect with

    Definition Classes
    SetLike
    Annotations
    @deprecated
    Deprecated

    use & instead

  199. def elements : Iterator[A]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  200. def first : A

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  201. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  202. def projection : IterableView[A, TreeSet[A]]

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

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

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

Inherited from SortedSet[A]

Inherited from SortedSet[A]

Inherited from SortedSetLike[A, TreeSet[A]]

Inherited from Sorted[A, TreeSet[A]]

Inherited from Set[A]

Inherited from Set[A]

Inherited from SetLike[A, TreeSet[A]]

Inherited from Subtractable[A, TreeSet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, Set]

Inherited from GenSetLike[A, TreeSet[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, TreeSet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, TreeSet[A]]

Inherited from Traversable[A]

Inherited from Immutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Set]

Inherited from TraversableLike[A, TreeSet[A]]

Inherited from GenTraversableLike[A, TreeSet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, TreeSet[A]]

Inherited from HasNewBuilder[A, TreeSet[A]]

Inherited from RedBlack[A]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any