PrefixMapReader

abstract def hasNext: Boolean

Tests whether this iterator can provide another (key, value) pair.

abstract def next(): (T, String)

Produces the next (key, counter) pair of this iterator.

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[(T, String)]

def clone(): AnyRef

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

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

final def getClass(): Class[_]

def getCountryCode(x: Int): String

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

def hasDefiniteSize: Boolean

val hasDictionary: Boolean

Whether this prefix map uses a dictionary.

def hashCode(): Int

val header: Header

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

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

def isEmpty: Boolean

def isEven(x: Int): Boolean

final def isInstanceOf[T0]: Boolean

def isLeaf(x: Int): Boolean

def isTraversableAgain: Boolean

val leafBit: Int

val leafValueMask: Int

def length: Int

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

def mapName: Option[String]

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

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

def readDictionary(): Array[String]

def readTree(): Array[Int]

val reader: BufferReader

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

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

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

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

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

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

def reversed: List[(T, String)]

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

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

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

def seq: Iterator[(T, String)]

def size: Int

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

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

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

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

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

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

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

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

def toArray[B >: (T, String)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: (T, String)]: Buffer[B]

def toIndexedSeq: IndexedSeq[(T, String)]

def toIterable: Iterable[(T, String)]

def toIterator: Iterator[(T, String)]

def toList: List[(T, String)]

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

def toSeq: Seq[(T, String)]

def toSet[B >: (T, String)]: Set[B]

def toStream: Stream[(T, String)]

def toString(): String

def toTraversable: Traversable[(T, String)]

def toVector: Vector[(T, String)]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

def zipWithIndex: Iterator[((T, String), Int)]