Class scala.collection.mutable.TreeSet

sealed class TreeSet[A] extends AbstractSet[A] with SortedSet[A] with SortedSetOps[A, TreeSet, TreeSet[A]] with StrictOptimizedIterableOps[A, Set, TreeSet[A]] with StrictOptimizedSortedSetOps[A, TreeSet, TreeSet[A]] with SortedSetFactoryDefaults[A, TreeSet, Set] with DefaultSerializable

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

Constructors

Source

def this()(implicit ord: Ordering[A])

Creates an empty TreeSet.

Concrete methods

Source

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

Source

def clear(): Unit

Source

def contains(elem: A): Boolean

Source

override def foreach[U](f: A => U): Unit

Source

override def head: A

Source

override def isEmpty: Boolean

Source

def iterator: Iterator[A]

Source

def iteratorFrom(start: A): Iterator[A]

Source

override def knownSize: Int

Source

override def last: A

Source

override def maxBefore(key: A): Option[A]

Source

override def minAfter(key: A): Option[A]

Source

def rangeImpl(from: Option[A], until: Option[A]): TreeSet[A]

Source

override def size: Int

Source

override def sortedIterableFactory: SortedIterableFactory[TreeSet]

Source

override def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S & EfficientSplit

Source

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

Source

def unconstrained: Set[A]

Inherited methods

Source@inline

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

Alias for intersect

Source@inline

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

Alias for diff

Source@inline

final def ++(that: IterableOnce[A]): TreeSet[A]

Alias for concat

Source@inline

final def ++[B >: A](suffix: IterableOnce[B]): Set[B]

Alias for concat

Source@inline

final def ++=(xs: IterableOnce[A]): TreeSet[A]

Alias for addAll

Source@inline

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

Alias for addOne

Source@inline

final def --=(xs: IterableOnce[A]): TreeSet[A]

Alias for subtractAll

Source@inline

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

Alias for subtractOne

Source

def add(elem: A): Boolean

Check whether the set contains the given element, and add it if not.

Source

def addAll(xs: IterableOnce[A]): TreeSet[A]

Adds all elements produced by an IterableOnce to this growable collection.

Source@inline

final def addString(b: StringBuilder): StringBuilder

Appends all elements of this collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this collection without any separator string.

Example:

scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> val h = a.addString(b)
h: StringBuilder = 1234

Source@inline

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

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

Example:

scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b, ", ")
res0: StringBuilder = 1, 2, 3, 4

Source

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

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

Example:

scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b , "List(" , ", " , ")")
res5: StringBuilder = List(1, 2, 3, 4)

Source@unspecialized

def andThen[A](g: Boolean => A): A => A

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

Source@inline

final def apply(elem: A): Boolean

Tests if some element is contained in this set.

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

Source

def canEqual(that: Any): Boolean

Source

override def clone(): TreeSet[A]

Source

override def collect[B](pf: PartialFunction[A, B])(implicit @implicitNotFound ev: Ordering[B]): TreeSet[B]

Source

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

Source

def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

Note: may not terminate for infinite-sized collections.

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

Source@unspecialized

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

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

Source

override def concat(that: IterableOnce[A]): TreeSet[A]

Source

def concat[B >: A](suffix: IterableOnce[B]): Set[B]

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

Source

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

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

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

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

Source@deprecatedOverriding("This should always forward to the 3-arg version of this method", since = "2.13.4")

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

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

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

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

Source@deprecatedOverriding("This should always forward to the 3-arg version of this method", since = "2.13.4")

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

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

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

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

Source

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

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

Note: will not terminate for infinite-sized collections.

Source

def count(p: A => Boolean): Int

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

Note: will not terminate for infinite-sized collections.

Source

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

Source

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

Source

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

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

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

Source

def dropWhile(p: A => Boolean): TreeSet[A]

Source

override def empty: TreeSet[A]

Source

override def equals(that: Any): Boolean

Source

def exists(p: A => Boolean): Boolean

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

Note: may not terminate for infinite-sized collections.

Source

override def filter(pred: A => Boolean): TreeSet[A]

Source

def filterInPlace(p: A => Boolean): TreeSet[A]

Removes all elements from the set for which do not satisfy a predicate.

Source

override def filterNot(pred: A => Boolean): TreeSet[A]

Source

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

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

Note: may not terminate for infinite-sized collections.

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

Source

def firstKey: A

Source

