Span

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

final def ==(arg0: AnyRef): Boolean

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, E) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(i: Int): E

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

val chain: C

def clone(): AnyRef

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

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

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

def companion: GenericCompanion[IndexedSeq]

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

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

def distinct: IndexedSeq[E]

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

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

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

def end: Int

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

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

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (E) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

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

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

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

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

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

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hasNext(elt: E): Boolean

Given an elt in the Span, return true if the span contains an additional element after elt.

def hasPredecessor(i: Int): Boolean

def hasPrev(elt: E): Boolean

Given an elt in the Span, return true if the span contains an additional element before elt.

def hasSuccessor(i: Int): Boolean

def hashCode(): Int

def head: E

def headOption: Option[E]

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

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

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

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

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

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

def indices: Range

def init: IndexedSeq[E]

def inits: Iterator[IndexedSeq[E]]

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

def isAtEnd: Boolean

def isAtStart: Boolean

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[E]

def last: E

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

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

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

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

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

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

def lastOption: Option[E]

val length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[E]

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

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

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

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

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

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

def next(elt: E): E

def nextWindow(n: Int): Seq[E]

Return a sequence of n elements after the last element of this span.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def overlaps(that: Span[C, E]): Boolean

Given a span within the same chain as this one, return true if the two spans overlap by at least one element.

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

def par: ParSeq[E]

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

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

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

def permutations: Iterator[IndexedSeq[E]]

def predecessor(i: Int): E

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

val present: Boolean

def prev(elt: E): E

def prevWindow(n: Int): Seq[E]

Return a sequence of n elements before the beginning of this span.

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

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

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

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

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

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

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

def repr: IndexedSeq[E]

def reverse: IndexedSeq[E]

def reverseIterator: Iterator[E]

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

def reversed: List[E]

def runWith[U](action: (E) ⇒ U): (Int) ⇒ Boolean

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

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

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

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

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

def seq: IndexedSeq[E]

def size: Int

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

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

def sliding(size: Int): Iterator[IndexedSeq[E]]

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

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

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

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

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

val start: Int

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

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

def stringPrefix: String

def successor(i: Int): E

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

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

def tail: IndexedSeq[E]

def tails: Iterator[IndexedSeq[E]]

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

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

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

def thisCollection: IndexedSeq[E]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, E, Col[E]]): Col[E]

def toArray[B >: E](implicit arg0: ClassTag[B]): Array[B]

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

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

def toIndexedSeq: IndexedSeq[E]

def toIterable: Iterable[E]

def toIterator: Iterator[E]

def toList: List[E]

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

def toSeq: Seq[E]

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

def toStream: Stream[E]

def toString(): String

def toTraversable: Traversable[E]

def toVector: Vector[E]

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

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

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

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

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

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def window(n: Int): Seq[E]

def windowWithoutSelf(n: Int): Seq[E]

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

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

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

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

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