LookaheadSource

abstract def consume(): Char

abstract def hasNext: Boolean

abstract def peek(offset: Int): Option[Char]

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[Char]

def clone(): AnyRef

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

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

def consumeString(str: String): Boolean

If the next characters in the input stream are equal to the given string, consume them and return true.

def consumeWhile(p: (Char) ⇒ Boolean): String

Same as de.uni_luebeck.isp.compacom.LookaheadSource.peekWhile, but consume the characters.

def contains(elem: Any): 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

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

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

var currentColumn: Int

var currentLine: Int

def discard(n: Int): Unit

Consume and ignore the next n characters in the stream.

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

def flatMap[B](f: (Char) ⇒ GenTraversableOnce[B]): Iterator[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

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

def hashCode(): Int

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

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

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def length: Int

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

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 next(): Char

def nextOption(): Option[Char]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

def peekSource: LookaheadSource

A LookaheadSource that will produce the characters from this source by peeking into it.

def peekStream: Stream[Char]

A stream containing the characters returned by peek(0) onwards.

def peekString(length: Int): String

Return a string containing the next length characters without consuming any.

def peekWhile(p: (Char) ⇒ Boolean): String

Return a string containing all the characters in the input until the first that does not meet the predicate without consuming any.

def position: Position

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 reversed: List[Char]

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

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

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

def seq: Iterator[Char]

def size: Int

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

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

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

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

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

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

def takeWhile(p: (Char) ⇒ Boolean): Iterator[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 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]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

def zipWithIndex: Iterator[(Char, Int)]