override def flatMap[B](f: A => IterableOnce[B])(implicit @implicitNotFound ev: Ordering[B]): TreeSet[B]

Source

override def flatMap[B](f: A => IterableOnce[B]): Set[B]

Source

override def flatten[B](implicit toIterableOnce: A => IterableOnce[B]): Set[B]

Source

def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1

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

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

Note: will not terminate for infinite-sized collections.

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def forall(p: A => Boolean): Boolean

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

Note: may not terminate for infinite-sized collections.

Source

override protected def fromSpecific(coll: IterableOnce[A]): TreeSet[A]

Source

def groupBy[K](f: A => K): Map[K, TreeSet[A]]

Partitions this iterable collection into a map of iterable collections according to some discriminator function.

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

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

Source

def groupMap[K, B](key: A => K)(f: A => B): Map[K, Set[B]]

Partitions this iterable collection into a map of iterable collections according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

case class User(name: String, age: Int)

def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
  users.groupMap(_.age)(_.name)

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

Source

def groupMapReduce[K, B](key: A => K)(f: A => B)(reduce: (B, B) => B): Map[K, B]

Partitions this iterable collection into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the f function and then reduced into a single value with the reduce function.

It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

def occurrences[A](as: Seq[A]): Map[A, Int] =
  as.groupMapReduce(identity)(_ => 1)(_ + _)

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

Source

def grouped(size: Int): Iterator[TreeSet[A]]

Partitions elements in fixed size iterable collections.

Source

override def hashCode(): Int

Source

def headOption: Option[A]

Optionally selects the first element.

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

Source

def init: TreeSet[A]

The initial part of the collection without its last element.

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

Source

def inits: Iterator[TreeSet[A]]

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

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

Source

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

Computes the intersection between this set and another set.

Source

override def isTraversableAgain: Boolean

Source

override def iterableFactory: IterableFactory[Set]

Source

def lastKey: A

Source

def lastOption: Option[A]

Optionally selects the last element.

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

Source

def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, TreeSet[A]]

Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

val xs = List(1, 2, 3)
val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
// res == List(4, 8, 12)

Source

override def map[B](f: A => B)(implicit @implicitNotFound ev: Ordering[B]): TreeSet[B]

Source

override def map[B](f: A => B): Set[B]

Source

def mapResult[NewTo](f: TreeSet[A] => NewTo): Builder[A, NewTo]

A builder resulting from this builder my mapping the result using f.

Source

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

Source

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

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

Note: will not terminate for infinite-sized collections.

Source

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

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

Note: will not terminate for infinite-sized collections.

Source

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

Finds the largest element.

Note: will not terminate for infinite-sized collections.

Source

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

Source

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

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

Note: will not terminate for infinite-sized collections.

Source

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

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

Note: will not terminate for infinite-sized collections.

Source

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

Finds the smallest element.

Note: will not terminate for infinite-sized collections.

Source@inline

final def mkString: String

Displays all elements of this collection in a string.

Delegates to addString, which can be overridden.

Source@inline

final def mkString(sep: String): String

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

Delegates to addString, which can be overridden.

Source

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

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

Delegates to addString, which can be overridden.

Source

override protected def newSpecificBuilder: Builder[A, TreeSet[A]]

Source@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")

def nonEmpty: Boolean

Tests whether the collection is not empty.

Source

override def partition(p: A => Boolean): (TreeSet[A], TreeSet[A])

Source

override def partitionMap[A1, A2](f: A => Either[A1, A2]): (Set[A1], Set[A2])

Source

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

Multiplies up the elements of this collection.

Note: will not terminate for infinite-sized collections.

Source

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

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

Source

def rangeFrom(from: A): TreeSet[A]

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

Source

def rangeTo(to: A): TreeSet[A]

Source

def rangeUntil(until: A): TreeSet[A]

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

Source

def reduce[B >: A](op: (B, B) => B): B

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

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def reduceOption[B >: A](op: (B, B) => B): Option[B]

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

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

Source

def reduceRight[B >: A](op: (A, B) => B): B

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

Note: will not terminate for infinite-sized collections.

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

Source

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

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

Note: will not terminate for infinite-sized collections.

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

Source

def remove(elem: A): Boolean

Removes an element from this set.

Source

def result(): TreeSet[A]

Source

protected def reversed: Iterable[A]

Source

def scan[B >: A](z: B)(op: (B, B) => B): Set[B]

Computes a prefix scan of the elements of the collection.

