MultiIterator

Instance Constructors

new MultiIterator(iterators: Iterator[T]*)

iterators
the iterators to wrap

Type Members

class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

Definition Classes
Iterator

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++[B >: T](that: ⇒ GenTraversableOnce[B]): Iterator[B]

Definition Classes
Iterator
def /:[B](z: B)(op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (T, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buffered: BufferedIterator[T]

Definition Classes
Iterator
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B](pf: PartialFunction[T, B]): Iterator[B]

Definition Classes
Iterator
Annotations
@migration
Migration
(Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

Definition Classes
TraversableOnce
def contains(elem: Any): Boolean

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

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def copyToArray[B >: T](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: T](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: T](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def corresponds[B](that: GenTraversableOnce[B])(p: (T, B) ⇒ Boolean): Boolean

Definition Classes
Iterator
def count(p: (T) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def drop(n: Int): Iterator[T]

Definition Classes
Iterator
def dropWhile(p: (T) ⇒ Boolean): Iterator[T]

Definition Classes
Iterator
def duplicate: (Iterator[T], Iterator[T])

Definition Classes
Iterator
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def exists(p: (T) ⇒ Boolean): Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def filter(p: (T) ⇒ Boolean): Iterator[T]

Definition Classes
Iterator
def filterNot(p: (T) ⇒ Boolean): Iterator[T]

Definition Classes
Iterator
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (T) ⇒ Boolean): Option[T]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): Iterator[B]

Definition Classes
Iterator
def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (T, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def forall(p: (T) ⇒ Boolean): Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def foreach[U](f: (T) ⇒ U): Unit

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def grouped[B >: T](size: Int): GroupedIterator[B]

Definition Classes
Iterator
def hasDefiniteSize: Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def hasNext: Boolean

Determines whether the iterator is empty.
Determines whether the iterator is empty. A MultiIterator is empty when all contained iterators have been exhausted.
returns
true if there's more to read, false if not

Definition Classes
MultiIterator → Iterator
def hashCode(): Int

Definition Classes
AnyRef → Any
def indexOf[B >: T](elem: B, from: Int): Int

Definition Classes
Iterator
def indexOf[B >: T](elem: B): Int

Definition Classes
Iterator
def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

Definition Classes
Iterator
def indexWhere(p: (T) ⇒ Boolean): Int

Definition Classes
Iterator
def isEmpty: Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraversableAgain: Boolean

Definition Classes
Iterator → GenTraversableOnce
def length: Int

Definition Classes
Iterator
def map[B](f: (T) ⇒ B): Iterator[B]

Definition Classes
Iterator
def max[B >: T](implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: T](implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def next(): T

Get the next element.
Get the next element.
returns
the next element

Definition Classes
MultiIterator → Iterator
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def padTo[A1 >: T](len: Int, elem: A1): Iterator[A1]

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

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

Definition Classes
Iterator
def product[B >: T](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: T](op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: T](op: (T, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reversed: List[T]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameElements(that: Iterator[_]): Boolean

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

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

Definition Classes
Iterator
def seq: Iterator[T]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): Iterator[T]

Definition Classes
Iterator
def sliceIterator(from: Int, until: Int): Iterator[T]

Attributes
protected
Definition Classes
Iterator
def sliding[B >: T](size: Int, step: Int): GroupedIterator[B]

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

Definition Classes
Iterator
def sum[B >: T](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def take(n: Int): Iterator[T]

Definition Classes
Iterator
def takeWhile(p: (T) ⇒ Boolean): Iterator[T]

Definition Classes
Iterator
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: T]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIndexedSeq: IndexedSeq[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterator: Iterator[T]

Definition Classes
Iterator → GenTraversableOnce
def toList: List[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: T]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[T]

Definition Classes
Iterator → GenTraversableOnce
def toString(): String

Definition Classes
Iterator → AnyRef → Any
def toTraversable: Traversable[T]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def toVector: Vector[T]

Definition Classes
TraversableOnce → GenTraversableOnce
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (T) ⇒ Boolean): Iterator[T]

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

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

Definition Classes
Iterator
def zipWithIndex: Iterator[(T, Int)]

Definition Classes
Iterator

Related Doc: package collection

class MultiIterator[+T] extends Iterator[T]

Instance Constructors

new MultiIterator(iterators: Iterator[T]*)

Type Members

class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[T]

def clone(): AnyRef

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

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

def hasNext: Boolean

def hashCode(): Int

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

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

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

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

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def length: Int

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

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

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

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

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

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

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

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

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

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

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

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