A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/TreeSet.html below:

Scala Standard Library 2.13.10 - 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



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeSet
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedSortedSetOps
  5. StrictOptimizedSetOps
  6. StrictOptimizedIterableOps
  7. SortedSet
  8. SortedSetOps
  9. SortedSet
  10. SortedSetFactoryDefaults
  11. SortedSetOps
  12. SortedOps
  13. AbstractSet
  14. Set
  15. SetOps
  16. Shrinkable
  17. Builder
  18. Growable
  19. Clearable
  20. Cloneable
  21. Cloneable
  22. Iterable
  23. AbstractSet
  24. Set
  25. Equals
  26. SetOps
  27. Function1
  28. AbstractIterable
  29. Iterable
  30. IterableFactoryDefaults
  31. IterableOps
  32. IterableOnceOps
  33. IterableOnce
  34. AnyRef
  35. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new TreeSet()(implicit ord: Ordering[A])
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def &(that: collection.Set[A]): TreeSet[A]
  4.  final def &~(that: collection.Set[A]): TreeSet[A]
  5.  final def ++(that: IterableOnce[A]): TreeSet[A]
  6.  final def ++[B >: A](suffix: IterableOnce[B]): Set[B]
  7.  final def ++=(xs: IterableOnce[A]): TreeSet.this.type
  8.  final def +=(elem: A): TreeSet.this.type
  9.  final def --=(xs: IterableOnce[A]): TreeSet.this.type
  10.  final def -=(elem: A): TreeSet.this.type
  11.  def ->[B](y: B): (TreeSet[A], B)
  12.  final def ==(arg0: Any): Boolean
  13.  def add(elem: A): Boolean
  14.  def addAll(xs: IterableOnce[A]): TreeSet.this.type
  15.  def addOne(elem: A): TreeSet.this.type
  16.  final def addString(b: StringBuilder): b.type
  17.  final def addString(b: StringBuilder, sep: String): b.type
  18.  def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
  19.  def andThen[A](g: (Boolean) => A): (A) => A
  20.  final def apply(elem: A): Boolean
  21.  final def asInstanceOf[T0]: T0
  22.  def canEqual(that: Any): Boolean
  23.  def className: String
  24.  def clear(): Unit
  25.  def clone(): TreeSet[A]
  26.  final def coll: TreeSet.this.type
  27.  def collect[B](pf: PartialFunction[A, B])(implicit ev: Ordering[B]): TreeSet[B]
  28.  def collect[B](pf: PartialFunction[A, B]): Set[B]
  29.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  30.  def compose[A](g: (A) => A): (A) => Boolean
  31.  def concat(that: IterableOnce[A]): TreeSet[A]
  32.  def concat[B >: A](suffix: IterableOnce[B]): Set[B]
  33.  def contains(elem: A): Boolean
  34.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  35.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  36.  def copyToArray[B >: A](xs: Array[B]): Int
  37.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  38.  def count(p: (A) => Boolean): Int
  39.  def diff(that: collection.Set[A]): TreeSet[A]
  40.  def drop(n: Int): TreeSet[A]
  41.  def dropRight(n: Int): TreeSet[A]
  42.  def dropWhile(p: (A) => Boolean): TreeSet[A]
  43.  def empty: TreeSet[A]
  44.  def ensuring(cond: (TreeSet[A]) => Boolean, msg: => Any): TreeSet[A]
  45.  def ensuring(cond: (TreeSet[A]) => Boolean): TreeSet[A]
  46.  def ensuring(cond: Boolean, msg: => Any): TreeSet[A]
  47.  def ensuring(cond: Boolean): TreeSet[A]
  48.  final def eq(arg0: AnyRef): Boolean
  49.  def equals(that: Any): Boolean
  50.  def exists(p: (A) => Boolean): Boolean
  51.  def filter(pred: (A) => Boolean): TreeSet[A]
  52.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): TreeSet[A]
  53.  def filterInPlace(p: (A) => Boolean): TreeSet.this.type
  54.  def filterNot(pred: (A) => Boolean): TreeSet[A]
  55.  def finalize(): Unit
  56.  def find(p: (A) => Boolean): Option[A]
  57.  def firstKey: A
  58.  def flatMap[B](f: (A) => IterableOnce[B])(implicit ev: Ordering[B]): TreeSet[B]
  59.  def flatMap[B](f: (A) => IterableOnce[B]): Set[B]
  60.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Set[B]
  61.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  62.  def foldLeft[B](z: B)(op: (B, A) => B): B
  63.  def foldRight[B](z: B)(op: (A, B) => B): B
  64.  def forall(p: (A) => Boolean): Boolean
  65.  def foreach[U](f: (A) => U): Unit
  66.  def fromSpecific(coll: IterableOnce[A]): TreeSet[A]
  67.  final def getClass(): Class[_ <: AnyRef]
  68.  def groupBy[K](f: (A) => K): immutable.Map[K, TreeSet[A]]
  69.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, Set[B]]
  70.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  71.  def grouped(size: Int): Iterator[TreeSet[A]]
  72.  def hashCode(): Int
  73.  def head: A
  74.  def headOption: Option[A]
  75.  def init: TreeSet[A]
  76.  def inits: Iterator[TreeSet[A]]
  77.  def intersect(that: collection.Set[A]): TreeSet[A]
  78.  def isEmpty: Boolean
  79.  final def isInstanceOf[T0]: Boolean
  80.  def isTraversableAgain: Boolean
  81.  def iterableFactory: IterableFactory[Set]
  82.  def iterator: Iterator[A]
  83.  def iteratorFrom(start: A): Iterator[A]
  84.  def knownSize: Int
  85.  def last: A
  86.  def lastKey: A
  87.  def lastOption: Option[A]
  88.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, TreeSet.this.type]
  89.  def map[B](f: (A) => B)(implicit ev: Ordering[B]): TreeSet[B]
  90.  def map[B](f: (A) => B): Set[B]
  91.  def mapResult[NewTo](f: (TreeSet[A]) => NewTo): Builder[A, NewTo]
  92.  def max[B >: A](implicit ord: Ordering[B]): A
  93.  def maxBefore(key: A): Option[A]
  94.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  95.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  96.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  97.  def min[B >: A](implicit ord: Ordering[B]): A
  98.  def minAfter(key: A): Option[A]
  99.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  100.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  101.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  102.  final def mkString: String
  103.  final def mkString(sep: String): String
  104.  final def mkString(start: String, sep: String, end: String): String
  105.  final def ne(arg0: AnyRef): Boolean
  106.  def newSpecificBuilder: Builder[A, TreeSet[A]]
  107.  def nonEmpty: Boolean
  108.  final def notify(): Unit
  109.  final def notifyAll(): Unit
  110.  implicit val ordering: Ordering[A]
  111.  def partition(p: (A) => Boolean): (TreeSet[A], TreeSet[A])
  112.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Set[A1], Set[A2])
  113.  def product[B >: A](implicit num: math.Numeric[B]): B
  114.  def range(from: A, until: A): TreeSet[A]
  115.  def rangeFrom(from: A): TreeSet[A]
  116.  def rangeImpl(from: Option[A], until: Option[A]): TreeSet[A]
  117.  def rangeTo(to: A): TreeSet[A]
  118.  def rangeUntil(until: A): TreeSet[A]
  119.  def reduce[B >: A](op: (B, B) => B): B
  120.  def reduceLeft[B >: A](op: (B, A) => B): B
  121.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  122.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  123.  def reduceRight[B >: A](op: (A, B) => B): B
  124.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  125.  def remove(elem: A): Boolean
  126.  def result(): TreeSet[A]
  127.  def reversed: collection.Iterable[A]
  128.  def scan[B >: A](z: B)(op: (B, B) => B): Set[B]
  129.  def scanLeft[B](z: B)(op: (B, A) => B): Set[B]
  130.  def scanRight[B](z: B)(op: (A, B) => B): Set[B]
  131.  def size: Int
  132.  def sizeCompare(that: collection.Iterable[_]): Int
  133.  def sizeCompare(otherSize: Int): Int
  134.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  135.  def sizeHint(size: Int): Unit
  136.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  137.  final def sizeIs: SizeCompareOps
  138.  def slice(from: Int, until: Int): TreeSet[A]
  139.  def sliding(size: Int, step: Int): Iterator[TreeSet[A]]
  140.  def sliding(size: Int): Iterator[TreeSet[A]]
  141.  def sortedIterableFactory: SortedIterableFactory[TreeSet]
  142.  def span(p: (A) => Boolean): (TreeSet[A], TreeSet[A])
  143.  def splitAt(n: Int): (TreeSet[A], TreeSet[A])
  144.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  145.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  146.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  147.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  148.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  149.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  150.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  151.  def stringPrefix: String
  152.  def subsetOf(that: collection.Set[A]): Boolean
  153.  def subsets(): Iterator[TreeSet[A]]
  154.  def subsets(len: Int): Iterator[TreeSet[A]]
  155.  def subtractAll(xs: IterableOnce[A]): TreeSet.this.type
  156.  def subtractOne(elem: A): TreeSet.this.type
  157.  def sum[B >: A](implicit num: math.Numeric[B]): B
  158.  final def synchronized[T0](arg0: => T0): T0
  159.  def tail: TreeSet[A]
  160.  def tails: Iterator[TreeSet[A]]
  161.  def take(n: Int): TreeSet[A]
  162.  def takeRight(n: Int): TreeSet[A]
  163.  def takeWhile(p: (A) => Boolean): TreeSet[A]
  164.  def tapEach[U](f: (A) => U): TreeSet[A]
  165.  def to[C1](factory: Factory[A, C1]): C1
  166.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  167.  final def toBuffer[B >: A]: Buffer[B]
  168.  def toIndexedSeq: immutable.IndexedSeq[A]
  169.  def toList: immutable.List[A]
  170.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  171.  def toSeq: immutable.Seq[A]
  172.  def toSet[B >: A]: immutable.Set[B]
  173.  def toString(): String
  174.  def toVector: immutable.Vector[A]
  175.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Set[Set[B]]
  176.  def unconstrained: collection.Set[A]
  177.  final def union(that: collection.Set[A]): TreeSet[A]
  178.  def unsorted: Set[A]
  179.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Set[A1], Set[A2])
  180.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
  181.  def update(elem: A, included: Boolean): Unit
  182.  def view: View[A]
  183.  final def wait(): Unit
  184.  final def wait(arg0: Long, arg1: Int): Unit
  185.  final def wait(arg0: Long): Unit
  186.  def withFilter(p: (A) => Boolean): SortedSetOps.WithFilter[A, [x]Set[x], [X]TreeSet[X]]
  187.  def writeReplace(): AnyRef
  188.  def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(A, B)]): TreeSet[(A, B)]
  189.  def zip[B](that: IterableOnce[B]): Set[(A, B)]
  190.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
  191.  def zipWithIndex: Set[(A, Int)]
  192.  final def |(that: collection.Set[A]): TreeSet[A]
