Packages

class ZippedAll[U >: T, S] extends IterableSplitter[(U, S)]

Linear Supertypes
IterableSplitter[(U, S)], DelegatedSignalling, Signalling, Splitter[(U, S)], AugmentedIterableIterator[(U, S)], RemainsIterator[(U, S)], Iterator[(U, S)], TraversableOnce[(U, S)], GenTraversableOnce[(U, S)], AnyRef, Any
Known Subclasses
ZippedAll
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ZippedAll
  2. IterableSplitter
  3. DelegatedSignalling
  4. Signalling
  5. Splitter
  6. AugmentedIterableIterator
  7. RemainsIterator
  8. Iterator
  9. TraversableOnce
  10. GenTraversableOnce
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ZippedAll(that: SeqSplitter[S], thiselem: U, thatelem: S)

Type Members

  1. class Appended [U >: T, PI <: IterableSplitter[U]] extends IterableSplitter[U]
    Definition Classes
    IterableSplitter
  2. class Mapped [S] extends IterableSplitter[S]
    Definition Classes
    IterableSplitter
  3. class Taken extends IterableSplitter[T]
    Definition Classes
    IterableSplitter
  4. class Zipped [S] extends IterableSplitter[(T, S)]
    Definition Classes
    IterableSplitter
  5. class ZippedAll[U >: T, S] extends IterableSplitter[(U, S)]
    Definition Classes
    IterableSplitter
  6. 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 >: (U, S)](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. def /:[B](z: B)(op: (B, (U, S)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: ((U, S), 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, S)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. def appendParIterable[U >: (U, S), PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    IterableSplitter
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def buffered: BufferedIterator[(U, S)]
    Definition Classes
    Iterator
  15. def buildString(closure: ((String) ⇒ Unit) ⇒ Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def collect[B](pf: PartialFunction[(U, S), 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.

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

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

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

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    ZippedAll → IterableSplitter
  32. def duplicate: (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  35. def exists(p: ((U, S)) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  36. def filter(p: ((U, S)) ⇒ Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator
  37. def filter2combiner[U >: (U, S), This](pred: ((U, S)) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  38. def filterNot(p: ((U, S)) ⇒ Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator
  39. def filterNot2combiner[U >: (U, S), This](pred: ((U, S)) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  40. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  41. def find(p: ((U, S)) ⇒ Boolean): Option[(U, S)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  42. def flatMap[B](f: ((U, S)) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  43. def flatmap2combiner[S, That](f: ((U, S)) ⇒ GenTraversableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  44. def fold[U >: (U, S)](z: U)(op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  45. def foldLeft[B](z: B)(op: (B, (U, S)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def foldRight[B](z: B)(op: ((U, S), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def forall(p: ((U, S)) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  48. def foreach[U](f: ((U, S)) ⇒ U): Unit
    Definition Classes
    Iterator → GenTraversableOnce
  49. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  50. def grouped[B >: (U, S)](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  51. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  52. def hasNext: Boolean
    Definition Classes
    ZippedAll → Iterator
  53. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  54. def indexFlag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  55. def indexOf[B >: (U, S)](elem: B, from: Int): Int
    Definition Classes
    Iterator
  56. def indexOf[B >: (U, S)](elem: B): Int
    Definition Classes
    Iterator
  57. def indexWhere(p: ((U, S)) ⇒ Boolean, from: Int): Int
    Definition Classes
    Iterator
  58. def indexWhere(p: ((U, S)) ⇒ Boolean): Int
    Definition Classes
    Iterator
  59. def isAborted: Boolean
    Definition Classes
    DelegatedSignalling → Signalling
  60. def isEmpty: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  61. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  62. 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
  63. def isTraversableAgain: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  64. def length: Int
    Definition Classes
    Iterator
  65. def map[S](f: ((U, S)) ⇒ S): Mapped[S]
    Definition Classes
    IterableSplitter → Iterator
  66. def map2combiner[S, That](f: ((U, S)) ⇒ S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  67. def max[U >: (U, S)](implicit ord: Ordering[U]): (U, S)
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  68. def maxBy[B](f: ((U, S)) ⇒ B)(implicit cmp: Ordering[B]): (U, S)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def min[U >: (U, S)](implicit ord: Ordering[U]): (U, S)
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  70. def minBy[B](f: ((U, S)) ⇒ B)(implicit cmp: Ordering[B]): (U, S)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  75. def next(): (U, S)
    Definition Classes
    ZippedAll → Iterator
  76. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. final def notify(): Unit
    Definition Classes
    AnyRef
  78. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  79. def padTo[A1 >: (U, S)](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  80. def partition(p: ((U, S)) ⇒ Boolean): (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator
  81. 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
  82. def patch[B >: (U, S)](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  83. def product[U >: (U, S)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  84. def reduce[U >: (U, S)](op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  85. def reduceLeft[U >: (U, S)](howmany: Int, op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator
  86. def reduceLeft[B >: (U, S)](op: (B, (U, S)) ⇒ B): B
    Definition Classes
    TraversableOnce
  87. def reduceLeftOption[B >: (U, S)](op: (B, (U, S)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def reduceOption[A1 >: (U, S)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def reduceRight[B >: (U, S)](op: ((U, S), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def reduceRightOption[B >: (U, S)](op: ((U, S), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. 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
  92. def reversed: List[(U, S)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  93. def sameElements(that: Iterator[_]): Boolean
    Definition Classes
    Iterator
  94. def scanLeft[B](z: B)(op: (B, (U, S)) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  95. def scanRight[B](z: B)(op: ((U, S), B) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  96. def scanToArray[U >: (U, S), A >: U](z: U, op: (U, U) ⇒ U, array: Array[A], from: Int): Unit
    Definition Classes
    AugmentedIterableIterator
  97. def scanToCombiner[U >: (U, S), That](howmany: Int, startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  98. def scanToCombiner[U >: (U, S), That](startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  99. def seq: Iterator[(U, S)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  100. def setIndexFlag(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  101. def setIndexFlagIfGreater(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  102. def setIndexFlagIfLesser(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  103. def shouldSplitFurther[S](coll: ParIterable[S], parallelismLevel: Int): Boolean
    Definition Classes
    IterableSplitter
  104. val signalDelegate: Signalling
    Definition Classes
    IterableSplitter → DelegatedSignalling
  105. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  107. def slice(from1: Int, until1: Int): IterableSplitter[(U, S)]
    Definition Classes
    IterableSplitter → Iterator
  108. def slice2combiner[U >: (U, S), This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  109. def sliceIterator(from: Int, until: Int): Iterator[(U, S)]
    Attributes
    protected
    Definition Classes
    Iterator
  110. def sliding[B >: (U, S)](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  111. def span(p: ((U, S)) ⇒ Boolean): (Iterator[(U, S)], Iterator[(U, S)])
    Definition Classes
    Iterator
  112. 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
  113. def split: scala.Seq[IterableSplitter[(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 → IterableSplitter → Splitter
  114. 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
  115. def splitWithSignalling: scala.Seq[IterableSplitter[(U, S)]]
    Definition Classes
    IterableSplitter
  116. def sum[U >: (U, S)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  117. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  118. def tag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  119. def take(n: Int): IterableSplitter[(U, S)]
    Definition Classes
    IterableSplitter → Iterator
  120. def take2combiner[U >: (U, S), This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  121. def takeWhile(p: ((U, S)) ⇒ Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator
  122. def takeWhile2combiner[U >: (U, S), This](p: ((U, S)) ⇒ Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  123. val that: SeqSplitter[S]
    Attributes
    protected
  124. val thatelem: S
    Attributes
    protected
  125. val thiselem: U
    Attributes
    protected
  126. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (U, S), Col[(U, S)]]): Col[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def toArray[B >: (U, S)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def toBuffer[B >: (U, S)]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def toIndexedSeq: immutable.IndexedSeq[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toIterable: Iterable[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toIterator: Iterator[(U, S)]
    Definition Classes
    Iterator → GenTraversableOnce
  132. def toList: List[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toMap[T, U](implicit ev: <:<[(U, S), (T, U)]): immutable.Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toSeq: Seq[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toSet[B >: (U, S)]: immutable.Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toStream: immutable.Stream[(U, S)]
    Definition Classes
    Iterator → GenTraversableOnce
  137. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  138. def toTraversable: Traversable[(U, S)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  139. def toVector: Vector[(U, S)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  141. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  142. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  143. def withFilter(p: ((U, S)) ⇒ Boolean): Iterator[(U, S)]
    Definition Classes
    Iterator
  144. def zip[B](that: Iterator[B]): Iterator[((U, S), B)]
    Definition Classes
    Iterator
  145. def zip2combiner[U >: (U, S), S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  146. def zipAll[B, A1 >: (U, S), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
    Definition Classes
    Iterator
  147. 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
  148. def zipAllParSeq[S, U >: (U, S), R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
    Definition Classes
    IterableSplitter
  149. def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
    Definition Classes
    IterableSplitter
  150. def zipWithIndex: Iterator[((U, S), Int)]
    Definition Classes
    Iterator

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 TraversableOnce[(U, S)]

Inherited from GenTraversableOnce[(U, S)]

Inherited from AnyRef

Inherited from Any

Ungrouped