Packages

class Appended[U >: T, PI <: SeqSplitter[U]] extends SeqSplitter.Appended[U, PI] with SeqSplitter[U]

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

Instance Constructors

  1. new Appended(it: PI)

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: U](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. def /:[B](z: B)(op: (B, U) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: (U, 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[B](z: ⇒ B)(seqop: (B, U) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. def appendParIterable[U >: U, PI <: IterableSplitter[U]](that: PI): Appended.Appended[U, PI]
    Definition Classes
    IterableSplitter
  13. def appendParSeq[U >: U, PI <: SeqSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    SeqSplitter
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. def buffered: BufferedIterator[U]
    Definition Classes
    Iterator
  16. def buildString(closure: ((String) ⇒ Unit) ⇒ Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  17. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. def collect[B](pf: PartialFunction[U, 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.

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

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

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

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    Appended → SeqSplitter → Appended → IterableSplitter
  35. def duplicate: (Iterator[U], Iterator[U])
    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: (U) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  39. def filter(p: (U) ⇒ Boolean): Iterator[U]
    Definition Classes
    Iterator
  40. def filter2combiner[U >: U, This](pred: (U) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  41. def filterNot(p: (U) ⇒ Boolean): Iterator[U]
    Definition Classes
    Iterator
  42. def filterNot2combiner[U >: U, This](pred: (U) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  43. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  44. def find(p: (U) ⇒ Boolean): Option[U]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  45. def firstNonEmpty: Boolean
    Attributes
    protected
    Definition Classes
    Appended
  46. def flatMap[B](f: (U) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  47. def flatmap2combiner[S, That](f: (U) ⇒ GenTraversableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  48. def fold[U >: U](z: U)(op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  49. def foldLeft[B](z: B)(op: (B, U) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldRight[B](z: B)(op: (U, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def forall(p: (U) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  52. def foreach[U](f: (U) ⇒ U): Unit
    Definition Classes
    Iterator → GenTraversableOnce
  53. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  54. def grouped[B >: U](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  55. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  56. def hasNext: Boolean
    Definition Classes
    Appended → Iterator
  57. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  58. def indexFlag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  59. def indexOf[B >: U](elem: B, from: Int): Int
    Definition Classes
    Iterator
  60. def indexOf[B >: U](elem: B): Int
    Definition Classes
    Iterator
  61. def indexWhere(pred: (U) ⇒ Boolean): Int
    Definition Classes
    AugmentedSeqIterator → Iterator
  62. def indexWhere(p: (U) ⇒ 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: (U) ⇒ Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  69. def length: Int
    Definition Classes
    Iterator
  70. def map[S](f: (U) ⇒ S): Mapped[S]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator
  71. def map2combiner[S, That](f: (U) ⇒ S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  72. def max[U >: U](implicit ord: Ordering[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  73. def maxBy[B](f: (U) ⇒ B)(implicit cmp: Ordering[B]): U
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def min[U >: U](implicit ord: Ordering[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  75. def minBy[B](f: (U) ⇒ B)(implicit cmp: Ordering[B]): U
    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(): U
    Definition Classes
    Appended → 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 >: U](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  85. def partition(p: (U) ⇒ Boolean): (Iterator[U], Iterator[U])
    Definition Classes
    Iterator
  86. def partition2combiners[U >: U, This](pred: (U) ⇒ Boolean, btrue: Combiner[U, This], bfalse: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  87. def patch[B >: U](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  88. def patchParSeq[U >: U](from: Int, patchElems: SeqSplitter[U], replaced: Int): Patched[U]
    Definition Classes
    SeqSplitter
  89. def prefixLength(pred: (U) ⇒ Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  90. def product[U >: U](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  91. def psplit(sizes: Int*): scala.Seq[SeqSplitter[U]]

    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.

    sizes

    the sizes used to split this split iterator into iterators that traverse disjunct subsets

    returns

    a sequence of disjunct subsequence iterators of this parallel iterator

    Definition Classes
    Appended → SeqSplitter → PreciseSplitter
  92. def psplitWithSignalling(sizes: Int*): scala.Seq[SeqSplitter[U]]
    Definition Classes
    SeqSplitter
  93. def reduce[U >: U](op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  94. def reduceLeft[U >: U](howmany: Int, op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator
  95. def reduceLeft[B >: U](op: (B, U) ⇒ B): B
    Definition Classes
    TraversableOnce
  96. def reduceLeftOption[B >: U](op: (B, U) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def reduceOption[A1 >: U](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduceRight[B >: U](op: (U, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduceRightOption[B >: U](op: (U, 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.

    This method is used to provide size hints to builders and combiners, and to approximate positions of iterators within a data structure.

    Note: This method may be implemented to return an upper bound on the number of elements in the iterator, instead of the exact number of elements to iterate. Parallel collections which have such iterators are called non-strict-splitter collections.

    In that case, 2 considerations must be taken into account:

    1) classes that inherit ParIterable must reimplement methods take, drop, slice, splitAt, copyToArray and all others using this information.

    2) if an iterator provides an upper bound on the number of elements, then after splitting the sum of remaining values of split iterators must be less than or equal to this upper bound.

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

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

Inherited from SeqSplitter[U]

Inherited from PreciseSplitter[U]

Inherited from AugmentedSeqIterator[U]

Inherited from SeqSplitter.Appended[U, PI]

Inherited from IterableSplitter[U]

Inherited from DelegatedSignalling

Inherited from Signalling

Inherited from Splitter[U]

Inherited from AugmentedIterableIterator[U]

Inherited from RemainsIterator[U]

Inherited from Iterator[U]

Inherited from TraversableOnce[U]

Inherited from GenTraversableOnce[U]

Inherited from AnyRef

Inherited from Any

Ungrouped