Note: The neutral element z may be applied more than once.

Source

override def scanLeft[B](z: B)(op: (B, A) => B): Set[B]

Source

def scanRight[B](z: B)(op: (A, B) => B): Set[B]

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

Note: will not terminate for infinite-sized collections.

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

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

Example:

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

Source

def sizeCompare(that: Iterable[_]): Int

Compares the size of this iterable collection to the size of another Iterable.

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

Source

def sizeCompare(otherSize: Int): Int

Compares the size of this iterable collection to a test value.

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

Source

final def sizeHint(coll: IterableOnce[_], delta: Int): Unit

Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection has a known size Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Source

def sizeHint(size: Int): Unit

Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Source

final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Source@inline

final def sizeIs: SizeCompareOps

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

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

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

Source

def slice(from: Int, until: Int): TreeSet[A]

Source

def sliding(size: Int, step: Int): Iterator[TreeSet[A]]

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

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

Source

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

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

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

Source

override def span(p: A => Boolean): (TreeSet[A], TreeSet[A])

Source

override def splitAt(n: Int): (TreeSet[A], TreeSet[A])

Source

def subsetOf(that: Set[A]): Boolean

Tests whether this set is a subset of another set.

Source

def subsets(): Iterator[TreeSet[A]]

An iterator over all subsets of this set.

Source

def subsets(len: Int): Iterator[TreeSet[A]]

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

Source

def subtractAll(xs: IterableOnce[A]): TreeSet[A]

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

Source

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

Sums up the elements of this collection.

Note: will not terminate for infinite-sized collections.

Source

def tail: TreeSet[A]

The rest of the collection without its first element.

Source

def tails: Iterator[TreeSet[A]]

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

Source

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

Source

override def takeRight(n: Int): TreeSet[A]

A collection containing the last n elements of this collection.

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

Source

def takeWhile(p: A => Boolean): TreeSet[A]

Takes longest prefix of elements that satisfy a predicate.

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

Source

override def tapEach[U](f: A => U): TreeSet[A]

Source

def to[C1](factory: Factory[A, C1]): C1

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

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

Source

def toArray[B >: A : ClassTag]: Array[B]

Convert collection to array.

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

Source@inline

final def toBuffer[B >: A]: Buffer[B]

Source

def toIndexedSeq: IndexedSeq[A]

Source

def toList: List[A]

Source

def toMap[K, V](implicit ev: A <:< (K, V)): Map[K, V]

Source

def toSeq: Seq[A]

Source

def toSet[B >: A]: Set[B]

Source

override def toString(): String

Source

def toVector: Vector[A]

Source

def transpose[B](implicit asIterable: A => Iterable[B]): Set[Set[B]]

Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

The resulting collection's type will be guided by the static type of iterable collection. For example:

val xs = List(
           Set(1, 2, 3),
           Set(4, 5, 6)).transpose
// xs == List(
//         List(1, 4),
//         List(2, 5),
//         List(3, 6))

val ys = Vector(
           List(1, 2, 3),
           List(4, 5, 6)).transpose
// ys == Vector(
//         Vector(1, 4),
//         Vector(2, 5),
//         Vector(3, 6))

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

Source@inline

final def union(that: Set[A]): TreeSet[A]

Computes the union between of set and another set.

Source

override def unsorted: Set[A]

Source

override def unzip[A1, A2](implicit asPair: A => (A1, A2)): (Set[A1], Set[A2])

Source

override def unzip3[A1, A2, A3](implicit asTriple: A => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

Source

def update(elem: A, included: Boolean): Unit

Updates the presence of a single element in this set.

This method allows one to add or remove an element elem from this set depending on the value of parameter included. Typically, one would use the following syntax:

set(elem) = true  // adds element
set(elem) = false // removes element

Source

def view: View[A]

A view over the elements of this collection.

Source

override def withFilter(p: A => Boolean): WithFilter[A, Set, TreeSet]

Source

override def zip[B](that: IterableOnce[B])(implicit @implicitNotFound ev: Ordering[(A, B)]): TreeSet[(A, B)]

Source

override def zip[B](that: IterableOnce[B]): Set[(A, B)]

Source

def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]

Returns a iterable collection formed from this iterable collection 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.

Source

override def zipWithIndex: Set[(A, Int)]

Source@inline

final def |(that: Set[A]): TreeSet[A]

Alias for union

Implicits

Source

implicit val ordering: Ordering[A]