final case class IntervalSet[A](intervals: IndexedSeq[(A, A)]) extends Product with Serializable
IntervalSet is set of intervals.
intervals is a sequence of discrete intervals sorted by start value. Each interval is represented by a pair of
values [start, end).
- Alphabetic
- By Inheritance
- IntervalSet
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new IntervalSet(intervals: IndexedSeq[(A, A)])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def contains(value: A)(implicit A: Ordering[A]): Boolean
Checks whether this interval set contains the value or not.
- def diff(that: IntervalSet[A])(implicit A: Ordering[A]): IntervalSet[A]
Computes a difference interval set.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def intersection(that: IntervalSet[A])(implicit A: Ordering[A]): IntervalSet[A]
Computes an intersection of two interval sets.
- val intervals: IndexedSeq[(A, A)]
- def isEmpty: Boolean
Checks whether this interval set is empty or not.
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[B](f: (A) => B)(implicit B: Ordering[B]): IntervalSet[B]
Converts each interval by the mapping.
Converts each interval by the mapping.
Note that the mapping
fmust be monotonic on each interval. - def mapIntersection(that: IntervalSet[A])(f: (A) => A)(implicit A: Ordering[A]): IntervalSet[A]
Merges the mapped intersection and the difference.
Merges the mapped intersection and the difference.
Note that the mapping
fmust be monotonic on each interval. - final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonEmpty: Boolean
Negates isEmpty.
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def partition(that: IntervalSet[A])(implicit A: Ordering[A]): Partition[IntervalSet[A]]
Computes
this intersect that,this diff thatandthat diff thisat once. - def productElementNames: Iterator[String]
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
Returns a string representation of this interval set.
Returns a string representation of this interval set.
- Definition Classes
- IntervalSet → AnyRef → Any
- def union(that: IntervalSet[A])(implicit A: Ordering[A]): IntervalSet[A]
Computes a union of two interval sets.
- 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])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated