Abstract Value Members
-
def
hasNext
: Boolean
-
val
items
: Seq[T]
-
def
next
(): T
Concrete Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
++
[B >: T]
(that: ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
/:
[B]
(z: B)(op: (B, T) ⇒ B): B
-
def
/:\
[A1 >: T]
(z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
:\
[B]
(z: B)(op: (T, B) ⇒ B): B
-
def
==
(arg0: AnyRef): Boolean
-
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
-
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
count
(p: (T) ⇒ Boolean): Int
-
def
drop
(n: Int): Iterator[T]
-
def
dropWhile
(p: (T) ⇒ Boolean): Iterator[T]
-
def
duplicate
: (Iterator[T], Iterator[T])
-
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
-
def
getClass
(): java.lang.Class[_]
-
def
grouped
[B >: T]
(size: Int): GroupedIterator[B]
-
def
hasDefiniteSize
: Boolean
-
def
hashCode
(): Int
-
def
indexOf
[B >: T]
(elem: B): Int
-
def
indexWhere
(p: (T) ⇒ Boolean): Int
-
def
isEmpty
: Boolean
-
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
-
def
ne
(arg0: AnyRef): Boolean
-
def
nonEmpty
: Boolean
-
def
notify
(): Unit
-
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]
-
def
reduceRight
[B >: T]
(op: (T, B) ⇒ B): B
-
def
reduceRightOption
[B >: T]
(op: (T, B) ⇒ B): Option[B]
-
def
reversed
: List[T]
-
def
sameElements
(that: Iterator[_]): Boolean
-
def
scanLeft
[B]
(z: B)(op: (B, T) ⇒ B): Iterator[B]
-
def
scanRight
[B]
(z: B)(op: (T, B) ⇒ B): Iterator[B]
-
def
seq
: Iterator[T]
-
def
size
: Int
-
def
slice
(from: Int, until: Int): Iterator[T]
-
def
sliding
[B >: T]
(size: Int, step: Int): GroupedIterator[B]
-
def
span
(p: (T) ⇒ Boolean): (Iterator[T], Iterator[T])
-
def
sum
[B >: T]
(implicit num: Numeric[B]): B
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
take
(n: Int): Iterator[T]
-
def
takeWhile
(p: (T) ⇒ Boolean): Iterator[T]
-
def
toArray
[B >: T]
(implicit arg0: ClassManifest[B]): Array[B]
-
def
toBuffer
[B >: T]
: Buffer[B]
-
def
toIndexedSeq
[B >: T]
: IndexedSeq[B]
-
def
toIterable
: Iterable[T]
-
def
toIterator
: Iterator[T]
-
def
toList
: List[T]
-
def
toMap
[T, U]
(implicit ev: <:<[T, (T, U)]): Map[T, U]
-
def
toSeq
: Seq[T]
-
def
toSet
[B >: T]
: Set[B]
-
def
toStream
: Stream[T]
-
def
toString
(): String
-
def
toTraversable
: Traversable[T]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
-
def
withFilter
(p: (T) ⇒ Boolean): Iterator[T]
-
def
zip
[B]
(that: Iterator[B]): Iterator[(T, B)]
-
def
zipAll
[B, A1 >: T, B1 >: B]
(that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex
: Iterator[(T, Int)] { ... /* 2 definitions in type refinement */ }
Deprecated Value Members
-
def
append
[B >: T]
(that: Iterator[B]): Iterator[B]
-
def
counted
: CountedIterator[T]
-
def
findIndexOf
(p: (T) ⇒ Boolean): Int
-
def
readInto
[B >: T]
(xs: Array[B]): Unit
-
def
readInto
[B >: T]
(xs: Array[B], start: Int): Unit
-
def
readInto
[B >: T]
(xs: Array[B], start: Int, sz: Int): Unit
Inherited from Iterator[T]
Inherited from TraversableOnce[T]
Inherited from GenTraversableOnce[T]
Inherited from AnyRef
Inherited from Any
An Iterator that is either always empty or yields an infinite number of Ts.