IntervalSeq

Instance Constructors

new IntervalSeq(intervals: Seq[Interval[T]])(implicit ev: (T) ⇒ Ordered[T])

インスタンスを生成する。
インスタンスを生成する。
orderingはUpperLowerOrdering[T](true, false)を利用する。
intervals
Intervalの列
new IntervalSeq()(implicit ev: (T) ⇒ Ordered[T])

インスタンスを生成する。
インスタンスを生成する。
intervalsは空を利用し、orderingはUpperLowerOrdering[T](true, false)を利用する。
new IntervalSeq(intervals: Seq[Interval[T]], ordering: Ordering[Interval[T]])(implicit ev: (T) ⇒ Ordered[T])

intervals
Intervalの列
ordering
Ordering

Type Members

type Self = IntervalSeq[T]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++[B >: Interval[T], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: Interval[T], That](that: Traversable[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: Interval[T], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike
def +:[B >: Interval[T], That](elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def /:[B](z: B)(op: (B, Interval[T]) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :+[B >: Interval[T], That](elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def :\[B](z: B)(op: (Interval[T], B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

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

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, Interval[T]) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def andThen[C](k: (Interval[T]) ⇒ C): PartialFunction[Int, C]

Definition Classes
PartialFunction → Function1
def apply(idx: Int): Interval[T]

Definition Classes
IntervalSeq → SeqLike → GenSeqLike → Function1
def applyOrElse[A1 <: Int, B1 >: Interval[T]](x: A1, default: (A1) ⇒ B1): B1

Definition Classes
PartialFunction
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(that: Any): Boolean

Definition Classes
IterableLike → Equals
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B, That](pf: PartialFunction[Interval[T], B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[Interval[T], B]): Option[B]

Definition Classes
TraversableOnce
def combinations(n: Int): Iterator[IntervalSeq[T]]

Definition Classes
SeqLike
def companion: GenericCompanion[Seq]

Definition Classes
Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
def compose[A](g: (A) ⇒ Int): (A) ⇒ Interval[T]

Definition Classes
Function1
Annotations
@unspecialized()
def contains[A1 >: Interval[T]](elem: A1): Boolean

Definition Classes
SeqLike
def containsSlice[B](that: GenSeq[B]): Boolean

Definition Classes
SeqLike
def copyToArray[B >: Interval[T]](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: Interval[T]](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: Interval[T]](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: Interval[T]](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def corresponds[B](that: GenSeq[B])(p: (Interval[T], B) ⇒ Boolean): Boolean

Definition Classes
SeqLike → GenSeqLike
def count(p: (Interval[T]) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def diff[B >: Interval[T]](that: GenSeq[B]): IntervalSeq[T]

Definition Classes
SeqLike → GenSeqLike
def distinct: IntervalSeq[T]

Definition Classes
SeqLike → GenSeqLike
def drop(n: Int): IntervalSeq[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): IntervalSeq[T]

Definition Classes
IterableLike
def dropWhile(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def endsWith[B](that: GenSeq[B]): Boolean

Definition Classes
SeqLike → GenSeqLike
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
GenSeqLike → Equals → Any
def exists(p: (Interval[T]) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
lazy val extent: Interval[T]

全ての要素区間を内包する、最小の区間を返す。
全ての要素区間を内包する、最小の区間を返す。
returns
全ての要素区間を内包する、最小の区間

Exceptions thrown
IllegalStateException 要素が1つもない場合
def filter(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (Interval[T]) ⇒ Boolean): Option[Interval[T]]

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def flatMap[B, That](f: (Interval[T]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (Interval[T]) ⇒ GenTraversableOnce[B]): Seq[B]

Definition Classes
GenericTraversableTemplate
def fold[A1 >: Interval[T]](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, Interval[T]) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (Interval[T], B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (Interval[T]) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (Interval[T]) ⇒ U): Unit

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
lazy val gaps: IntervalSeq[T]

ソート済みの区間で、隣り合った区間同士に挟まれる区間を区間列として返す。
ソート済みの区間で、隣り合った区間同士に挟まれる区間を区間列として返す。
結果の区間列の java.util.Comparator は、この区間列の java.util.Comparator を流用する。
区間数が2つ未満の場合は、空の区間列を返す。また、区間同士が重なっていたり接していた場合は、その区間は結果の要素に含まない。全てが重なっている場合は、空の区間列を返す。
returns
ギャップ区間列
def genericBuilder[B]: Builder[B, Seq[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (Interval[T]) ⇒ K): Map[K, IntervalSeq[T]]

Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[IntervalSeq[T]]

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

Definition Classes
GenSeqLike → Any
def head: Interval[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[Interval[T]]

Definition Classes
TraversableLike → GenTraversableLike
def indexOf[B >: Interval[T]](elem: B, from: Int): Int

Definition Classes
GenSeqLike
def indexOf[B >: Interval[T]](elem: B): Int

Definition Classes
GenSeqLike
def indexOfSlice[B >: Interval[T]](that: GenSeq[B], from: Int): Int

Definition Classes
SeqLike
def indexOfSlice[B >: Interval[T]](that: GenSeq[B]): Int

Definition Classes
SeqLike
def indexWhere(p: (Interval[T]) ⇒ Boolean, from: Int): Int

Definition Classes
SeqLike → GenSeqLike
def indexWhere(p: (Interval[T]) ⇒ Boolean): Int

Definition Classes
GenSeqLike
def indices: Range

Definition Classes
SeqLike
def init: IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[IntervalSeq[T]]

Definition Classes
TraversableLike
def intersect[B >: Interval[T]](that: GenSeq[B]): IntervalSeq[T]

Definition Classes
SeqLike → GenSeqLike
lazy val intersections: IntervalSeq[T]

ソート済みの区間で、隣り合った区間同士が重なっている区間を区間列として返す。
ソート済みの区間で、隣り合った区間同士が重なっている区間を区間列として返す。
結果の区間列の java.util.Comparator は、この区間列の java.util.Comparator を流用する。
区間数が2つ未満の場合は、空の区間列を返す。また、区間同士が重ならなかったり接していた場合は、その区間は結果の要素に含まない。全てが重ならない場合は、空の区間列を返す。
returns
共通区間列
val intervals: Seq[Interval[T]]

Intervalの列
def isDefinedAt(idx: Int): Boolean

Definition Classes
GenSeqLike
def isEmpty: Boolean

Definition Classes
SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def iterator: Iterator[Interval[T]]

Definition Classes
IntervalSeq → IterableLike → GenIterableLike
def last: Interval[T]

Definition Classes
TraversableLike → GenTraversableLike
def lastIndexOf[B >: Interval[T]](elem: B, end: Int): Int

Definition Classes
GenSeqLike
def lastIndexOf[B >: Interval[T]](elem: B): Int

Definition Classes
GenSeqLike
def lastIndexOfSlice[B >: Interval[T]](that: GenSeq[B], end: Int): Int

Definition Classes
SeqLike
def lastIndexOfSlice[B >: Interval[T]](that: GenSeq[B]): Int

Definition Classes
SeqLike
def lastIndexWhere(p: (Interval[T]) ⇒ Boolean, end: Int): Int

Definition Classes
SeqLike → GenSeqLike
def lastIndexWhere(p: (Interval[T]) ⇒ Boolean): Int

Definition Classes
GenSeqLike
def lastOption: Option[Interval[T]]

Definition Classes
TraversableLike → GenTraversableLike
def length: Int

Definition Classes
IntervalSeq → SeqLike → GenSeqLike
def lengthCompare(len: Int): Int

Definition Classes
SeqLike
def lift: (Int) ⇒ Option[Interval[T]]

Definition Classes
PartialFunction
def map[B, That](f: (Interval[T]) ⇒ B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max[B >: Interval[T]](implicit cmp: Ordering[B]): Interval[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (Interval[T]) ⇒ B)(implicit cmp: Ordering[B]): Interval[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: Interval[T]](implicit cmp: Ordering[B]): Interval[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (Interval[T]) ⇒ B)(implicit cmp: Ordering[B]): Interval[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[Interval[T], IntervalSeq[T]]

Attributes
protected
Definition Classes
IntervalSeq → GenericTraversableTemplate → TraversableLike → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def orElse[A1 <: Int, B1 >: Interval[T]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Definition Classes
PartialFunction
val ordering: Ordering[Interval[T]]

Ordering
def padTo[B >: Interval[T], That](len: Int, elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def par: ParSeq[Interval[T]]

Definition Classes
Parallelizable
def parCombiner: Combiner[Interval[T], ParSeq[Interval[T]]]

Attributes
protected[this]
Definition Classes
SeqLike → TraversableLike → Parallelizable
def partition(p: (Interval[T]) ⇒ Boolean): (IntervalSeq[T], IntervalSeq[T])

Definition Classes
TraversableLike → GenTraversableLike
def patch[B >: Interval[T], That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def permutations: Iterator[IntervalSeq[T]]

Definition Classes
SeqLike
def prefixLength(p: (Interval[T]) ⇒ Boolean): Int

Definition Classes
GenSeqLike
def product[B >: Interval[T]](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: Interval[T]](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: Interval[T]](op: (B, Interval[T]) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: Interval[T]](op: (B, Interval[T]) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: Interval[T]](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: Interval[T]](op: (Interval[T], B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: Interval[T]](op: (Interval[T], B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def reverse: IntervalSeq[T]

Definition Classes
SeqLike → GenSeqLike
def reverseIterator: Iterator[Interval[T]]

Definition Classes
SeqLike
def reverseMap[B, That](f: (Interval[T]) ⇒ B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def reversed: List[Interval[T]]

Attributes
protected[this]
Definition Classes
TraversableOnce
def runWith[U](action: (Interval[T]) ⇒ U): (Int) ⇒ Boolean

Definition Classes
PartialFunction
def sameElements[B >: Interval[T]](that: GenIterable[B]): Boolean

Definition Classes
IterableLike → GenIterableLike
def scan[B >: Interval[T], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, Interval[T]) ⇒ B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (Interval[T], B) ⇒ B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def segmentLength(p: (Interval[T]) ⇒ Boolean, from: Int): Int

Definition Classes
SeqLike → GenSeqLike
def seq: Seq[Interval[T]]

Definition Classes
Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): IntervalSeq[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[IntervalSeq[T]]

Definition Classes
IterableLike
def sliding(size: Int): Iterator[IntervalSeq[T]]

Definition Classes
IterableLike
def sortBy[B](f: (Interval[T]) ⇒ B)(implicit ord: Ordering[B]): IntervalSeq[T]

Definition Classes
SeqLike
def sortWith(lt: (Interval[T], Interval[T]) ⇒ Boolean): IntervalSeq[T]

Definition Classes
SeqLike
def sorted[B >: Interval[T]](implicit ord: Ordering[B]): IntervalSeq[T]

Definition Classes
SeqLike
def span(p: (Interval[T]) ⇒ Boolean): (IntervalSeq[T], IntervalSeq[T])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (IntervalSeq[T], IntervalSeq[T])

Definition Classes
TraversableLike → GenTraversableLike
def startsWith[B](that: GenSeq[B], offset: Int): Boolean

Definition Classes
SeqLike → GenSeqLike
def startsWith[B](that: GenSeq[B]): Boolean

Definition Classes
GenSeqLike
def stringPrefix: String

Definition Classes
TraversableLike → GenTraversableLike
def sum[B >: Interval[T]](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: IntervalSeq[T]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[IntervalSeq[T]]

Definition Classes
TraversableLike
def take(n: Int): IntervalSeq[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): IntervalSeq[T]

Definition Classes
IterableLike
def takeWhile(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Seq[Interval[T]]

Attributes
protected[this]
Definition Classes
SeqLike → IterableLike → TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Interval[T], Col[Interval[T]]]): Col[Interval[T]]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: Interval[T]](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: Interval[T]]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: IntervalSeq[T]): Seq[Interval[T]]

Attributes
protected[this]
Definition Classes
SeqLike → IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[Interval[T]]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[Interval[T]]

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[Interval[T]]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toList: List[Interval[T]]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[Interval[T], (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[Interval[T]]

Definition Classes
SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
def toSet[B >: Interval[T]]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[Interval[T]]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

Definition Classes
SeqLike → TraversableLike → Any
def toTraversable: Traversable[Interval[T]]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[Interval[T]]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (Interval[T]) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def union[B >: Interval[T], That](that: GenSeq[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def unzip[A1, A2](implicit asPair: (Interval[T]) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (Interval[T]) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])

Definition Classes
GenericTraversableTemplate
def updated[B >: Interval[T], That](index: Int, elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

Definition Classes
SeqLike → GenSeqLike
def view(from: Int, until: Int): SeqView[Interval[T], IntervalSeq[T]]

Definition Classes
SeqLike → IterableLike → TraversableLike
def view: SeqView[Interval[T], IntervalSeq[T]]

Definition Classes
SeqLike → IterableLike → TraversableLike
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (Interval[T]) ⇒ Boolean): FilterMonadic[Interval[T], IntervalSeq[T]]

Definition Classes
TraversableLike → FilterMonadic
def zip[A1 >: Interval[T], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IntervalSeq[T], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: Interval[T], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: Interval[T], That](implicit bf: CanBuildFrom[IntervalSeq[T], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike

Related Docs: object IntervalSeq | package intervals

class IntervalSeq[T] extends Seq[Interval[T]] with SeqLike[Interval[T], IntervalSeq[T]]

Instance Constructors

new IntervalSeq(intervals: Seq[Interval[T]])(implicit ev: (T) ⇒ Ordered[T])

new IntervalSeq()(implicit ev: (T) ⇒ Ordered[T])

new IntervalSeq(intervals: Seq[Interval[T]], ordering: Ordering[Interval[T]])(implicit ev: (T) ⇒ Ordered[T])

Type Members

type Self = IntervalSeq[T]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Interval[T], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def ++:[B >: Interval[T], That](that: Traversable[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def ++:[B >: Interval[T], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def +:[B >: Interval[T], That](elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def /:[B](z: B)(op: (B, Interval[T]) ⇒ B): B

def :+[B >: Interval[T], That](elem: B)(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def :\[B](z: B)(op: (Interval[T], B) ⇒ B): 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, Interval[T]) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (Interval[T]) ⇒ C): PartialFunction[Int, C]

def apply(idx: Int): Interval[T]

def applyOrElse[A1 <: Int, B1 >: Interval[T]](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Interval[T], B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

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

def combinations(n: Int): Iterator[IntervalSeq[T]]

def companion: GenericCompanion[Seq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ Interval[T]

def contains[A1 >: Interval[T]](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def copyToArray[B >: Interval[T]](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Interval[T]](xs: Array[B]): Unit

def copyToArray[B >: Interval[T]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Interval[T]](dest: Buffer[B]): Unit

def corresponds[B](that: GenSeq[B])(p: (Interval[T], B) ⇒ Boolean): Boolean

def count(p: (Interval[T]) ⇒ Boolean): Int

def diff[B >: Interval[T]](that: GenSeq[B]): IntervalSeq[T]

def distinct: IntervalSeq[T]

def drop(n: Int): IntervalSeq[T]

def dropRight(n: Int): IntervalSeq[T]

def dropWhile(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (Interval[T]) ⇒ Boolean): Boolean

lazy val extent: Interval[T]

def filter(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

def filterNot(p: (Interval[T]) ⇒ Boolean): IntervalSeq[T]

def finalize(): Unit

def find(p: (Interval[T]) ⇒ Boolean): Option[Interval[T]]

def flatMap[B, That](f: (Interval[T]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalSeq[T], B, That]): That

def flatten[B](implicit asTraversable: (Interval[T]) ⇒ GenTraversableOnce[B]): Seq[B]

def fold[A1 >: Interval[T]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Interval[T]) ⇒ B): B

def foldRight[B](z: B)(op: (Interval[T], B) ⇒ B): B

def forall(p: (Interval[T]) ⇒ Boolean): Boolean

def foreach[U](f: (Interval[T]) ⇒ U): Unit

lazy val gaps: IntervalSeq[T]

def genericBuilder[B]: Builder[B, Seq[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Interval[T]) ⇒ K): Map[K, IntervalSeq[T]]

def grouped(size: Int): Iterator[IntervalSeq[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Interval[T]

def headOption: Option[Interval[T]]

def indexOf[B >: Interval[T]](elem: B, from: Int): Int

def indexOf[B >: Interval[T]](elem: B): Int

def indexOfSlice[B >: Interval[T]](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: Interval[T]](that: GenSeq[B]): Int

def indexWhere(p: (Interval[T]) ⇒ Boolean, from: Int): Int

def indexWhere(p: (Interval[T]) ⇒ Boolean): Int