Packages

  • package root
    Definition Classes
    root
  • package scala
    Definition Classes
    root
  • package collection
    Definition Classes
    scala
  • package parallel

    Package object for parallel collections.

    Package object for parallel collections.

    Definition Classes
    collection
  • package immutable
    Definition Classes
    parallel
  • class ParRange extends ParSeq[Int] with Serializable

    Parallel ranges.

    Parallel ranges.

    This is a base trait for Scala parallel collections. It defines behaviour common to all parallel collections. Concrete parallel collections should inherit this trait and ParIterable if they want to define specific combiner factories.

    Parallel operations are implemented with divide and conquer style algorithms that parallelize well. The basic idea is to split the collection into smaller parts until they are small enough to be operated on sequentially.

    All of the parallel operations are implemented as tasks within this trait. Tasks rely on the concept of splitters, which extend iterators. Every parallel collection defines:

    def splitter: IterableSplitter[T]

    which returns an instance of IterableSplitter[T], which is a subtype of Splitter[T]. Splitters have a method remaining to check the remaining number of elements, and method split which is defined by splitters. Method split divides the splitters iterate over into disjunct subsets:

    def split: Seq[Splitter]

    which splits the splitter into a sequence of disjunct subsplitters. This is typically a very fast operation which simply creates wrappers around the receiver collection. This can be repeated recursively.

    Tasks are scheduled for execution through a scala.collection.parallel.TaskSupport object, which can be changed through the tasksupport setter of the collection.

    Method newCombiner produces a new combiner. Combiners are an extension of builders. They provide a method combine which combines two combiners and returns a combiner containing elements of both combiners. This method can be implemented by aggressively copying all the elements into the new combiner or by lazily binding their results. It is recommended to avoid copying all of the elements for performance reasons, although that cost might be negligible depending on the use case. Standard parallel collection combiners avoid copying when merging results, relying either on a two-step lazy construction or specific data-structure properties.

    Methods:

    def seq: Sequential
    def par: Repr

    produce the sequential or parallel implementation of the collection, respectively. Method par just returns a reference to this parallel collection. Method seq is efficient - it will not copy the elements. Instead, it will create a sequential version of the collection using the same underlying data structure. Note that this is not the case for sequential collections in general - they may copy the elements and produce a different underlying data structure.

    The combination of methods toMap, toSeq or toSet along with par and seq is a flexible way to change between different collection types.

    Since this trait extends the GenIterable trait, methods like size must also be implemented in concrete collections, while iterator forwards to splitter by default.

    Each parallel collection is bound to a specific fork/join pool, on which dormant worker threads are kept. The fork/join pool contains other information such as the parallelism level, that is, the number of processors used. When a collection is created, it is assigned the default fork/join pool found in the scala.parallel package object.

    Parallel collections are not necessarily ordered in terms of the foreach operation (see Traversable). Parallel sequences have a well defined order for iterators - creating an iterator and traversing the elements linearly will always yield the same order. However, bulk operations such as foreach, map or filter always occur in undefined orders for all parallel collections.

    Existing parallel collection implementations provide strict parallel iterators. Strict parallel iterators are aware of the number of elements they have yet to traverse. It's also possible to provide non-strict parallel iterators, which do not know the number of elements remaining. To do this, the new collection implementation must override isStrictSplitterCollection to false. This will make some operations unavailable.

    To create a new parallel collection, extend the ParIterable trait, and implement size, splitter, newCombiner and seq. Having an implicit combiner factory requires extending this trait in addition, as well as providing a companion object, as with regular collections.

    Method size is implemented as a constant time operation for parallel collections, and parallel collection operations rely on this assumption.

    The higher-order functions passed to certain operations may contain side-effects. Since implementations of bulk operations may not be sequential, this means that side-effects may not be predictable and may produce data-races, deadlocks or invalidation of state if care is not taken. It is up to the programmer to either avoid using side-effects or to use some form of synchronization when accessing mutable data.

    Definition Classes
    immutable
    Annotations
    @SerialVersionUID()
    See also

    Scala's Parallel Collections Library overview section on ParRange for more information.

  • Accessor
  • Aggregate
  • BuilderOps
  • Collect
  • Composite
  • Copy
  • CopyToArray
  • Corresponds
  • Count
  • CreateScanTree
  • Drop
  • Elements
  • Exists
  • Filter
  • FilterNot
  • Find
  • FlatMap
  • Fold
  • Forall
  • Foreach
  • FromScanTree
  • GroupBy
  • IndexWhere
  • LastIndexWhere
  • Map
  • Max
  • Min
  • NonDivisible
  • NonDivisibleTask
  • ParComposite
  • ParRangeIterator
  • ParSeqLikeAccessor
  • ParSeqLikeTransformer
  • ParSeqLikeZip
  • Partition
  • Product
  • Reduce
  • ResultMapping
  • Reverse
  • ReverseMap
  • SameElements
  • ScanLeaf
  • ScanNode
  • ScanTree
  • SegmentLength
  • SeqComposite
  • SignallingOps
  • Slice
  • Span
  • SplitAt
  • StrictSplitterCheckTask
  • Sum
  • Take
  • TakeWhile
  • TaskOps
  • ToParCollection
  • ToParMap
  • Transformer
  • Updated
  • Zip
  • ZipAll

