Scaladoc for scala.collection.immutable.TreeSet

Inherited

Hide All
Show all

SortedSet
SortedSet
SortedSetLike
Sorted
Set
Set
SetLike
Subtractable
Addable
GenericSetTemplate
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Immutable
Traversable
GenericTraversableTemplate
TraversableLike
TraversableOnce
HasNewBuilder
RedBlack
AnyRef
Any

Visibility

Public
All

Instance constructors

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

Type Members

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

attributes: abstract
class RedTree[+B](key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product
type Self = TreeSet[A]

The type implementing this traversable

The type implementing this traversable
attributes: protected
definition classes: TraversableLike
class Tree[+B] extends AnyRef

attributes: abstract
class WithFilter extends AnyRef

A class supporting filtered operations.

Value Members

def !=(arg0: AnyRef): Boolean

attributes: final
definition classes: AnyRef
def !=(arg0: Any): Boolean

o != arg0 is the same as !(o == (arg0)).

o != arg0 is the same as !(o == (arg0)).
arg0
the object to compare against this object for dis-equality.
returns
false if the receiver object is equivalent to the argument; true otherwise.
attributes: final
definition classes: Any
def ##(): Int

attributes: final
definition classes: AnyRef → Any
def $asInstanceOf[T0](): T0

attributes: final
definition classes: AnyRef
def $isInstanceOf[T0](): Boolean

attributes: final
definition classes: AnyRef
def &(that: Set[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: SetLike
def &~(that: Set[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: SetLike
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
1. use & instead
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: TreeSet → SetLike → Addable
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: Addable
def ++(xs: TraversableOnce[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.
returns
a new immutable tree set with the given elements added.
definition classes: Addable
def ++(that: TraversableOnce[A]): Traversable[A]

[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.
that
the traversable to append.
returns
a new immutable tree set which contains all elements of this immutable tree set followed by all elements of that.
attributes: abstract
definition classes: TreeSet → Addable
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.
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
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: TreeSet → SetLike → Subtractable
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
def --(xs: TraversableOnce[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
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₁), x₂), ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: TraversableOnce
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₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: TraversableOnce
def ==(arg0: AnyRef): Boolean

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: AnyRef
def ==(arg0: Any): Boolean

o == arg0 is the same as o.equals(arg0).

o == arg0 is the same as o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: Any
object Empty extends Tree[Nothing] with Product
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
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
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
def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

(f andThen g)(x) == g(f(x))

(f andThen g)(x) == g(f(x))
definition classes: Function1
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: SetLike
def asInstanceOf[T0]: T0

This method is used to cast the receiver object to be of type T0.

This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(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 typed.
returns
the receiver object.
attributes: final
definition classes: Any
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: IterableLike → Equals
def clone(): AnyRef

This method creates and returns a copy of the receiver object.

This method creates and returns 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
definition classes: AnyRef
def collect[B](pf: PartialFunction[A, B]): Traversable[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 immutable tree set resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
attributes: abstract
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
def companion: GenericCompanion[Set[A][A]]

The factory companion object that builds instances of class immutable.

The factory companion object that builds instances of class immutable.TreeSet.
definition classes: Set → Set → Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate
def compare(k0: A, k1: A): Int

Comparison function that orders keys.

Comparison function that orders keys.
definition classes: Sorted
def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

(f compose g)(x) == f(g(x))

(f compose g)(x) == f(g(x))
definition classes: Function1
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: TreeSet → SetLike
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
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: IterableLike → TraversableLike → TraversableOnce
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
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: TraversableOnce
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, after skipping start values. 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
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, after skipping start values. 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: TraversableOnce
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
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: TraversableOnce
def diff(that: Set[A]): TreeSet[A]

Computes the difference of this set and another set.

Computes the difference of this set and another set.
that
the set of elements to exclude.
returns
a set containing those elements of this set that are not also contained in the given set that.
definition classes: SetLike
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: TraversableLike
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 first n ones, or else the empty immutable tree set, if this immutable tree set has less than n elements.
definition classes: IterableLike
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
def elements: Iterator[A]
definition classes: IterableLike
1. use iterator' instead
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.
definition classes: TreeSet → SortedSet → SortedSet → SetLike → GenericSetTemplate
def eq(arg0: AnyRef): Boolean

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other 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).
arg0
the object to compare against this object for reference equality.
returns
true if the argument is a reference to the receiver object; false otherwise.
attributes: final
definition classes: AnyRef
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: SetLike → Equals → AnyRef → Any
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: IterableLike → TraversableLike → TraversableOnce
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
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
def finalize(): Unit

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.
attributes: protected
definition classes: AnyRef
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: IterableLike → TraversableLike → TraversableOnce
def first: A
definition classes: IterableLike
1. use head' instead
def firstKey: A

Returns the first key of the collection.

Returns the first key of the collection.
definition classes: TreeSet → SortedSetLike → Sorted
def firstOption: Option[A]

None if iterable is empty.
None if iterable is empty.
definition classes: IterableLike
1. use headOption' instead
def flatMap[B](f: (A) ⇒ Traversable[B]): Traversable[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 immutable tree set resulting from applying the given collection-valued function f to each element of this immutable tree set and concatenating the results.
attributes: abstract
def flatMap[B, That](f: (A) ⇒ Traversable[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
def flatten[B]: CC[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
def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): Set[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: GenericTraversableTemplate
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₁), x₂, ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: TraversableOnce
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₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: IterableLike → TraversableOnce
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: IterableLike → TraversableLike → TraversableOnce
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
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: TreeSet → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce
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: SortedSetLike → Sorted
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
def getClass(): java.lang.Class[_ <: java.lang.Object]

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

Returns 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
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
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
1. Iterator#grouped
def hasAll(j: Iterator[A]): Boolean

attributes: protected
definition classes: Sorted
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: TraversableLike → TraversableOnce
def hashCode(): Int

Returns a hash code value for the object.

Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.
returns
the hash code value for the object.
definition classes: SetLike → AnyRef → Any
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 → TraversableLike
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
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
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.
def intersect(that: Set[A]): TreeSet[A]

Computes the intersection between this set and another set.

Computes the intersection between this set and another set.
that
the set to intersect with.
returns
a new set consisting of all elements that are both in this set and in the given set that.
definition classes: SetLike
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: SetLike → IterableLike → TraversableLike → TraversableOnce
def isInstanceOf[T0]: Boolean

This method is used to test whether the dynamic type of the receiver object is T0.

This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.
attributes: final
definition classes: Any
def isSmaller(x: A, y: A): Boolean

definition classes: TreeSet → RedBlack
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: TraversableLike → TraversableOnce
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 → IterableLike
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: SortedSetLike → Sorted
def last: A

Selects the last element.

Selects the last element.
returns
the first element of this immutable tree set.
definition classes: TraversableLike
def lastKey: A

Returns the last key of the collection.

Returns the last key of the collection.
definition classes: TreeSet → SortedSetLike → Sorted
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
def map[B](f: (A) ⇒ B): Traversable[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 immutable tree set resulting from applying the given function f to each element of this immutable tree set and collecting the results.
attributes: abstract
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: TraversableLike
def max: A

[use case] Finds the largest element.

[use case]
Finds the largest element.
returns
the largest element of this immutable tree set.
attributes: abstract
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: TraversableOnce
def min: A

[use case] Finds the smallest element.

[use case]
Finds the smallest element.
returns
the smallest element of this immutable tree set
attributes: abstract
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: TraversableOnce
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: TraversableOnce
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: TraversableOnce
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: TraversableOnce
def ne(arg0: AnyRef): Boolean

o.ne(arg0) is the same as !(o.eq(arg0)).

o.ne(arg0) is the same as !(o.eq(arg0)).
arg0
the object to compare against this object for reference dis-equality.
returns
false if the argument is not a reference to the receiver object; true otherwise.
attributes: final
definition classes: AnyRef
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: SetLike → TraversableLike → HasNewBuilder
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: TraversableOnce
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
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
implicit val ordering: Ordering[A]

attributes: implicit
definition classes: TreeSet → SortedSetLike → Sorted
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
def product: Int

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

[use case]
Multiplies up the elements of this collection.
returns
the product of all elements in this immutable tree set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable tree set and as result type of product. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
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: TraversableOnce
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
1. use view' instead
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: SortedSetLike → Sorted
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: TreeSet → SortedSetLike → Sorted
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Applies a binary operator to all elements of this immutable tree set, going left to right.
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
the result of inserting op between consecutive elements of this immutable tree set, going left to right: op(...(op(x₁, x₂), ... ) , x_n) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: TraversableOnce
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: TraversableOnce
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₁, op(x₂, ..., op(x_n-1, x_n)...)) where x,,1,,, ..., x,,n,, are the elements of this immutable tree set.
definition classes: IterableLike → TraversableOnce
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: TraversableOnce
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
def reversed: List[A]

attributes: protected[this]
definition classes: TraversableOnce
def sameElements(that: Iterable[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
def sameElements[B >: A](that: Iterable[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
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
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.
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
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 → TraversableOnce
def slice(from: Int, until: Int): TreeSet[A]

Selects an interval of elements.

Selects an interval of elements.
Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)
from
the index of the first returned element in this immutable tree set.
until
the index one past the last returned element in this immutable tree set.
returns
a immutable tree set containing the elements starting at index from and extending up to (but not including) index until of this immutable tree set.
definition classes: IterableLike → TraversableLike
def sliding[B >: A](size: Int, step: Int): Iterator[TreeSet[A]]

definition classes: IterableLike
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 will be truncated if the elements don't divide evenly.
definition classes: IterableLike
1. Iterator#sliding
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
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
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: TreeSet → SetLike → TraversableLike
def subsetOf(that: Set[A]): Boolean

Tests whether this set is a subset of another set.

Tests whether this set is a subset of another set.
that
the set to test.
returns
true if this set is a subset of that, i.e. if every element of this set is also an element of that.
definition classes: SortedSetLike → SetLike
def sum: Int

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

[use case]
Sums up the elements of this collection.
returns
the sum of all elements in this immutable tree set of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable tree set and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
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: TraversableOnce
def synchronized[T0](arg0: T0): T0

attributes: final
definition classes: AnyRef
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
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: IterableLike → TraversableLike
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
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: IterableLike → TraversableLike
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: IterableLike → TraversableLike
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
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. A ClassManifest must be available for the element type of this immutable tree set.
attributes: abstract
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: TraversableOnce
def toBuffer[B >: A]: Buffer[B]

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: TraversableOnce
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: IterableLike → TraversableLike
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: TraversableOnce
def toIterable: Iterable[A]

Converts this immutable tree set to an iterable collection.

Converts this immutable tree set to an iterable collection.
returns
an Iterable containing all elements of this immutable tree set.
definition classes: IterableLike → TraversableOnce
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: TraversableLike → TraversableOnce
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: TraversableOnce
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 ((K, V)) 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: TraversableOnce
def toSeq: Seq[A]

Converts this immutable tree set to a sequence.

Converts this immutable tree set to a sequence.
returns
a sequence containing all elements of this immutable tree set.
definition classes: TraversableOnce
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: TraversableOnce
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: TreeSet → IterableLike → TraversableOnce
def toString(): String

Converts this immutable tree set to a string.

Converts this immutable tree set to a string.
returns
a string representation of this collection. By default this string consists of the stringPrefix of this immutable tree set, followed by all elements separated by commas and enclosed in parentheses.
definition classes: SetLike → TraversableLike → AnyRef → Any
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: TraversableLike → TraversableOnce
def transpose[B](implicit asTraversable: (A) ⇒ Traversable[B]): Set[Set[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: GenericTraversableTemplate
val tree: Tree[Unit]

attributes: protected
def union(that: Set[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
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: SortedSetLike → Sorted
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 halfs of each pair.

Converts this immutable tree set of pairs into two collections of the first and second halfs 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
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: IterableLike → TraversableLike
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: IterableLike → TraversableLike
def wait(): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long, arg1: Int): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long): Unit

attributes: final
definition classes: AnyRef
def withFilter(p: (A) ⇒ Boolean): WithFilter

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: TraversableLike
def zip[B](that: Iterable[B]): Iterable[(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 immutable tree set 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
def zip[A1 >: A, B, That](that: Iterable[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
def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Iterable[(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.
B
the type of the second half of the returned pairs
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 immutable tree set 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
def zipAll[B, A1 >: A, That](that: Iterable[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
def zipWithIndex: Iterable[(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 immutable tree set containing pairs consisting of all elements of this immutable tree set paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
attributes: abstract
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
def |(that: Set[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: SetLike

TreeSet

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

Instance constructors

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

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

Type Members

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

class NonEmpty[+B] extends Tree[B]

class RedTree[+B](key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product

type Self = TreeSet[A]

class Tree[+B] extends AnyRef

class WithFilter extends AnyRef

Value Members

def !=(arg0: AnyRef): Boolean

def !=(arg0: Any): Boolean

def ##(): Int

def $asInstanceOf[T0](): T0

def $isInstanceOf[T0](): Boolean

def &(that: Set[A]): TreeSet[A]

def &~(that: Set[A]): TreeSet[A]

def **(that: Set[A]): TreeSet[A]

def +(elem: A): TreeSet[A]

def +(elem1: A, elem2: A, elems: A*): TreeSet[A]

def ++(xs: TraversableOnce[A]): TreeSet[A]

def ++(that: TraversableOnce[A]): Traversable[A]

def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

def -(elem: A): TreeSet[A]

def -(elem1: A, elem2: A, elems: A*): TreeSet[A]

def --(xs: TraversableOnce[A]): TreeSet[A]

def /:[B](z: B)(op: (B, A) ⇒ B): B

def :\[B](z: B)(op: (A, B) ⇒ B): B

def ==(arg0: AnyRef): Boolean

def ==(arg0: Any): Boolean

object Empty extends Tree[Nothing] with Product

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

def apply(elem: A): Boolean

def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B](pf: PartialFunction[A, B]): Traversable[B]

def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

def companion: GenericCompanion[Set[A][A]]

def compare(k0: A, k1: A): Int

def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

def contains(elem: A): Boolean

def copyToArray(xs: Array[A], start: Int, len: Int): Unit

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

def copyToArray(xs: Array[A]): Unit

def copyToArray[B >: A](xs: Array[B]): Unit

def copyToArray(xs: Array[A], start: Int): Unit

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

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

def count(p: (A) ⇒ Boolean): Int

def diff(that: Set[A]): TreeSet[A]

def drop(n: Int): TreeSet[A]

def dropRight(n: Int): TreeSet[A]

def dropWhile(p: (A) ⇒ Boolean): TreeSet[A]

def elements: Iterator[A]

def empty: TreeSet[A]

def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): TreeSet[A]

def filterNot(p: (A) ⇒ Boolean): TreeSet[A]

def finalize(): Unit

def find(p: (A) ⇒ Boolean): Option[A]

def first: A

def firstKey: A

def firstOption: Option[A]

def flatMap[B](f: (A) ⇒ Traversable[B]): Traversable[B]

def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[TreeSet[A], B, That]): That

def flatten[B]: CC[B]

def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): Set[B]

def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

def foldRight[B](z: B)(op: (A, B) ⇒ B): B

def forall(p: (A) ⇒ Boolean): Boolean

def foreach(f: (A) ⇒ Unit): Unit