InnermostIterator

abstract def elmToCurrent(elm: I): A

Converts the current element of the level-specific iterator to A.

abstract def iterator: Iterator[I]

Internal level-specific iterator.

abstract def onOuterChange(newOuter: OuterElm): Unit

abstract val outer: OutermostIterator[OuterElm]

To avoid an infinite loop on initialization time, lazy should be used when overriding.

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

def ->[B](y: B): (InnermostIterator[A], B)

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

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

final def ==(arg0: Any): Boolean

var _current: A

Current element of iterator converted to A.

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

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[A]

def clone(): AnyRef

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

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

def current: A

The value returned by the last call of next.

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

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

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

def ensuring(cond: (InnermostIterator[A]) ⇒ Boolean, msg: ⇒ Any): InnermostIterator[A]

def ensuring(cond: (InnermostIterator[A]) ⇒ Boolean): InnermostIterator[A]

def ensuring(cond: Boolean, msg: ⇒ Any): InnermostIterator[A]

def ensuring(cond: Boolean): InnermostIterator[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

def formatted(fmtstr: String): String

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

def hasNext: Boolean

Cached implementation of hasNext which also skips in the outer iterator bound to this inner iterator if this iterator has been exhausted.

def hashCode(): Int

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

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

final def init: Unit

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def length: Int

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

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

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

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

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

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(): A

The next element of this iterator also cashed in current.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

var optHasNext: Option[Boolean]

Optional cashed hasNext result to avoid repeated calculations.

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

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

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

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

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

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

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

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

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

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

def reversed: List[A]

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

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

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

def seq: Iterator[A]

def size: Int

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

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

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

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

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

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

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

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

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

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

def toIndexedSeq: IndexedSeq[A]

def toIterable: Iterable[A]

def toIterator: Iterator[A]

def toList: List[A]

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

def toSeq: Seq[A]

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

def toStream: Stream[A]

def toString(): String

def toTraversable: Traversable[A]

def toVector: Vector[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

def zipWithIndex: Iterator[(A, Int)]

def →[B](y: B): (InnermostIterator[A], B)

def filter(p: (A) ⇒ Boolean): TraversableOnce[A]

def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: (A) ⇒ B): TraversableOnce[B]

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