Interval

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def +:[B >: Int, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

def /:\[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

def :+[B >: Int, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def :\[B](z: B)(op: (Int, B) ⇒ B): B

def <(that: Interval): Boolean

def <=(that: Interval): Boolean

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def >(that: Interval): Boolean

def >=(that: Interval): 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, Int) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(index: Int): Int

Return the ith value of the interval.

final def asInstanceOf[T0]: T0

def borders(that: Interval): Boolean

Tests whether two intervals border but do not overlap.

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

def combinations(n: Int): Iterator[IndexedSeq[Int]]

def companion: GenericCompanion[IndexedSeq]

def compare(that: Interval): Int

def compareTo(that: Interval): Int

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

def contains(x: Int): Boolean

Tests whether this list contains a given value as an element.

def contains(elem: Any): Boolean

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

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

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

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

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

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

def count(p: (Int) ⇒ Boolean): Int

def diff[B >: Int](that: GenSeq[B]): IndexedSeq[Int]

def disjoint(that: Interval): Boolean

Tests whether another interval is disjoint from this interval.

def distance(that: Interval): Int

Measure the distance between two intervals.

def distinct: IndexedSeq[Int]

def drop(n: Int): IndexedSeq[Int]

def dropRight(n: Int): IndexedSeq[Int]

def dropWhile(p: (Int) ⇒ Boolean): IndexedSeq[Int]

val end: Int

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (Int) ⇒ Boolean): Boolean

def filter(p: (Int) ⇒ Boolean): IndexedSeq[Int]

def filterNot(p: (Int) ⇒ Boolean): IndexedSeq[Int]

def finalize(): Unit

def find(p: (Int) ⇒ Boolean): Option[Int]

def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

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

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

def forall(p: (Int) ⇒ Boolean): Boolean

def foreach[U](f: (Int) ⇒ U): Unit

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

final def getClass(): java.lang.Class[_]

def groupBy[K](f: (Int) ⇒ K): Map[K, IndexedSeq[Int]]

def grouped(size: Int): Iterator[IndexedSeq[Int]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Int

def headOption: Option[Int]

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

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

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

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

def indexWhere(p: (Int) ⇒ Boolean, from: Int): Int

def indexWhere(p: (Int) ⇒ Boolean): Int

def indices: Range

def init: IndexedSeq[Int]

def inits: Iterator[IndexedSeq[Int]]

def intersect(that: Interval): Interval

Takes the intersection of two intervals, or Interval.

def intersect[B >: Int](that: GenSeq[B]): IndexedSeq[Int]

def intersects(that: Interval): Boolean

Tests whether another interval intersects this interval.

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Int]

def last: Int

def lastIndexOf[B >: Int](elem: B, end: Int): Int

def lastIndexOf[B >: Int](elem: B): Int

def lastIndexOfSlice[B >: Int](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: Int](that: GenSeq[B]): Int

def lastIndexWhere(p: (Int) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (Int) ⇒ Boolean): Int

def lastOption: Option[Int]

def left(that: Interval): Interval

def leftOf(that: Interval): Boolean

def length: Int

The length of the interval.

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Int]

def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def max: Int

The maximum index in the interval.

def max[B >: Int](implicit cmp: Ordering[B]): Int

def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def min: Int

The minimum index in the interval.

def min[B >: Int](implicit cmp: Ordering[B]): Int

def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

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[Int, IndexedSeq[Int]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def padTo[B >: Int, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def par: ParSeq[Int]

def parCombiner: Combiner[Int, ParSeq[Int]]

def partition(p: (Int) ⇒ Boolean): (IndexedSeq[Int], IndexedSeq[Int])

def patch[B >: Int, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def permutations: Iterator[IndexedSeq[Int]]

def prefixLength(p: (Int) ⇒ Boolean): Int

def product[B >: Int](implicit num: Numeric[B]): B

def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]

def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Int](op: (Int, B) ⇒ B): B

def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]

def repr: IndexedSeq[Int]

def reverse: IndexedSeq[Int]

def reverseIterator: Iterator[Int]

def reverseMap[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def reversed: List[Int]

def right(that: Interval): Interval

def rightOf(that: Interval): Boolean

def sameElements[B >: Int](that: GenIterable[B]): Boolean

def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def segmentLength(p: (Int) ⇒ Boolean, from: Int): Int

def seq: Interval

def shift(by: Int): Interval

def size: Int

def slice(from: Int, until: Int): IndexedSeq[Int]

def sliding[B >: Int](size: Int, step: Int): Iterator[IndexedSeq[Int]]

def sliding[B >: Int](size: Int): Iterator[IndexedSeq[Int]]

def sortBy[B](f: (Int) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[Int]

def sortWith(lt: (Int, Int) ⇒ Boolean): IndexedSeq[Int]

def sorted[B >: Int](implicit ord: Ordering[B]): IndexedSeq[Int]

def span(p: (Int) ⇒ Boolean): (IndexedSeq[Int], IndexedSeq[Int])

def splitAt(n: Int): (IndexedSeq[Int], IndexedSeq[Int])

val start: Int

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

def stringPrefix: String

def subset(that: Interval): Boolean

Tests whether this interval is a subsert of another interval.

def sum[B >: Int](implicit num: Numeric[B]): B

def superset(that: Interval): Boolean

Tests whether this interval is a superset of another interval.

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: IndexedSeq[Int]

def tails: Iterator[IndexedSeq[Int]]

def take(n: Int): IndexedSeq[Int]

def takeRight(n: Int): IndexedSeq[Int]

def takeWhile(p: (Int) ⇒ Boolean): IndexedSeq[Int]

def thisCollection: IndexedSeq[Int]

def toArray[B >: Int](implicit arg0: ClassManifest[B]): Array[B]

def toBuffer[A1 >: Int]: Buffer[A1]

def toCollection(repr: IndexedSeq[Int]): IndexedSeq[Int]

def toIndexedSeq[B >: Int]: IndexedSeq[B]

def toIterable: Iterable[Int]

def toIterator: Iterator[Int]

def toList: List[Int]

def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]

def toSeq: Seq[Int]

def toSet[B >: Int]: Set[B]

def toStream: Stream[Int]

def toString(): String

def toTraversable: Traversable[Int]

def transpose[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def union(that: Interval): Interval

Takes the union of two intervals.

def union[B >: Int, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: Int, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

def view(from: Int, until: Int): SeqView[Int, IndexedSeq[Int]]

def view: SeqView[Int, IndexedSeq[Int]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, IndexedSeq[Int]]

def zip[A1 >: Int, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], (A1, B), That]): That

def zipAll[B, A1 >: Int, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[Int], (A1, B), That]): That

def zipWithIndex[A1 >: Int, That](implicit bf: CanBuildFrom[IndexedSeq[Int], (A1, Int), That]): That

def elements: Iterator[Int]

def equalsWith[B](that: Seq[B])(f: (Int, B) ⇒ Boolean): Boolean

def findIndexOf(p: (Int) ⇒ Boolean): Int

def findLastIndexOf(p: (Int) ⇒ Boolean): Int

def first: Int

def firstOption: Option[Int]

def projection: SeqView[Int, IndexedSeq[Int]]

def reversedElements: Iterator[Int]