Scala Standard Library 2.12.18 - scala.collection.SortedSet (original) (raw)
trait SortedSet[A] extends Set[A] with SortedSetLike[A, SortedSet[A]]
Ordering
- Alphabetic
- By Inheritance
Inherited
- SortedSet
- SortedSetLike
- Sorted
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Function1
- AnyRef
- Any
Implicitly
by CollectionsHaveToParArray
by MonadOps
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
by alternateImplicit
Hide All
Show All
Abstract Value Members
- abstract def +(elem: A): SortedSet[A]
- abstract def -(elem: A): SortedSet[A]
- abstract def contains(elem: A): Boolean
- abstract def iterator: Iterator[A]
- abstract def keysIteratorFrom(start: A): Iterator[A]
- implicit abstract def ordering: Ordering[A]
- abstract def rangeImpl(from: Option[A], until: Option[A]): SortedSet[A]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def &(that: GenSet[A]): SortedSet[A]
- def &~(that: GenSet[A]): SortedSet[A]
- def +(elem1: A, elem2: A, elems: A*): SortedSet[A]
- def ++(elems: GenTraversableOnce[A]): SortedSet[A]
- def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[SortedSet[A], B, That]): That
- def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[SortedSet[A], B, That]): That
- def ++:[B](that: TraversableOnce[B]): Set[B]
- def -(elem1: A, elem2: A, elems: A*): SortedSet[A]
- def --(xs: GenTraversableOnce[A]): SortedSet[A]
- def ->[B](y: B): (SortedSet[A], B)
- final def ==(arg0: Any): Boolean
- def addString(b: StringBuilder): StringBuilder
- def addString(b: StringBuilder, sep: String): StringBuilder
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
- def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
- def apply(elem: A): Boolean
- final def asInstanceOf[T0]: T0
- def canEqual(that: Any): Boolean
- def clone(): AnyRef
- def collect[B](pf: PartialFunction[A, B]): Set[B]
- def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- def companion: GenericCompanion[Set]
- def compare(k0: A, k1: A): Int
- def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
- def copyToArray(xs: Array[A], start: Int, len: Int): Unit
- def copyToArray(xs: Array[A]): Unit
- def copyToArray(xs: Array[A], start: Int): Unit
- def copyToBuffer[B >: A](dest: Buffer[B]): Unit
- def count(p: (A) ⇒ Boolean): Int
- def diff(that: GenSet[A]): SortedSet[A]
- def drop(n: Int): SortedSet[A]
- def dropRight(n: Int): SortedSet[A]
- def dropWhile(p: (A) ⇒ Boolean): SortedSet[A]
- def empty: SortedSet[A]
- def ensuring(cond: (SortedSet[A]) ⇒ Boolean, msg: ⇒ Any): SortedSet[A]
- def ensuring(cond: (SortedSet[A]) ⇒ Boolean): SortedSet[A]
- def ensuring(cond: Boolean, msg: ⇒ Any): SortedSet[A]
- def ensuring(cond: Boolean): SortedSet[A]
- final def eq(arg0: AnyRef): Boolean
- def equals(that: Any): Boolean
- def exists(p: (A) ⇒ Boolean): Boolean
- def filter(p: (A) ⇒ Boolean): SortedSet[A]
- def filterNot(p: (A) ⇒ Boolean): SortedSet[A]
- def finalize(): Unit
- def find(p: (A) ⇒ Boolean): Option[A]
- def firstKey: A
- def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Set[B]
- def flatten[B]: Set[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
- 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
- def from(from: A): SortedSet[A]
- def genericBuilder[B]: Builder[B, Set[B]]
- final def getClass(): Class[_]
- def groupBy[K](f: (A) ⇒ K): immutable.Map[K, SortedSet[A]]
- def grouped(size: Int): Iterator[SortedSet[A]]
- def hasAll(j: Iterator[A]): Boolean
- def hasDefiniteSize: Boolean
- def hashCode(): Int
- def head: A
- def headOption: Option[A]
- def init: SortedSet[A]
- def inits: Iterator[SortedSet[A]]
- def intersect(that: GenSet[A]): SortedSet[A]
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- final def isTraversableAgain: Boolean
- def iteratorFrom(start: A): Iterator[A]
- def keySet: SortedSet[A]
- def last: A
- def lastKey: A
- def lastOption: Option[A]
- def map[B](f: (A) ⇒ B): Set[B]
- def max: A
- def maxBy[B](f: (A) ⇒ B): A
- def min: A
- def minBy[B](f: (A) ⇒ B): A
- def mkString: String
- def mkString(sep: String): String
- def mkString(start: String, sep: String, end: String): String
- final def ne(arg0: AnyRef): Boolean
- def newBuilder: Builder[A, SortedSet[A]]
- def nonEmpty: Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def par: ParSet[A]
- def parCombiner: Combiner[A, ParSet[A]]
- def partition(p: (A) ⇒ Boolean): (SortedSet[A], SortedSet[A])
- def product: A
- def range(from: A, until: A): SortedSet[A]
- def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
- def reduceLeft[B >: A](op: (B, A) ⇒ B): B
- def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
- def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
- def reduceRight[B >: A](op: (A, B) ⇒ B): B
- def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
- def repr: SortedSet[A]
- def reversed: List[A]
- def sameElements(that: GenIterable[A]): Boolean
- def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SortedSet[A], B, That]): That
- def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SortedSet[A], B, That]): That
- def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SortedSet[A], B, That]): That
- def seq: Set[A]
- def size: Int
- def sizeHintIfCheap: Int
- def slice(from: Int, until: Int): SortedSet[A]
- def sliding(size: Int, step: Int): Iterator[SortedSet[A]]
- def sliding(size: Int): Iterator[SortedSet[A]]
- def span(p: (A) ⇒ Boolean): (SortedSet[A], SortedSet[A])
- def splitAt(n: Int): (SortedSet[A], SortedSet[A])
- def stringPrefix: String
- def subsetOf(that: GenSet[A]): Boolean
- def subsets(): Iterator[SortedSet[A]]
- def subsets(len: Int): Iterator[SortedSet[A]]
- def sum: A
- final def synchronized[T0](arg0: ⇒ T0): T0
- def tail: SortedSet[A]
- def tails: Iterator[SortedSet[A]]
- def take(n: Int): SortedSet[A]
- def takeRight(n: Int): SortedSet[A]
- def takeWhile(p: (A) ⇒ Boolean): SortedSet[A]
- def thisCollection: Iterable[A]
- def to(to: A): SortedSet[A]
- def to[Col[_]]: Col[A]
- def toArray: Array[A]
- def toBuffer[A1 >: A]: Buffer[A1]
- def toCollection(repr: SortedSet[A]): Iterable[A]
- def toIndexedSeq: immutable.IndexedSeq[A]
- def toIterable: Iterable[A]
- def toIterator: Iterator[A]
- def toList: List[A]
- def toMap[T, U]: Map[T, U]
- def toParArray: ParArray[T]
- def toSeq: Seq[A]
- def toSet[B >: A]: immutable.Set[B]
- def toStream: immutable.Stream[A]
- def toString(): String
- def toTraversable: Traversable[A]
- def toVector: Vector[A]
- def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- def union(that: GenSet[A]): SortedSet[A]
- def until(until: A): SortedSet[A]
- def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
- def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- def view(from: Int, until: Int): IterableView[A, SortedSet[A]]
- def view: IterableView[A, SortedSet[A]]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, SortedSet[A]]
- def zip[B](that: GenIterable[B]): Set[(A, B)]
- def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Set[(A, B)]
- def zipWithIndex: Set[(A, Int)]
- def |(that: GenSet[A]): SortedSet[A]
- def →[B](y: B): (SortedSet[A], B)
Deprecated Value Members
- def /:[B](z: B)(op: (B, A) ⇒ B): B
- def :\[B](z: B)(op: (A, B) ⇒ B): B
- def formatted(fmtstr: String): String