Packages

class ParArrayIterator extends SeqSplitter[T]

Linear Supertypes
SeqSplitter[T], PreciseSplitter[T], AugmentedSeqIterator[T], IterableSplitter[T], DelegatedSignalling, Signalling, Splitter[T], AugmentedIterableIterator[T], RemainsIterator[T], Iterator[T], TraversableOnce[T], GenTraversableOnce[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParArrayIterator
  2. SeqSplitter
  3. PreciseSplitter
  4. AugmentedSeqIterator
  5. IterableSplitter
  6. DelegatedSignalling
  7. Signalling
  8. Splitter
  9. AugmentedIterableIterator
  10. RemainsIterator
  11. Iterator
  12. TraversableOnce
  13. GenTraversableOnce
  14. AnyRef
  15. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParArrayIterator(i: Int = 0, until: Int = length, arr: Array[Any] = array)

Type Members

  1. class Appended [U >: T, PI <: SeqSplitter[U]] extends SeqSplitter.Appended[U, PI] with SeqSplitter[U]
    Definition Classes
    SeqSplitter
  2. class Mapped [S] extends SeqSplitter.Mapped[S] with SeqSplitter[S]
    Definition Classes
    SeqSplitter
  3. class Patched [U >: T] extends SeqSplitter[U]
    Definition Classes
    SeqSplitter
  4. class Taken extends SeqSplitter.Taken with SeqSplitter[T]
    Definition Classes
    SeqSplitter
  5. class Zipped [S] extends SeqSplitter.Zipped[S] with SeqSplitter[(T, S)]
    Definition Classes
    SeqSplitter
  6. class ZippedAll [U >: T, S] extends SeqSplitter.ZippedAll[U, S] with SeqSplitter[(U, S)]
    Definition Classes
    SeqSplitter
  7. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
    Definition Classes
    Iterator

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: T](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def abort(): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  8. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  9. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S
    Definition Classes
    ParArrayIterator → TraversableOnce → GenTraversableOnce
  12. def appendParIterable[U >: T, PI <: IterableSplitter[U]](that: PI): ParArrayIterator.Appended[U, PI]
    Definition Classes
    IterableSplitter
  13. def appendParSeq[U >: T, PI <: SeqSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    SeqSplitter
  14. val arr: Array[Any]
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def buffered: BufferedIterator[T]
    Definition Classes
    Iterator
  17. def buildString(closure: ((String) ⇒ Unit) ⇒ Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  18. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. 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.

  20. def collect2combiner[S, That](pf: PartialFunction[T, S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  21. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  22. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  23. def copy2builder[U >: T, Coll, Bld <: Builder[U, Coll]](cb: Bld): Bld
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  24. def copyToArray[U >: T](array: Array[U], from: Int, len: Int): Unit
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator → Iterator → TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  28. def corresponds[S](corr: (T, S) ⇒ Boolean)(that: scala.Iterator[S]): Boolean
    Definition Classes
    AugmentedSeqIterator
  29. def corresponds[B](that: GenTraversableOnce[B])(p: (T, B) ⇒ Boolean): Boolean
    Definition Classes
    Iterator
  30. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  31. def drop(n: Int): ParArrayIterator

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

    Definition Classes
    ParArrayIterator → IterableSplitter → Iterator
  32. def drop2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  33. def dropWhile(p: (T) ⇒ Boolean): Iterator[T]
    Definition Classes
    Iterator
  34. def dup: ParArrayIterator

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    ParArrayIterator → SeqSplitter → IterableSplitter
  35. def duplicate: (Iterator[T], Iterator[T])
    Definition Classes
    Iterator
  36. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  38. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    ParArrayIterator → Iterator → TraversableOnce → GenTraversableOnce
  39. def filter(p: (T) ⇒ Boolean): Iterator[T]
    Definition Classes
    Iterator
  40. def filter2combiner[U >: T, This](pred: (T) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  41. def filterNot(p: (T) ⇒ Boolean): Iterator[T]
    Definition Classes
    Iterator
  42. def filterNot2combiner[U >: T, This](pred: (T) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  43. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  44. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    ParArrayIterator → Iterator → TraversableOnce → GenTraversableOnce
  45. def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  46. def flatmap2combiner[S, That](f: (T) ⇒ GenTraversableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  47. def fold[U >: T](z: U)(op: (U, U) ⇒ U): U
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  48. def foldLeft[S](z: S)(op: (S, T) ⇒ S): S
    Definition Classes
    ParArrayIterator → TraversableOnce → GenTraversableOnce
  49. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    ParArrayIterator → Iterator → TraversableOnce → GenTraversableOnce
  51. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    ParArrayIterator → Iterator → GenTraversableOnce
  52. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  53. def grouped[B >: T](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  54. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  55. def hasNext: Boolean
    Definition Classes
    ParArrayIterator → Iterator
  56. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  57. var i: Int
  58. def indexFlag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  59. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    Iterator
  60. def indexOf[B >: T](elem: B): Int
    Definition Classes
    Iterator
  61. def indexWhere(pred: (T) ⇒ Boolean): Int
    Definition Classes
    ParArrayIterator → AugmentedSeqIterator → Iterator
  62. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    Iterator
  63. def isAborted: Boolean
    Definition Classes
    DelegatedSignalling → Signalling
  64. def isEmpty: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  65. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  66. def isRemainingCheap: Boolean

    For most collections, this is a cheap operation.

    For most collections, this is a cheap operation. Exceptions can override this method.

    Definition Classes
    RemainsIterator
  67. def isTraversableAgain: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  68. def lastIndexWhere(pred: (T) ⇒ Boolean): Int
    Definition Classes
    ParArrayIterator → AugmentedSeqIterator
  69. def length: Int
    Definition Classes
    Iterator
  70. def map[S](f: (T) ⇒ S): Mapped[S]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator
  71. def map2combiner[S, That](f: (T) ⇒ S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  72. def max[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  73. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def min[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  75. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  80. def next(): T
    Definition Classes
    ParArrayIterator → Iterator
  81. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. final def notify(): Unit
    Definition Classes
    AnyRef
  83. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  84. def padTo[A1 >: T](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  85. def partition(p: (T) ⇒ Boolean): (Iterator[T], Iterator[T])
    Definition Classes
    Iterator
  86. def partition2combiners[U >: T, This](pred: (T) ⇒ Boolean, btrue: Combiner[U, This], bfalse: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  87. def patch[B >: T](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  88. def patchParSeq[U >: T](from: Int, patchElems: SeqSplitter[U], replaced: Int): Patched[U]
    Definition Classes
    SeqSplitter
  89. def prefixLength(pred: (T) ⇒ Boolean): Int
    Definition Classes
    ParArrayIterator → AugmentedSeqIterator
  90. def product[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  91. def psplit(sizesIncomplete: Int*): scala.Seq[ParArrayIterator]

    Splits the splitter into disjunct views.

    Splits the splitter into disjunct views.

    This overloaded version of the split method is specific to precise splitters. It returns a sequence of splitters, each iterating some subset of the elements in this splitter. The sizes of the subsplitters in the partition is equal to the size in the corresponding argument, as long as there are enough elements in this splitter to split it that way.

    If there aren't enough elements, a zero element splitter is appended for each additional argument. If there are additional elements, an additional splitter is appended at the end to compensate.

    For example, say we have a splitter ps with 100 elements. Invoking:

    ps.split(50, 25, 25, 10, 5)

    will return a sequence of five splitters, last two views being empty. On the other hand, calling:

    ps.split(50, 40)

    will return a sequence of three splitters, last of them containing ten elements.

    Note: this method actually invalidates the current splitter.

    Unlike the case with split found in splitters, views returned by this method can be empty.

    returns

    a sequence of disjunct subsequence iterators of this parallel iterator

    Definition Classes
    ParArrayIterator → SeqSplitter → PreciseSplitter
  92. def psplitWithSignalling(sizes: Int*): scala.Seq[SeqSplitter[T]]
    Definition Classes
    SeqSplitter
  93. def reduce[U >: T](op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  94. def reduceLeft[U >: T](howmany: Int, op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator
  95. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  96. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def remaining: Int

    The number of elements this iterator has yet to traverse.

    The number of elements this iterator has yet to traverse. This method doesn't change the state of the iterator. Unlike the version of this method in the supertrait, method remaining in ParSeqLike.this.ParIterator must return an exact number of elements remaining in the iterator.

    returns

    an exact number of elements this iterator has yet to iterate

    Definition Classes
    ParArrayIterator → SeqSplitter → AugmentedSeqIterator → IterableSplitter → RemainsIterator
  101. def reverse: SeqSplitter[T]
    Definition Classes
    SeqSplitter
  102. def reverse2combiner[U >: T, This](cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    ParArrayIterator → AugmentedSeqIterator
  103. def reverseMap2combiner[S, That](f: (T) ⇒ S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedSeqIterator
  104. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  105. def sameElements(that: scala.Iterator[_]): Boolean
    Definition Classes
    ParArrayIterator → Iterator
  106. def scanLeft[B](z: B)(op: (B, T) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  107. def scanRight[B](z: B)(op: (T, B) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  108. def scanToArray[U >: T, A >: U](z: U, op: (U, U) ⇒ U, destarr: Array[A], from: Int): Unit
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  109. def scanToArray_quick[U](srcarr: Array[Any], destarr: Array[Any], op: (U, U) ⇒ U, z: U, srcfrom: Int, srcntil: Int, destfrom: Int): Unit
    Attributes
    protected
  110. def scanToCombiner[U >: T, That](howmany: Int, startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  111. def scanToCombiner[U >: T, That](startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  112. def seq: Iterator[T]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  113. def setIndexFlag(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  114. def setIndexFlagIfGreater(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  115. def setIndexFlagIfLesser(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  116. def shouldSplitFurther[S](coll: parallel.ParIterable[S], parallelismLevel: Int): Boolean
    Definition Classes
    IterableSplitter
  117. val signalDelegate: Signalling
    Definition Classes
    IterableSplitter → DelegatedSignalling
  118. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  120. def slice(from1: Int, until1: Int): SeqSplitter[T]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator
  121. def slice2combiner[U >: T, This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  122. def sliceIterator(from: Int, until: Int): Iterator[T]
    Attributes
    protected
    Definition Classes
    Iterator
  123. def sliding[B >: T](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  124. def span(p: (T) ⇒ Boolean): (Iterator[T], Iterator[T])
    Definition Classes
    Iterator
  125. def span2combiners[U >: T, This](p: (T) ⇒ Boolean, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  126. def split: scala.Seq[ParArrayIterator]

    Splits the iterator into a sequence of disjunct views.

    Splits the iterator into a sequence of disjunct views.

    Returns a sequence of split iterators, each iterating over some subset of the elements in the collection. These subsets are disjoint and should be approximately equal in size. These subsets are not empty, unless the iterator is empty in which case this method returns a sequence with a single empty iterator. If the splitter has more than two elements, this method will return two or more splitters.

    Implementors are advised to keep this partition relatively small - two splitters are already enough when partitioning the collection, although there may be a few more.

    Note: this method actually invalidates the current splitter.

    returns

    a sequence of disjunct iterators of the collection

    Definition Classes
    ParArrayIterator → SeqSplitter → PreciseSplitter → IterableSplitter → Splitter
  127. def splitAt2combiners[U >: T, This](at: Int, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  128. def splitWithSignalling: scala.Seq[SeqSplitter[T]]
    Definition Classes
    SeqSplitter → IterableSplitter
  129. def sum[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  130. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  131. def tag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  132. def take(n: Int): SeqSplitter[T]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator
  133. def take2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    ParArrayIterator → AugmentedIterableIterator
  134. def takeWhile(p: (T) ⇒ Boolean): Iterator[T]
    Definition Classes
    Iterator
  135. def takeWhile2combiner[U >: T, This](p: (T) ⇒ Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  136. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toIndexedSeq: immutable.IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toIterable: Iterable[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toIterator: Iterator[T]
    Definition Classes
    Iterator → GenTraversableOnce
  142. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toMap[T, U](implicit ev: <:<[T, (T, U)]): immutable.Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toSeq: Seq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toSet[B >: T]: immutable.Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toStream: immutable.Stream[T]
    Definition Classes
    Iterator → GenTraversableOnce
  147. def toString(): String
    Definition Classes
    ParArrayIterator → Iterator → AnyRef → Any
  148. def toTraversable: Traversable[T]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  149. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. val until: Int
  151. def updated2combiner[U >: T, That](index: Int, elem: U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedSeqIterator
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  153. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  154. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  155. def withFilter(p: (T) ⇒ Boolean): Iterator[T]
    Definition Classes
    Iterator
  156. def zip[B](that: Iterator[B]): Iterator[(T, B)]
    Definition Classes
    Iterator
  157. def zip2combiner[U >: T, S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  158. def zipAll[B, A1 >: T, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
    Definition Classes
    Iterator
  159. def zipAll2combiner[U >: T, S, That](that: RemainsIterator[S], thiselem: U, thatelem: S, cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  160. def zipAllParSeq[S, U >: T, R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
    Definition Classes
    SeqSplitter → IterableSplitter
  161. def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
    Definition Classes
    SeqSplitter → IterableSplitter
  162. def zipWithIndex: Iterator[(T, Int)]
    Definition Classes
    Iterator

Inherited from SeqSplitter[T]

Inherited from PreciseSplitter[T]

Inherited from AugmentedSeqIterator[T]

Inherited from IterableSplitter[T]

Inherited from DelegatedSignalling

Inherited from Signalling

Inherited from Splitter[T]

Inherited from AugmentedIterableIterator[T]

Inherited from RemainsIterator[T]

Inherited from Iterator[T]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped