BackslashContinuedLineIterator

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def ++ [B >: String] (that: ⇒ GenTraversableOnce[B]): Iterator[B]

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

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

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

def == (arg0: AnyRef): Boolean

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

def asInstanceOf [T0] : T0

def buffered : BufferedIterator[String]

def clone (): AnyRef

def collect [B] (pf: PartialFunction[String, B]): Iterator[B]

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

def contains (elem: Any): Boolean

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

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

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

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

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

def drop (n: Int): Iterator[String]

def dropWhile (p: (String) ⇒ Boolean): Iterator[String]

def duplicate : (Iterator[String], Iterator[String])

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

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

def filter (p: (String) ⇒ Boolean): Iterator[String]

def filterNot (p: (String) ⇒ Boolean): Iterator[String]

def finalize (): Unit

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

def flatMap [B] (f: (String) ⇒ GenTraversableOnce[B]): Iterator[B]

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

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

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

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

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

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

def grouped [B >: String] (size: Int): GroupedIterator[B]

def hasDefiniteSize : Boolean

def hasNext : Boolean

Determine whether there's any input remaining.

def hashCode (): Int

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

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

def isEmpty : Boolean

def isInstanceOf [T0] : Boolean

def isTraversableAgain : Boolean

def length : Int

def map [B] (f: (String) ⇒ B): Iterator[B]

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

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

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

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

def mkString : String

def mkString (sep: String): String

def mkString (start: String, sep: String, end: String): String

def ne (arg0: AnyRef): Boolean

def next (): String

Get the next logical line of input, which may represent a concatenation of physical input lines.

def nonEmpty : Boolean

def notify (): Unit

def notifyAll (): Unit

def padTo [A1 >: String] (len: Int, elem: A1): Iterator[A1]

def partition (p: (String) ⇒ Boolean): (Iterator[String], Iterator[String])

def patch [B >: String] (from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

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

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

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

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

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

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

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

def reversed : List[String]

def sameElements (that: Iterator[_]): Boolean

def scanLeft [B] (z: B)(op: (B, String) ⇒ B): Iterator[B]

def scanRight [B] (z: B)(op: (String, B) ⇒ B): Iterator[B]

def seq : Iterator[String]

def size : Int

def slice (from: Int, until: Int): Iterator[String]

def sliding [B >: String] (size: Int, step: Int): GroupedIterator[B]

val source : Iterator[String]

an iterator that produces lines of input.

def span (p: (String) ⇒ Boolean): (Iterator[String], Iterator[String])

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

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

def take (n: Int): Iterator[String]

def takeWhile (p: (String) ⇒ Boolean): Iterator[String]

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

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

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

def toIterable : Iterable[String]

def toIterator : Iterator[String]

def toList : List[String]

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

def toSeq : Seq[String]

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

def toStream : Stream[String]

def toString (): String

def toTraversable : Traversable[String]

def wait (): Unit

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

def wait (arg0: Long): Unit

def withFilter (p: (String) ⇒ Boolean): Iterator[String]

def zip [B] (that: Iterator[B]): Iterator[(String, B)]

def zipAll [B, A1 >: String, B1 >: B] (that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

def zipWithIndex : Iterator[(String, Int)] { ... /* 2 definitions in type refinement */ }

def append [B >: String] (that: Iterator[B]): Iterator[B]

def counted : CountedIterator[String]

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

def readInto [B >: String] (xs: Array[B]): Unit

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

def readInto [B >: String] (xs: Array[B], start: Int, sz: Int): Unit