t

scala.collection.parallel

IterableSplitter

trait IterableSplitter[+T] extends AugmentedIterableIterator[T] with Splitter[T] with Signalling with DelegatedSignalling

Parallel iterators allow splitting and provide a remaining method to obtain the number of elements remaining in the iterator.

T

type of the elements iterated.

Self Type
IterableSplitter[T]
Linear Supertypes
DelegatedSignalling, Signalling, Splitter[T], AugmentedIterableIterator[T], RemainsIterator[T], Iterator[T], TraversableOnce[T], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
Appended, Mapped, Taken, Zipped, ZippedAll, Elements, SeqSplitter, Appended, Mapped, Patched, Taken, Zipped, ZippedAll, ParHashMapIterator, ParHashSetIterator, ParRangeIterator, ParVectorIterator, ParArrayIterator, ParFlatHashTableIterator, ParHashMapIterator, ParHashSetIterator, EntryIterator
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IterableSplitter
  2. DelegatedSignalling
  3. Signalling
  4. Splitter
  5. AugmentedIterableIterator
  6. RemainsIterator
  7. Iterator
  8. TraversableOnce
  9. GenTraversableOnce
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

Abstract Value Members

  1. abstract def dup: IterableSplitter[T]

    Creates a copy of this iterator.

  2. abstract def hasNext: Boolean
    Definition Classes
    Iterator
  3. abstract def next(): T
    Definition Classes
    Iterator
  4. abstract 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
    IterableSplitter → RemainsIterator
  5. abstract def split: scala.Seq[IterableSplitter[T]]

    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
    IterableSplitter → Splitter

Concrete 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[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. def appendParIterable[U >: T, PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def buffered: BufferedIterator[T]
    Definition Classes
    Iterator
  15. def buildString(closure: ((String) ⇒ Unit) ⇒ Unit): String
    Attributes
    protected
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. 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.

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

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

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

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