Iterator1

abstract def first: A

The constant first element of this iterator.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[AA >: A](that: ⇒ Iterator1[AA]): Iterator1[AA]

Append the given iterator to this iterator.

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

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

def <*>:[B](f: Iterator1[(A) ⇒ B]): Iterator1[B]

Runs the iterator sequence effect (flatMap) of functions on this iterator.

final def ==(arg0: AnyRef): Boolean

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

def ap[B](f: Iterator1[(A) ⇒ B]): Iterator1[B]

Runs the iterator sequence effect (flatMap) of functions on this iterator.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

Return the first element in the iterator satisfying the given predicate, mapping the given function.

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

def contains(elem: Any): Boolean

True if any elements of the iterator are equal to the given value.

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

Copies this iterator to an array at the given interval.

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 count(p: (A) ⇒ Boolean): Int

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

Drop at most the given number of elements from the front of the iterator.

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

Drop elements from the front of the iterator satisfying the given predicate.

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

Creates two new iterators that both iterate over the same elements as this iterator (in the same order).

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

True if any elements of the iterator satisfy the given predicate.

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

Return an iterator with only the elements satisfying the predicate.

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

Return an iterator with only the elements not satisfying the predicate.

def finalize(): Unit

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

Return the first element in the iterator satisfying the given predicate.

def flatMap[B](f: (A) ⇒ Iterator1[B]): Iterator1[B]

Sequence an iterator function on all elements of the iterator.

def flatten[I](implicit I1: (A) ⇒ Iterator1[I]): Iterator1[I]

Flatten an iterator of iterator.

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

True if all elements of the iterator satisfy the given predicate.

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

Execute an effect for each element of the iterator.

final def getClass(): Class[_]

def hasDefiniteSize: Boolean

A non-empty iterator always has a definite size.

def hasNext: Boolean

True if this iterator can produce a value from next.

def hashCode(): Int

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

Return the index (starting at 0) of the first element in the iterator equal to the given value or -1 if no such element exists.

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

Return the index (starting at 0) of the first element in the iterator satisfying the given predicate or -1 if no such element exists.

def isEmpty: Boolean

The negation of hasNext.

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

A non-empty iterator is never traversable again.

def length: Int

Return the number of elements in the iterator.

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

Map a function on all elements of the iterator.

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

Produces a value if possible, or throws an exception if not possible.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def padTo[AA >: A](len: Int, elem: AA): Iterator1[AA]

Appends an element value to the iterator until a given target length is reached.

def partition(p: (A) ⇒ Boolean): BreakIterator1[A]

Partition the iterator into those satisfying a predicate and those that do not.

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: Iterator1[_]): Boolean

True if this iterator produces equal elements to the given iterator in the same order.

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

Produces an iterator containing cumulative results of applying the operator going left to right.

def scanLeft1[AA >: A](op: (AA, A) ⇒ AA): Iterator1[AA]

Produces an iterator containing cumulative results of applying the operator going left to right, starting at head.

def seq: Iterator[A]

Return a regular iterator, losing the non-empty invariant in the type.

def sequenceFn[X, Y](implicit I: (A) ⇒ (X) ⇒ Y): (X) ⇒ Iterator1[Y]

Runs the iterator of functions to produce a function to iterators.

def size: Int

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

Returns an interval of elements in the iterator.

def span(p: (A) ⇒ Boolean): BreakIterator1[A]

Split the iterator, taking from the front while the given predicate satisfies.

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

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

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

Take at most the given number of elements from the front of the iterator.

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

Take elements from the front of the iterator satisfying the given predicate.

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]

Return a regular iterator, losing the non-empty invariant in the type.

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]

Convert this iterator to a stream.

def toString(): String

def toTraversable: Traversable[A]

Returns a stream of this iterator.

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]

Return an iterator with only the elements satisfying the predicate.

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

Zip this iterator with the given iterator to produce an iterator of pairs.

def zipAll[B, AA >: A, BB >: B](that: Iterator1[B], thisElem: AA, thatElem: BB): Iterator1[(AA, BB)]

Creates an iterator formed from this iterator and another iterator by combining corresponding elements in pairs.

def zipWithIndex: Iterator1[(A, Int)]

Zip this iterator with the infinite iterator from 0 incrementing by 1, to produce an iterator of pairs.

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