class ParRangeIterator extends SeqSplitter[Int]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParRangeIterator
  2. SeqSplitter
  3. PreciseSplitter
  4. AugmentedSeqIterator
  5. IterableSplitter
  6. DelegatedSignalling
  7. Signalling
  8. Splitter
  9. AugmentedIterableIterator
  10. RemainsIterator
  11. Iterator
  12. IterableOnceOps
  13. IterableOnce
  14. AnyRef
  15. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ParRangeIterator(range: immutable.Range = self.range)

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 Patched[U >: T] extends SeqSplitter[U]
    Definition Classes
    SeqSplitter
  7. class RemainsIteratorAppended[U >: T, PI <: SeqSplitter[U]] extends Appended[U, PI] with SeqSplitter[U]
    Definition Classes
    SeqSplitter
  8. class RemainsIteratorMapped[S] extends Mapped[S] with SeqSplitter[S]
    Definition Classes
    SeqSplitter
  9. class RemainsIteratorTaken extends Taken with SeqSplitter[T]
    Definition Classes
    SeqSplitter
  10. class RemainsIteratorZipped[S] extends Zipped[S] with SeqSplitter[(T, S)]
    Definition Classes
    SeqSplitter
  11. class RemainsIteratorZippedAll[U >: T, S] extends ZippedAll[U, S] with SeqSplitter[(U, S)]
    Definition Classes
    SeqSplitter
  12. 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 >: Int](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
    DelegatedSignallingSignalling
  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 >: Int, PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    IterableSplitter
  10. def appendParSeq[U >: Int, PI <: SeqSplitter[U]](that: PI): RemainsIteratorAppended[U, PI]
    Definition Classes
    SeqSplitter
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def buffered: BufferedIterator[Int]
    Definition Classes
    Iterator
  13. def buildString(closure: ((String) => Unit) => Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  14. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  15. def collect[B](pf: PartialFunction[Int, B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  16. def collect2combiner[S, That](pf: PartialFunction[Int, S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  17. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
    Definition Classes
    IterableOnceOps
  18. def concat[B >: Int](xs: => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  19. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  20. def copy2builder[U >: Int, Coll, Bld <: Builder[U, Coll]](b: Bld): Bld
    Definition Classes
    AugmentedIterableIterator
  21. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  22. def copyToArray[B >: Int](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  23. def copyToArray[B >: Int](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  24. def corresponds[S](corr: (Int, S) => Boolean)(that: scala.Iterator[S]): Boolean
    Definition Classes
    AugmentedSeqIterator
  25. def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  26. def count(p: (Int) => Boolean): Int
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  27. def distinct: Iterator[Int]
    Definition Classes
    Iterator
  28. def distinctBy[B](f: (Int) => B): Iterator[Int]
    Definition Classes
    Iterator
  29. def drop(n: Int): IterableSplitter[Int]

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

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

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    ParRangeIteratorSeqSplitterIterableSplitter
  33. def duplicate: (Iterator[Int], Iterator[Int])
    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: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def filter(p: (Int) => Boolean): Iterator[Int]
    Definition Classes
    Iterator → IterableOnceOps
  38. def filter2combiner[U >: Int, This](pred: (Int) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  39. def filterNot(p: (Int) => Boolean): Iterator[Int]
    Definition Classes
    Iterator → IterableOnceOps
  40. def filterNot2combiner[U >: Int, This](pred: (Int) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  41. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  42. def find(p: (Int) => Boolean): Option[Int]
    Definition Classes
    IterableOnceOps
  43. def flatMap[B](f: (Int) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  44. def flatmap2combiner[S, That](f: (Int) => scala.IterableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  45. def flatten[B](implicit ev: (Int) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  46. def fold[U >: Int](z: U)(op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  47. def foldLeft[B](z: B)(op: (B, Int) => B): B
    Definition Classes
    IterableOnceOps
  48. def foldRight[B](z: B)(op: (Int, B) => B): B
    Definition Classes
    IterableOnceOps
  49. def forall(p: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  50. def foreach[U](f: (Int) => U): Unit
    Definition Classes
    ParRangeIterator → IterableOnceOps
  51. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  52. def grouped[B >: Int](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  53. final def hasNext: Boolean
    Definition Classes
    ParRangeIterator → 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
    DelegatedSignallingSignalling
  56. def indexOf[B >: Int](elem: B, from: Int): Int
    Definition Classes
    Iterator
  57. def indexOf[B >: Int](elem: B): Int
    Definition Classes
    Iterator
  58. def indexWhere(pred: (Int) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  59. def indexWhere(p: (Int) => 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
    DelegatedSignallingSignalling
  61. def isEmpty: Boolean
    Definition Classes
    Iterator → IterableOnceOps
    Annotations
    @deprecatedOverriding()
  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[Int]
    Definition Classes
    Iterator → IterableOnce
    Annotations
    @inline()
  66. def knownSize: Int
    Definition Classes
    IterableOnce
  67. def lastIndexWhere(pred: (Int) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  68. final def length: Int
    Definition Classes
    Iterator
    Annotations
    @inline()
  69. def map[S](f: (Int) => S): SeqSplitter[S]
    Definition Classes
    SeqSplitterIterableSplitter → Iterator → IterableOnceOps
  70. def map2combiner[S, That](f: (Int) => S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    ParRangeIterator → AugmentedIterableIterator
  71. def max[U >: Int](implicit ord: Ordering[U]): Int
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  72. def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  73. def maxByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  74. def maxOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  75. def min[U >: Int](implicit ord: Ordering[U]): Int
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  76. def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  77. def minByOption[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  78. def minOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]
    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. final def next(): Int
    Definition Classes
    ParRangeIterator → Iterator
  84. def nextOption(): Option[Int]
    Definition Classes
    Iterator
  85. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  86. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  87. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. def padTo[B >: Int](len: Int, elem: B): Iterator[B]
    Definition Classes
    Iterator
  89. def partition(p: (Int) => Boolean): (Iterator[Int], Iterator[Int])
    Definition Classes
    Iterator
  90. def partition2combiners[U >: Int, This](pred: (Int) => Boolean, btrue: Combiner[U, This], bfalse: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  91. def patch[B >: Int](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  92. def patchParSeq[U >: Int](from: Int, patchElems: SeqSplitter[U], replaced: Int): Patched[U]
    Definition Classes
    SeqSplitter
  93. def prefixLength(pred: (Int) => Boolean): Int
    Definition Classes
    AugmentedSeqIterator
  94. def product[U >: Int](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  95. def psplit(sizes: Int*): immutable.Seq[ParRangeIterator]

    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
    ParRangeIteratorSeqSplitterPreciseSplitter
  96. def psplitWithSignalling(sizes: Int*): scala.Seq[SeqSplitter[Int]]
    Definition Classes
    SeqSplitter
  97. def reduce[U >: Int](op: (U, U) => U): U
    Definition Classes
    ParRangeIterator → AugmentedIterableIterator → IterableOnceOps
  98. def reduceLeft[U >: Int](howmany: Int, op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator
  99. def reduceLeft[B >: Int](op: (B, Int) => B): B
    Definition Classes
    IterableOnceOps
  100. def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
    Definition Classes
    IterableOnceOps
  101. def reduceOption[B >: Int](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def reduceRight[B >: Int](op: (Int, B) => B): B
    Definition Classes
    IterableOnceOps
  103. def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  104. final def remaining: Int

    The number of elements this iterator has yet to traverse.

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

    returns

    an exact number of elements this iterator has yet to iterate

    Definition Classes
    ParRangeIteratorSeqSplitter → AugmentedSeqIterator → IterableSplitter → RemainsIterator
  105. def reverse: SeqSplitter[Int]
    Definition Classes
    SeqSplitter
  106. def reverse2combiner[U >: Int, This](cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedSeqIterator
  107. def reverseMap2combiner[S, That](f: (Int) => S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedSeqIterator
  108. def reversed: Iterable[Int]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  109. def sameElements[B >: Int](that: IterableOnce[B]): Boolean
    Definition Classes
    Iterator
  110. def scanLeft[B](z: B)(op: (B, Int) => B): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  111. def scanToArray[U >: Int, A >: U](z: U, op: (U, U) => U, array: Array[A], from: Int): Unit
    Definition Classes
    AugmentedIterableIterator
  112. def scanToCombiner[U >: Int, That](howmany: Int, startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  113. def scanToCombiner[U >: Int, 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
    DelegatedSignallingSignalling
  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
    DelegatedSignallingSignalling
  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
    DelegatedSignallingSignalling
  117. def shouldSplitFurther[S](coll: parallel.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
    IterableSplitterDelegatedSignalling
  119. def size: Int
    Definition Classes
    IterableOnceOps
  120. def slice(from1: Int, until1: Int): SeqSplitter[Int]
    Definition Classes
    SeqSplitterIterableSplitter → Iterator → IterableOnceOps
  121. def slice2combiner[U >: Int, This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  122. def sliceIterator(from: Int, until: Int): Iterator[Int]
    Attributes
    protected
    Definition Classes
    Iterator
  123. def sliding[B >: Int](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  124. def span(p: (Int) => Boolean): (Iterator[Int], Iterator[Int])
    Definition Classes
    Iterator → IterableOnceOps
  125. def span2combiners[U >: Int, This](p: (Int) => Boolean, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  126. def split: scala.Seq[SeqSplitter[Int]]

    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
    ParRangeIteratorSeqSplitterPreciseSplitterIterableSplitterSplitter
  127. def splitAt(n: Int): (Iterator[Int], Iterator[Int])
    Definition Classes
    IterableOnceOps
  128. def splitAt2combiners[U >: Int, 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[Int]]
    Definition Classes
    SeqSplitterIterableSplitter
  130. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S
    Definition Classes
    IterableOnce
  131. def sum[U >: Int](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
    DelegatedSignallingSignalling
  134. def take(n: Int): SeqSplitter[Int]
    Definition Classes
    SeqSplitterIterableSplitter → Iterator → IterableOnceOps
  135. def take2combiner[U >: Int, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  136. def takeWhile(p: (Int) => Boolean): Iterator[Int]
    Definition Classes
    Iterator → IterableOnceOps
  137. def takeWhile2combiner[U >: Int, This](p: (Int) => Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  138. def tapEach[U](f: (Int) => U): Iterator[Int]
    Definition Classes
    Iterator → IterableOnceOps
  139. def to[C1](factory: Factory[Int, C1]): C1
    Definition Classes
    IterableOnceOps
  140. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  141. final def toBuffer[B >: Int]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  142. def toIndexedSeq: immutable.IndexedSeq[Int]
    Definition Classes
    IterableOnceOps
  143. def toList: immutable.List[Int]
    Definition Classes
    IterableOnceOps
  144. def toMap[K, V](implicit ev: <:<[Int, (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  145. def toSeq: immutable.Seq[Int]
    Definition Classes
    IterableOnceOps
  146. def toSet[B >: Int]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  147. def toString(): String
    Definition Classes
    ParRangeIterator → Iterator → AnyRef → Any
  148. def toVector: immutable.Vector[Int]
    Definition Classes
    IterableOnceOps
  149. def updated2combiner[U >: Int, That](index: Int, elem: U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedSeqIterator
  150. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  151. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  152. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  153. def withFilter(p: (Int) => Boolean): Iterator[Int]
    Definition Classes
    Iterator
  154. def zip[B](that: IterableOnce[B]): Iterator[(Int, B)]
    Definition Classes
    Iterator
  155. def zip2combiner[U >: Int, S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  156. def zipAll[A1 >: Int, B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
    Definition Classes
    Iterator
  157. def zipAll2combiner[U >: Int, S, That](that: RemainsIterator[S], thiselem: U, thatelem: S, cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  158. def zipAllParSeq[S, U >: Int, R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): RemainsIteratorZippedAll[U, R]
    Definition Classes
    SeqSplitterIterableSplitter
  159. def zipParSeq[S](that: SeqSplitter[S]): SeqSplitter[(Int, S)]
    Definition Classes
    SeqSplitterIterableSplitter
  160. def zipWithIndex: Iterator[(Int, Int)]
    Definition Classes
    Iterator → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, Int) => 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: (Int, 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, Int) => 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 >: Int](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: (Int, B) => B): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @deprecated
    Deprecated

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

  7. def seq: ParRangeIterator.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[Int]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

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

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

Inherited from SeqSplitter[Int]

Inherited from PreciseSplitter[Int]

Inherited from AugmentedSeqIterator[Int]

Inherited from IterableSplitter[Int]

Inherited from DelegatedSignalling

Inherited from Signalling

Inherited from Splitter[Int]

Inherited from AugmentedIterableIterator[Int]

Inherited from RemainsIterator[Int]

Inherited from Iterator[Int]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped