RandomAccessIterator

abstract def apply(n: Int): A

abstract def limit: Int

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: A](xs: CanIterate[B]): Iterator[B]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

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

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

def foreach(f: (A) ⇒ Unit): Unit

final def getClass(): Class[_]

def hasNext: Boolean

def hashCode(): Int

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

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[A]

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

final def ne(arg0: AnyRef): Boolean

def next: A

final def notify(): Unit

final def notifyAll(): Unit

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

def remaining: Int

If the number of elements still to be returned by this iterator is known, that number, otherwise -1.

def reverse: Iterator[A]

var start: Int

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

def toString(): String

def underlying: Iterator[_]

If this iterator results from applying a transfomation to another iterator, that other iterator, otherwise the iterator itself.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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