ByteArrayIterator

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

final def ++(that: TraversableOnce[Byte]): ByteIterator

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

def ->[B](y: B): (ByteArrayIterator, B)

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

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

def asInputStream: InputStream

Directly wraps this ByteIterator in an InputStream without copying.

final def asInstanceOf[T0]: T0

def buffered: ByteArrayIterator.this.type

def clear(): Unit

final def clone(): ByteArrayIterator

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

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

def contains(elem: Any): Boolean

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

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

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

def copyToBuffer(buffer: ByteBuffer): Int

For performance sensitive code, call take() directly on ByteString (it's optimised there)

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

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

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

final def drop(n: Int): ByteArrayIterator.this.type

final def dropWhile(p: (Byte) ⇒ Boolean): ByteArrayIterator.this.type

def duplicate: (ByteIterator, ByteIterator)

def ensuring(cond: (ByteArrayIterator) ⇒ Boolean, msg: ⇒ Any): ByteArrayIterator

def ensuring(cond: (ByteArrayIterator) ⇒ Boolean): ByteArrayIterator

def ensuring(cond: Boolean, msg: ⇒ Any): ByteArrayIterator

def ensuring(cond: Boolean): ByteArrayIterator

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

def formatted(fmtstr: String): String

def getByte: Byte

Get a single Byte from this iterator.

def getByteString(n: Int): ByteString

Get a ByteString with specific number of Bytes from this iterator.

def getBytes(xs: Array[Byte], offset: Int, n: Int): ByteArrayIterator.this.type

Get a specific number of Bytes from this iterator.

def getBytes(n: Int): Array[Byte]

Get a specific number of Bytes from this iterator.

def getBytes(xs: Array[Byte]): ByteArrayIterator.this.type

Get a specific number of Bytes from this iterator.

final def getClass(): Class[_]

def getDouble(implicit byteOrder: ByteOrder): Double

def getDoubles(xs: Array[Double], offset: Int, n: Int)(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Doubles from this iterator.

def getDoubles(xs: Array[Double])(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Doubles from this iterator.

def getFloat(implicit byteOrder: ByteOrder): Float

def getFloats(xs: Array[Float], offset: Int, n: Int)(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Floats from this iterator.

def getFloats(xs: Array[Float])(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Floats from this iterator.

def getInt(implicit byteOrder: ByteOrder): Int

Get a single Int from this iterator.

def getInts(xs: Array[Int], offset: Int, n: Int)(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Ints from this iterator.

def getInts(xs: Array[Int])(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Ints from this iterator.

def getLong(implicit byteOrder: ByteOrder): Long

Get a single Long from this iterator.

def getLongPart(n: Int)(implicit byteOrder: ByteOrder): Long

Get a Long from this iterator where only the least significant n bytes were encoded.

def getLongs(xs: Array[Long], offset: Int, n: Int)(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Longs from this iterator.

def getLongs(xs: Array[Long])(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Longs from this iterator.

def getShort(implicit byteOrder: ByteOrder): Short

Get a single Short from this iterator.

def getShorts(xs: Array[Short], offset: Int, n: Int)(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Shorts from this iterator.

def getShorts(xs: Array[Short])(implicit byteOrder: ByteOrder): ByteArrayIterator.this.type

Get a number of Shorts from this iterator.

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

def hasDefiniteSize: Boolean

final def hasNext: Boolean

def hashCode(): Int

final def head: Byte

def indexOf[B >: Byte](elem: B, from: Int): Int

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

def indexOf(elem: Byte, from: Int): Int

def indexOf(elem: Byte): Int

def indexWhere(p: (Byte) ⇒ Boolean, from: Int): Int

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

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

final def len: Int

final def length: Int

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

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

final def next(): Byte

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

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

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

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

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

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

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

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

def reversed: List[Byte]

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

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

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

def seq: Iterator[Byte]

def size: Int

def slice(from: Int, until: Int): ByteArrayIterator.this.type

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

def span(p: (Byte) ⇒ Boolean): (ByteIterator, ByteIterator)

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

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

final def take(n: Int): ByteArrayIterator.this.type

final def takeWhile(p: (Byte) ⇒ Boolean): ByteArrayIterator.this.type

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

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

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

final def toByteString: ByteString

def toIndexedSeq: IndexedSeq[Byte]

def toIterable: Iterable[Byte]

def toIterator: Iterator[Byte]

def toList: List[Byte]

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

def toSeq: ByteString

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

def toStream: Stream[Byte]

def toString(): String

def toTraversable: Traversable[Byte]

def toVector: Vector[Byte]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

def zipWithIndex: Iterator[(Byte, Int)]

def →[B](y: B): (ByteArrayIterator, B)

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

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

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

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