Deprecated Value Members
  1.  def +(elem1: A, elem2: A, elems: A*): TreeSet[A]
  2.  def +(elem: A): TreeSet[A]
  3.  def ++:[B >: A](that: IterableOnce[B]): Set[B]
  4.  final def +=(elem1: A, elem2: A, elems: A*): TreeSet.this.type
  5.  def -(elem1: A, elem2: A, elems: A*): TreeSet[A]
  6.  def -(elem: A): TreeSet[A]
  7.  def --(that: IterableOnce[A]): TreeSet[A]
  8.  def -=(elem1: A, elem2: A, elems: A*): TreeSet.this.type
  9.  def /:[B](z: B)(op: (B, A) => B): B
  10.  final def /:[B](z: B)(op: (B, A) => B): B
  11.  def :\[B](z: B)(op: (A, B) => B): B
  12.  final def :\[B](z: B)(op: (A, B) => B): B
  13.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
  14.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
  15.  def companion: IterableFactory[[_]Set[_]]
  16.  def compare(k0: A, k1: A): Int
  17.  def copyToBuffer(dest: Buffer[A]): Unit
  18.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  19.  def count(f: (A) => Boolean): Int
  20.  def exists(f: (A) => Boolean): Boolean
  21.  def filter(f: (A) => Boolean): Iterator[A]
  22.  def find(p: (A) => Boolean): Option[A]
  23.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
  24.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  25.  def foldLeft[B](z: B)(op: (B, A) => B): B
  26.  def foldRight[B](z: B)(op: (A, B) => B): B
  27.  def forall(f: (A) => Boolean): Boolean
  28.  def foreach[U](f: (A) => U): Unit
  29.  def formatted(fmtstr: String): String
  30.  final def from(from: A): TreeSet[A]
  31.  def hasDefiniteSize: Boolean
  32.  def isEmpty: Boolean
  33.  def keysIteratorFrom(start: A): Iterator[A]
  34.  def map[B](f: (A) => B): IterableOnce[B]
  35.  def max(implicit ord: math.Ordering[A]): A
  36.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  37.  def min(implicit ord: math.Ordering[A]): A
  38.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  39.  def mkString: String
  40.  def mkString(sep: String): String
  41.  def mkString(start: String, sep: String, end: String): String
  42.  def nonEmpty: Boolean
  43.  def product(implicit num: math.Numeric[A]): A
  44.  def reduce(f: (A, A) => A): A
  45.  def reduceLeft(f: (A, A) => A): A
  46.  def reduceLeftOption(f: (A, A) => A): Option[A]
  47.  def reduceOption(f: (A, A) => A): Option[A]
  48.  def reduceRight(f: (A, A) => A): A
  49.  def reduceRightOption(f: (A, A) => A): Option[A]
  50.  final def repr: TreeSet[A]
  51.  final def retain(p: (A) => Boolean): Unit
  52.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  53.  def seq: TreeSet.this.type
  54.  def size: Int
  55.  def sum(implicit num: math.Numeric[A]): A
  56.  def to[C1](factory: Factory[A, C1]): C1
  57.  final def to(to: A): TreeSet[A]
  58.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  59.  def toBuffer[B >: A]: Buffer[B]
  60.  def toIndexedSeq: collection.IndexedSeq[A]
  61.  final def toIterable: collection.Iterable[A]
  62.  final def toIterable: TreeSet.this.type
  63.  def toIterator: Iterator[A]
  64.  final def toIterator: Iterator[A]
  65.  def toList: immutable.List[A]
  66.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  67.  def toSeq: immutable.Seq[A]
  68.  def toSet[B >: A]: immutable.Set[B]
  69.  def toStream: immutable.Stream[A]
  70.  final def toStream: immutable.Stream[A]
  71.  final def toTraversable: collection.Traversable[A]
  72.  final def toTraversable: collection.Traversable[A]
  73.  def toVector: immutable.Vector[A]
  74.  final def until(until: A): TreeSet[A]
  75.  def view(from: Int, until: Int): View[A]
  76.  def withFilter(f: (A) => Boolean): Iterator[A]
  77.  def →[B](y: B): (TreeSet[A], B)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4