class IntervalSet[T] extends SortedSet[Interval[T]] with SortedSetOps[Interval[T], SortedSet, IntervalSet[T]] with Serializable
A set containing 0 or more intervals. Intervals which may be unioned together are automatically coalesced, so at all times an interval set contains the minimum number of necessary intervals. Interval sets are immutable and persistent.
- Alphabetic
- By Inheritance
- IntervalSet
- Serializable
- SortedSet
- SortedSetOps
- SortedSet
- SortedSetFactoryDefaults
- SortedSetOps
- SortedOps
- Set
- SetOps
- Set
- Equals
- SetOps
- Function1
- Iterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def &(interval: Interval[T]): IntervalSet[T]
Alias for
intersect
. - final def &(that: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def +(elem: Interval[T]): IntervalSet[T]
- Definition Classes
- SetOps → SetOps
- final def ++(that: IterableOnce[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: Interval[T]](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def -(elem: Interval[T]): IntervalSet[T]
- Definition Classes
- SetOps → SetOps
- Annotations
- @inline()
- final def --(that: IterableOnce[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps → SetOps
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: mutable.StringBuilder): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[A](g: (Boolean) => A): (Interval[T]) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def apply(elem: Interval[T]): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- def className: String
- Definition Classes
- IntervalSet → Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coll: IntervalSet.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Interval[T], B])(implicit ev: Ordering[B]): SortedSet[B]
- Definition Classes
- SortedSetOps
- def collect[B](pf: PartialFunction[Interval[T], B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Interval[T], B]): Option[B]
- Definition Classes
- IterableOnceOps
- def complement: IntervalSet[T]
- def compose[A](g: (A) => Interval[T]): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(that: IterableOnce[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- def concat[B >: Interval[T]](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- def contains(interval: Interval[T]): Boolean
- Definition Classes
- IntervalSet → SetOps
- def containsPoint(point: T): Boolean
- def copyToArray[B >: Interval[T]](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Interval[T]](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Interval[T]](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: IterableOnce[B])(p: (Interval[T], B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Interval[T]) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff(that: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps → SetOps
- def drop(n: Int): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def dropRight(n: Int): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps
- def dropWhile(p: (Interval[T]) => Boolean): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def empty: IntervalSet[T]
- Definition Classes
- IntervalSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- SortedSet → Set → Equals → AnyRef → Any
- def excl(elem: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SetOps
- def exists(p: (Interval[T]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (Interval[T]) => Boolean): IntervalSet[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (Interval[T]) => Boolean): IntervalSet[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: (Interval[T]) => Boolean): Option[Interval[T]]
- Definition Classes
- IterableOnceOps
- def firstKey: Interval[T]
- Definition Classes
- IntervalSet → SortedSetOps → SortedOps
- def flatMap[B](f: (Interval[T]) => IterableOnce[B])(implicit ev: Ordering[B]): SortedSet[B]
- Definition Classes
- SortedSetOps
- def flatMap[B](f: (Interval[T]) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Interval[T]) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: Interval[T]](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Interval[T]) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Interval[T], B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Interval[T]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Interval[T]) => U): Unit
- Definition Classes
- IntervalSet → IterableOnceOps
- def fromSpecific(coll: scala.IterableOnce[Interval[T]]): IntervalSet[T]
- Attributes
- protected
- Definition Classes
- IntervalSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (Interval[T]) => K): Map[K, IntervalSet[T]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Interval[T]) => K)(f: (Interval[T]) => B): Map[K, Set[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Interval[T]) => K)(f: (Interval[T]) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[IntervalSet[T]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Set → AnyRef → Any
- def head: Interval[T]
- Definition Classes
- IntervalSet → IterableOps
- def headOption: Option[Interval[T]]
- Definition Classes
- IntervalSet → IterableOps
- def incl(elem: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SetOps
- def init: IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps
- def inits: Iterator[IntervalSet[T]]
- Definition Classes
- IterableOps
- def intersect(other: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- IntervalSet → SetOps
- def intersect(interval: Interval[T]): IntervalSet[T]
Returns the the result of the intervals in this set intersected with the given interval.
- def intersecting(interval: Interval[T]): IntervalSet[T]
Returns the subset of intervals which intersect with the given interval.
- def intersects(interval: Interval[T]): Boolean
Tests if the provided interval intersects with any of the intervals in this set.
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Set]
- Definition Classes
- Set → Set → Iterable → Iterable → IterableOps
- def iterator: scala.Iterator[Interval[T]]
- Definition Classes
- IntervalSet → IterableOnce
- def iteratorFrom(start: Interval[T]): scala.Iterator[Interval[T]]
- Definition Classes
- IntervalSet → SortedSetOps
- def keysIteratorFrom(start: Interval[T]): scala.Iterator[Interval[T]]
- Definition Classes
- IntervalSet → SortedSetOps
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: Interval[T]
- Definition Classes
- IntervalSet → IterableOps
- def lastKey: Interval[T]
- Definition Classes
- IntervalSet → SortedSetOps → SortedOps
- def lastOption: Option[Interval[T]]
- Definition Classes
- IntervalSet → IterableOps
- def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Interval[T], B, IntervalSet.this.type]
- Definition Classes
- Iterable
- def map[B](f: (Interval[T]) => B)(implicit ev: Ordering[B]): SortedSet[B]
- Definition Classes
- SortedSetOps
- def map[B](f: (Interval[T]) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: Interval[T]](implicit ord: Ordering[B]): Interval[T]
- Definition Classes
- SortedSetOps → IterableOnceOps
- def maxBefore(key: Interval[T]): Option[Interval[T]]
- Definition Classes
- SortedSetOps
- def maxBy[B](f: (Interval[T]) => B)(implicit cmp: math.Ordering[B]): Interval[T]
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Interval[T]) => B)(implicit cmp: math.Ordering[B]): Option[Interval[T]]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Interval[T]](implicit ord: math.Ordering[B]): Option[Interval[T]]
- Definition Classes
- IterableOnceOps
- def min[B >: Interval[T]](implicit ord: Ordering[B]): Interval[T]
- Definition Classes
- SortedSetOps → IterableOnceOps
- def minAfter(key: Interval[T]): Option[Interval[T]]
- Definition Classes
- SortedSetOps
- def minBy[B](f: (Interval[T]) => B)(implicit cmp: math.Ordering[B]): Interval[T]
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Interval[T]) => B)(implicit cmp: math.Ordering[B]): Option[Interval[T]]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Interval[T]](implicit ord: math.Ordering[B]): Option[Interval[T]]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Interval[T], IntervalSet[T]]
- Attributes
- protected
- Definition Classes
- IntervalSet → SortedSetFactoryDefaults → IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def ordering: Ordering[Interval[T]]
- Definition Classes
- IntervalSet → SortedOps
- def partition(p: (Interval[T]) => Boolean): (IntervalSet[T], IntervalSet[T])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Interval[T]) => Either[A1, A2]): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def product[B >: Interval[T]](implicit num: math.Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def range(from: Interval[T], until: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SortedOps
- def rangeFrom(from: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SortedOps
- def rangeImpl(from: Option[Interval[T]], until: Option[Interval[T]]): IntervalSet[T]
- Definition Classes
- IntervalSet → SortedOps
- def rangeTo(to: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SortedSetOps → SortedOps
- def rangeUntil(until: Interval[T]): IntervalSet[T]
- Definition Classes
- IntervalSet → SortedOps
- def reduce[B >: Interval[T]](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Interval[T]](op: (B, Interval[T]) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Interval[T]](op: (B, Interval[T]) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Interval[T]](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Interval[T]](op: (Interval[T], B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Interval[T]](op: (Interval[T], B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def removedAll(that: IterableOnce[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- def reversed: collection.Iterable[Interval[T]]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: Interval[T]](z: B)(op: (B, B) => B): Set[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Interval[T]) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Interval[T], B) => B): Set[B]
- Definition Classes
- IterableOps
- def size: Int
- Definition Classes
- IntervalSet → IterableOnceOps
- def sizeCompare(that: collection.Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[IntervalSet[T]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[IntervalSet[T]]
- Definition Classes
- IterableOps
- def sortedIterableFactory: SortedIterableFactory[SortedSet]
- Definition Classes
- SortedSet → SortedSet → SortedSetOps
- def span: Option[Interval[T]]
- def span(p: (Interval[T]) => Boolean): (IntervalSet[T], IntervalSet[T])
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def splitAt(n: Int): (IntervalSet[T], IntervalSet[T])
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Interval[T], S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- SortedSet → Set → Iterable
- def subsetOf(that: collection.Set[Interval[T]]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[IntervalSet[T]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[IntervalSet[T]]
- Definition Classes
- SetOps
- def sum[B >: Interval[T]](implicit num: math.Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps
- def tails: Iterator[IntervalSet[T]]
- Definition Classes
- IterableOps
- def take(n: Int): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def takeRight(n: Int): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps
- def takeWhile(p: (Interval[T]) => Boolean): IntervalSet[T]
- Definition Classes
- IntervalSet → IterableOps → IterableOnceOps
- def tapEach[U](f: (Interval[T]) => U): IntervalSet[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Interval[T], C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Interval[T]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Interval[T]]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[Interval[T]]
- Definition Classes
- IterableOnceOps
- final def toIterable: IntervalSet.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[Interval[T]]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Interval[T], (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Interval[T]]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Interval[T]]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Set → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[Interval[T]]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Interval[T]) => collection.Iterable[B]): Set[Set[B]]
- Definition Classes
- IterableOps
- final def union(that: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unioning(interval: Interval[T]): IntervalSet[T]
Returns the subset of intervals which union with the given interval.
- def unsorted: Set[Interval[T]]
- Definition Classes
- SortedSet → SortedSetOps → SortedSet → SortedSetOps
- def unzip[A1, A2](implicit asPair: (Interval[T]) => (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Interval[T]) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- IterableOps
- def view: View[Interval[T]]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (Interval[T]) => Boolean): SortedSetOps.WithFilter[Interval[T], [x]Set[x], [X]SortedSet[X]]
- Definition Classes
- SortedSetFactoryDefaults → IterableOps
- def zip[B](that: IterableOnce[B])(implicit ev: Ordering[(Interval[T], B)]): SortedSet[(Interval[T], B)]
- Definition Classes
- SortedSetOps
- def zip[B](that: IterableOnce[B]): Set[(Interval[T], B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Interval[T], B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Set[(Interval[T], Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: collection.Set[Interval[T]]): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
Deprecated Value Members
- def +(elem1: Interval[T], elem2: Interval[T], elems: Interval[T]*): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def ++:[B >: Interval[T]](that: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def -(elem1: Interval[T], elem2: Interval[T], elems: Interval[T]*): IntervalSet[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- final def /:[B](z: B)(op: (B, Interval[T]) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (Interval[T], B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Interval[T]) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[[_]Set[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def compare(k0: Interval[T], k1: Interval[T]): Int
- Definition Classes
- SortedOps
- Annotations
- @deprecated @deprecatedOverriding("Use ordering.compare instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use ordering.compare instead
- final def copyToBuffer[B >: Interval[T]](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- final def from(from: Interval[T]): IntervalSet[T]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeFrom
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def repr: IntervalSet[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def seq: IntervalSet.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def to(to: Interval[T]): IntervalSet[T]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeTo
- final def toIterator: Iterator[Interval[T]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[Interval[T]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: collection.Traversable[Interval[T]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def until(until: Interval[T]): IntervalSet[T]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeUntil
- def view(from: Int, until: Int): View[Interval[T]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)