Packages

class ZippedAll[U >: T, S] extends SeqSplitter.ZippedAll[U, S] with SeqSplitter[(U, S)]

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

Instance Constructors

  1. new ZippedAll(ti: SeqSplitter[S], thise: U, thate: S)

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[immutable.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. final def ++[B >: (U, S)](xs: => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @inline()
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def abort(): Unit

    Sends an abort signal to other workers.

    Sends an abort signal to other workers.

    Abort flag being true means that a worker can abort and produce whatever result, since its result will not affect the final result of computation. An example of operations using this are find, forall and exists methods.

    Definition Classes
    DelegatedSignalling → Signalling
  6. final def addString(b: mutable.StringBuilder): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  7. final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
  9. def appendParIterable[U >: (U, S), PI <: IterableSplitter[U]](that: PI): ZippedAll.Appended[U, PI]
    Definition Classes
    IterableSplitter
  10. def appendParSeq[U >: (U, S), PI <: SeqSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    SeqSplitter
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def buffered: BufferedIterator[(U, S)]
    Definition Classes
    Iterator
  13. def buildString(closure: ((String) => Unit) => Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  15. def collect[B](pf: PartialFunction[(U, S), B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  16. def collect2combiner[S, That](pf: PartialFunction[(U, S), S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  17. def collectFirst[B](pf: PartialFunction[(U, S), B]): Option[B]
    Definition Classes
    IterableOnceOps
  18. def concat[B >: (U, S)](xs: => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  19. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  20. def copy2builder[U >: (U, S), Coll, Bld <: Builder[U, Coll]](b: Bld): Bld
    Definition Classes
    AugmentedIterableIterator
  21. def copyToArray[B >: (U, S)](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  22. def copyToArray[B >: (U, S)](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  23. def copyToArray[B >: (U, S)](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  24. def corresponds[S](corr: ((U, S), S) => Boolean)(that: scala.Iterator[S]): Boolean
    Definition Classes
    AugmentedSeqIterator
  25. def corresponds[B](that: IterableOnce[B])(p: ((U, S), B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  26. def count(p: ((U, S)) => Boolean): Int
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  27. def distinct: Iterator[(U, S)]
    Definition Classes
    Iterator
  28. def distinctBy[B](f: ((U, S)) => B): Iterator[(U, S)]
    Definition Classes
    Iterator
  29. def drop(n: Int): IterableSplitter[(U, S)]

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

    Definition Classes
    IterableSplitter → Iterator → IterableOnceOps
  30. def drop2combiner[U >: (U, S), This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  31. def dropWhile(p: ((U, S)) => Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnceOps
  32. def dup: SeqSplitter[(U, S)]

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    ZippedAll → SeqSplitter → ZippedAll → IterableSplitter
  33. def duplicate: (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator
  34. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  36. def exists(p: ((U, S)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def filter(p: ((U, S)) => Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnceOps
  38. def filter2combiner[U >: (U, S), This](pred: ((U, S)) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  39. def filterNot(p: ((U, S)) => Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnceOps
  40. def filterNot2combiner[U >: (U, S), This](pred: ((U, S)) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  41. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  42. def find(p: ((U, S)) => Boolean): Option[(U, S)]
    Definition Classes
    IterableOnceOps
  43. def flatMap[B](f: ((U, S)) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  44. def flatmap2combiner[S, That](f: ((U, S)) => scala.IterableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  45. def flatten[B](implicit ev: ((U, S)) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  46. def fold[U >: (U, S)](z: U)(op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  47. def foldLeft[B](z: B)(op: (B, (U, S)) => B): B
    Definition Classes
    IterableOnceOps
  48. def foldRight[B](z: B)(op: ((U, S), B) => B): B
    Definition Classes
    IterableOnceOps
  49. def forall(p: ((U, S)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  50. def foreach[U](f: ((U, S)) => U): Unit
    Definition Classes
    IterableOnceOps
  51. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  52. def grouped[B >: (U, S)](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  53. def hasNext: Boolean
    Definition Classes
    ZippedAll → Iterator
  54. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  55. def indexFlag: Int

    Returns the value of the index flag.

    Returns the value of the index flag.

    The index flag holds an integer which carries some operation-specific meaning. For instance, takeWhile operation sets the index flag to the position of the element where the predicate fails. Other workers may check this index against the indices they are working on and return if this index is smaller than their index. Examples of operations using this are takeWhile, dropWhile, span and indexOf.

    returns

    the value of the index flag

    Definition Classes
    DelegatedSignalling → Signalling
  56. def indexOf[B >: (U, S)](elem: B, from: Int): Int
    Definition Classes
    Iterator
  57. def indexOf[B >: (U, S)](elem: B): Int
    Definition Classes
    Iterator
  58. def indexWhere(pred: ((U, S)) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  59. def indexWhere(p: ((U, S)) => Boolean, from: Int): Int
    Definition Classes
    Iterator
  60. def isAborted: Boolean

    Checks whether an abort signal has been issued.

    Checks whether an abort signal has been issued.

    Abort flag being true means that a worker can abort and produce whatever result, since its result will not affect the final result of computation. An example of operations using this are find, forall and exists methods.

    returns

    the state of the abort

    Definition Classes
    DelegatedSignalling → Signalling
  61. def isEmpty: Boolean
    Definition Classes
    Iterator → IterableOnceOps
    Annotations
    @deprecatedOverriding("isEmpty is defined as !hasNext; override hasNext instead", "2.13.0")
  62. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  63. 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
  64. def isTraversableAgain: Boolean
    Definition Classes
    IterableOnceOps
  65. final def iterator: Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnce
    Annotations
    @inline()
  66. def knownSize: Int
    Definition Classes
    IterableOnce
  67. def lastIndexWhere(pred: ((U, S)) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  68. final def length: Int
    Definition Classes
    Iterator
    Annotations
    @inline()
  69. def map[S](f: ((U, S)) => S): Mapped[S]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator → IterableOnceOps
  70. def map2combiner[S, That](f: ((U, S)) => S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  71. def max[U >: (U, S)](implicit ord: Ordering[U]): (U, S)
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  72. def maxBy[B](f: ((U, S)) => B)(implicit cmp: math.Ordering[B]): (U, S)
    Definition Classes
    IterableOnceOps
  73. def maxByOption[B](f: ((U, S)) => B)(implicit cmp: math.Ordering[B]): Option[(U, S)]
    Definition Classes
    IterableOnceOps
  74. def maxOption[B >: (U, S)](implicit ord: math.Ordering[B]): Option[(U, S)]
    Definition Classes
    IterableOnceOps
  75. def min[U >: (U, S)](implicit ord: Ordering[U]): (U, S)
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  76. def minBy[B](f: ((U, S)) => B)(implicit cmp: math.Ordering[B]): (U, S)
    Definition Classes
    IterableOnceOps
  77. def minByOption[B](f: ((U, S)) => B)(implicit cmp: math.Ordering[B]): Option[(U, S)]
    Definition Classes
    IterableOnceOps
  78. def minOption[B >: (U, S)](implicit ord: math.Ordering[B]): Option[(U, S)]
    Definition Classes
    IterableOnceOps
  79. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  80. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  81. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  82. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  83. def next(): (U, S)
    Definition Classes
    ZippedAll → Iterator
  84. def nextOption(): Option[(U, S)]
    Definition Classes
    Iterator
  85. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  86. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  87. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. def padTo[B >: (U, S)](len: Int, elem: B): Iterator[B]
    Definition Classes
    Iterator
  89. def partition(p: ((U, S)) => Boolean): (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator
  90. def partition2combiners[U >: (U, S), This](pred: ((U, S)) => Boolean, btrue: Combiner[U, This], bfalse: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  91. def patch[B >: (U, S)](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  92. def patchParSeq[U >: (U, S)](from: Int, patchElems: SeqSplitter[U], replaced: Int): Patched[U]
    Definition Classes
    SeqSplitter
  93. def prefixLength(pred: ((U, S)) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  94. def product[U >: (U, S)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  95. def psplit(sizes: Int*): scala.Seq[SeqSplitter[(U, S)]]

    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
    ZippedAll → SeqSplitter → PreciseSplitter
  96. def psplitWithSignalling(sizes: Int*): scala.Seq[SeqSplitter[(U, S)]]
    Definition Classes
    SeqSplitter
  97. def reduce[U >: (U, S)](op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  98. def reduceLeft[U >: (U, S)](howmany: Int, op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator
  99. def reduceLeft[B >: (U, S)](op: (B, (U, S)) => B): B
    Definition Classes
    IterableOnceOps
  100. def reduceLeftOption[B >: (U, S)](op: (B, (U, S)) => B): Option[B]
    Definition Classes
    IterableOnceOps
  101. def reduceOption[B >: (U, S)](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def reduceRight[B >: (U, S)](op: ((U, S), B) => B): B
    Definition Classes
    IterableOnceOps
  103. def reduceRightOption[B >: (U, S)](op: ((U, S), B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  104. 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
    ZippedAll → IterableSplitter → RemainsIterator
  105. def reverse: SeqSplitter[(U, S)]
    Definition Classes
    SeqSplitter
  106. def reverse2combiner[U >: (U, S), This](cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedSeqIterator
  107. def reverseMap2combiner[S, That](f: ((U, S)) => S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedSeqIterator
  108. def reversed: Iterable[(U, S)]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  109. def sameElements[B >: (U, S)](that: IterableOnce[B]): Boolean
    Definition Classes
    Iterator
  110. def scanLeft[B](z: B)(op: (B, (U, S)) => B): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  111. def scanToArray[U >: (U, S), A >: U](z: U, op: (U, U) => U, array: Array[A], from: Int): Unit
    Definition Classes
    AugmentedIterableIterator
  112. def scanToCombiner[U >: (U, S), That](howmany: Int, startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  113. def scanToCombiner[U >: (U, S), That](startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  114. def setIndexFlag(f: Int): Unit

    Sets the value of the index flag.

    Sets the value of the index flag.

    The index flag holds an integer which carries some operation-specific meaning. For instance, takeWhile operation sets the index flag to the position of the element where the predicate fails. Other workers may check this index against the indices they are working on and return if this index is smaller than their index. Examples of operations using this are takeWhile, dropWhile, span and indexOf.

    f

    the value to which the index flag is set.

    Definition Classes
    DelegatedSignalling → Signalling
  115. def setIndexFlagIfGreater(f: Int): Unit

    Sets the value of the index flag if argument is greater than current value.

    Sets the value of the index flag if argument is greater than current value. This method does this atomically.

    The index flag holds an integer which carries some operation-specific meaning. For instance, takeWhile operation sets the index flag to the position of the element where the predicate fails. Other workers may check this index against the indices they are working on and return if this index is smaller than their index. Examples of operations using this are takeWhile, dropWhile, span and indexOf.

    f

    the value to which the index flag is set

    Definition Classes
    DelegatedSignalling → Signalling
  116. def setIndexFlagIfLesser(f: Int): Unit

    Sets the value of the index flag if argument is lesser than current value.

    Sets the value of the index flag if argument is lesser than current value. This method does this atomically.

    The index flag holds an integer which carries some operation-specific meaning. For instance, takeWhile operation sets the index flag to the position of the element where the predicate fails. Other workers may check this index against the indices they are working on and return if this index is smaller than their index. Examples of operations using this are takeWhile, dropWhile, span and indexOf.

    f

    the value to which the index flag is set

    Definition Classes
    DelegatedSignalling → Signalling
  117. def shouldSplitFurther[S](coll: ParIterable[S], parallelismLevel: Int): Boolean
    Definition Classes
    IterableSplitter
  118. val signalDelegate: Signalling

    A delegate that method calls are redirected to.

    A delegate that method calls are redirected to.

    Definition Classes
    IterableSplitter → DelegatedSignalling
  119. def size: Int
    Definition Classes
    IterableOnceOps
  120. def slice(from1: Int, until1: Int): SeqSplitter[(U, S)]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator → IterableOnceOps
  121. def slice2combiner[U >: (U, S), This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  122. def sliceIterator(from: Int, until: Int): Iterator[(U, S)]
    Attributes
    protected
    Definition Classes
    Iterator
  123. def sliding[B >: (U, S)](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  124. def span(p: ((U, S)) => Boolean): (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator → IterableOnceOps
  125. def span2combiners[U >: (U, S), This](p: ((U, S)) => Boolean, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  126. def split: scala.Seq[SeqSplitter[(U, S)]]

    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
    ZippedAll → SeqSplitter → PreciseSplitter → ZippedAll → IterableSplitter → Splitter
  127. def splitAt(n: Int): (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    IterableOnceOps
  128. def splitAt2combiners[U >: (U, S), This](at: Int, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  129. def splitWithSignalling: scala.Seq[SeqSplitter[(U, S)]]
    Definition Classes
    SeqSplitter → IterableSplitter
  130. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(U, S), S]): S
    Definition Classes
    IterableOnce
  131. def sum[U >: (U, S)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  132. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  133. def tag: Int

    A read only tag specific to the signalling object.

    A read only tag specific to the signalling object. It is used to give specific workers information on the part of the collection being operated on.

    Definition Classes
    DelegatedSignalling → Signalling
  134. def take(n: Int): SeqSplitter[(U, S)]
    Definition Classes
    SeqSplitter → IterableSplitter → Iterator → IterableOnceOps
  135. def take2combiner[U >: (U, S), This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  136. def takeWhile(p: ((U, S)) => Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnceOps
  137. def takeWhile2combiner[U >: (U, S), This](p: ((U, S)) => Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  138. def tapEach[U](f: ((U, S)) => U): Iterator[(U, S)]
    Definition Classes
    Iterator → IterableOnceOps
  139. val that: SeqSplitter[S]
    Attributes
    protected
    Definition Classes
    ZippedAll
  140. val thatelem: S
    Attributes
    protected
    Definition Classes
    ZippedAll
  141. val thiselem: U
    Attributes
    protected
    Definition Classes
    ZippedAll
  142. def to[C1](factory: Factory[(U, S), C1]): C1
    Definition Classes
    IterableOnceOps
  143. def toArray[B >: (U, S)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  144. final def toBuffer[B >: (U, S)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  145. def toIndexedSeq: immutable.IndexedSeq[(U, S)]
    Definition Classes
    IterableOnceOps
  146. def toList: immutable.List[(U, S)]
    Definition Classes
    IterableOnceOps
  147. def toMap[K, V](implicit ev: <:<[(U, S), (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  148. def toSeq: immutable.Seq[(U, S)]
    Definition Classes
    IterableOnceOps
  149. def toSet[B >: (U, S)]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  150. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  151. def toVector: immutable.Vector[(U, S)]
    Definition Classes
    IterableOnceOps
  152. def updated2combiner[U >: (U, S), That](index: Int, elem: U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedSeqIterator
  153. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  154. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  155. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  156. def withFilter(p: ((U, S)) => Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator
  157. def zip[B](that: IterableOnce[B]): Iterator[((U, S), B)]
    Definition Classes
    Iterator
  158. def zip2combiner[U >: (U, S), S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  159. def zipAll[A1 >: (U, S), B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
    Definition Classes
    Iterator
  160. def zipAll2combiner[U >: (U, S), S, That](that: RemainsIterator[S], thiselem: U, thatelem: S, cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  161. def zipAllParSeq[S, U >: (U, S), R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
    Definition Classes
    SeqSplitter → IterableSplitter
  162. def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
    Definition Classes
    SeqSplitter → IterableSplitter
  163. def zipWithIndex: Iterator[((U, S), Int)]
    Definition Classes
    Iterator → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, (U, S)) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: ((U, S), B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, (U, S)) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. final def copyToBuffer[B >: (U, S)](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  5. final def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) hasDefiniteSize on Iterator is the same as isEmpty

  6. def scanRight[B](z: B)(op: ((U, S), B) => B): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Call scanRight on an Iterable instead.

  7. def seq: ZippedAll.this.type
    Definition Classes
    Iterator
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterator.seq always returns the iterator itself

  8. final def toIterator: Iterator[(U, S)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  9. final def toStream: immutable.Stream[(U, S)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

Inherited from SeqSplitter[(U, S)]

Inherited from PreciseSplitter[(U, S)]

Inherited from AugmentedSeqIterator[(U, S)]

Inherited from SeqSplitter.ZippedAll[U, S]

Inherited from IterableSplitter[(U, S)]

Inherited from DelegatedSignalling

Inherited from Signalling

Inherited from Splitter[(U, S)]

Inherited from AugmentedIterableIterator[(U, S)]

Inherited from RemainsIterator[(U, S)]

Inherited from Iterator[(U, S)]

Inherited from IterableOnceOps[(U, S), Iterator, Iterator[(U, S)]]

Inherited from IterableOnce[(U, S)]

Inherited from AnyRef

Inherited from Any

Ungrouped