LineNil

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: Char, That](elem: B)(implicit bf: CanBuildFrom[LinearSeq[Char], B, That]): That

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

def :+[B >: Char, That](elem: B)(implicit bf: CanBuildFrom[LinearSeq[Char], B, That]): That

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

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

def apply(i: Int): Nothing

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def charAt(i: Int): Char

def chars(): IntStream

def clone(): AnyRef

def codePoints(): IntStream

val colNum: Int

def collect[B, That](pf: PartialFunction[Char, B])(implicit bf: CanBuildFrom[LinearSeq[Char], B, That]): That

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

def combinations(n: Int): Iterator[LinearSeq[Char]]

def companion: GenericCompanion[LinearSeq]

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

def diff[B >: Char](that: GenSeq[B]): LinearSeq[Char]

def distinct: LinearSeq[Char]

def drop(length: Int): LineStream

def dropRight(n: Int): LinearSeq[Char]

def dropWhile(p: (Char) ⇒ Boolean): LinearSeq[Char]

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

final def eq(arg0: AnyRef): Boolean

def equals(a: Any): Boolean

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

def filter(p: (Char) ⇒ Boolean): LinearSeq[Char]

def filterNot(p: (Char) ⇒ Boolean): LinearSeq[Char]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Char) ⇒ GenTraversableOnce[B]): LinearSeq[B]

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

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

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

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

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

def formatError(pattern: String): String

Expects a pattern with the following arguments:

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

final def getClass(): Class[_]

def groupBy[K](f: (Char) ⇒ K): Map[K, LinearSeq[Char]]

def grouped(size: Int): Iterator[LinearSeq[Char]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Nothing

def headOption: Option[Char]

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

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

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

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

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

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

def indices: Range

def init: LinearSeq[Char]

def inits: Iterator[LinearSeq[Char]]

def intersect[B >: Char](that: GenSeq[B]): LinearSeq[Char]

def isDefinedAt(idx: Int): Boolean

val isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Char]

def last: Char

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

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

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

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

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

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

def lastOption: Option[Char]

final lazy val length: Int

def lengthCompare(i: Int): Int

def lift: (Int) ⇒ Option[Char]

val line: String

val lineNum: Int

def map[B, That](f: (Char) ⇒ B)(implicit bf: CanBuildFrom[LinearSeq[Char], B, That]): That

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

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

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

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

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[Char, LinearSeq[Char]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[Char]

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

def partition(p: (Char) ⇒ Boolean): (LinearSeq[Char], LinearSeq[Char])

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

def permutations: Iterator[LinearSeq[Char]]

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

def printError(pattern: String)(ps: PrintStream): Unit

Expects a pattern with the following arguments:

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

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

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

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

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

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

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

def repr: LinearSeq[Char]

def reverse: LinearSeq[Char]

def reverseIterator: Iterator[Char]

def reverseMap[B, That](f: (Char) ⇒ B)(implicit bf: CanBuildFrom[LinearSeq[Char], B, That]): That

def reversed: List[Char]

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

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

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

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

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

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

def seq: LinearSeq[Char]

def size: Int

def slice(from: Int, until: Int): LinearSeq[Char]

def sliding(size: Int, step: Int): Iterator[LinearSeq[Char]]

def sliding(size: Int): Iterator[LinearSeq[Char]]

def sortBy[B](f: (Char) ⇒ B)(implicit ord: Ordering[B]): LinearSeq[Char]

def sortWith(lt: (Char, Char) ⇒ Boolean): LinearSeq[Char]

def sorted[B >: Char](implicit ord: Ordering[B]): LinearSeq[Char]

def span(p: (Char) ⇒ Boolean): (LinearSeq[Char], LinearSeq[Char])

def splitAt(n: Int): (LinearSeq[Char], LinearSeq[Char])

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

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

def stringPrefix: String

def subSequence(start: Int, end: Int): LineStream

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

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

def tail: Nothing

def tails: Iterator[LinearSeq[Char]]

def take(length: Int): LineStream

def takeRight(n: Int): LinearSeq[Char]

def takeWhile(p: (Char) ⇒ Boolean): LinearSeq[Char]

def thisCollection: LinearSeq[Char]

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

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

def toBuffer[B >: Char]: Buffer[B]

def toCollection(repr: LinearSeq[Char]): LinearSeq[Char]

def toIndexedSeq: IndexedSeq[Char]

def toIterable: Iterable[Char]

def toIterator: Iterator[Char]

def toList: List[Char]

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

def toSeq: Seq[Char]

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

def toStream: Stream[Char]

def toString(): String

def toTraversable: Traversable[Char]

def toVector: Vector[Char]

def transpose[B](implicit asTraversable: (Char) ⇒ GenTraversableOnce[B]): LinearSeq[LinearSeq[B]]

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

def unzip[A1, A2](implicit asPair: (Char) ⇒ (A1, A2)): (LinearSeq[A1], LinearSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Char) ⇒ (A1, A2, A3)): (LinearSeq[A1], LinearSeq[A2], LinearSeq[A3])

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

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

def view: SeqView[Char, LinearSeq[Char]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Char) ⇒ Boolean): FilterMonadic[Char, LinearSeq[Char]]

def zip(that: LineStream): Stream[(Char, Char)]

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

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

def zipWithIndex: Stream[(Char, Int)]

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

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