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 mutable
    Definition Classes
    parallel
  • trait ParHashTable[K, V, Entry >: Null <: HashEntry[K, Entry]] extends HashTable[K, V, Entry] with WithContents[K, V, Entry]

    Provides functionality for hash tables with linked list buckets, enriching the data structure by fulfilling certain requirements for their parallel construction and iteration.

    Provides functionality for hash tables with linked list buckets, enriching the data structure by fulfilling certain requirements for their parallel construction and iteration.

    Definition Classes
    mutable
  • EntryIterator

abstract class EntryIterator[T, +IterRepr <: IterableSplitter[T]] extends IterableSplitter[T] with SizeMapUtils

A parallel iterator returning all the entries.

Linear Supertypes
SizeMapUtils, IterableSplitter[T], DelegatedSignalling, Signalling, Splitter[T], AugmentedIterableIterator[T], RemainsIterator[T], Iterator[T], IterableOnceOps[T, Iterator, Iterator[T]], IterableOnce[T], AnyRef, Any
Known Subclasses
ParHashMapIterator
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EntryIterator
  2. SizeMapUtils
  3. IterableSplitter
  4. DelegatedSignalling
  5. Signalling
  6. Splitter
  7. AugmentedIterableIterator
  8. RemainsIterator
  9. Iterator
  10. IterableOnceOps
  11. IterableOnce
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EntryIterator(idx: Int, until: Int, totalsize: Int, es: Entry)

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[immutable.Seq[B]]
    Definition Classes
    Iterator

Abstract Value Members

  1. abstract def entry2item(e: Entry): T
  2. abstract def newIterator(idxFrom: Int, idxUntil: Int, totalSize: Int, es: Entry): IterRepr

Concrete Value Members

  1. final def ++[B >: T](xs: => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @inline()
  2. 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
  3. final def addString(b: mutable.StringBuilder): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  4. final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  5. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
  6. def appendParIterable[U >: T, PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    IterableSplitter
  7. def buffered: BufferedIterator[T]
    Definition Classes
    Iterator
  8. def collect[B](pf: PartialFunction[T, B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  9. def collect2combiner[S, That](pf: PartialFunction[T, S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  10. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    IterableOnceOps
  11. def concat[B >: T](xs: => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  12. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  13. def copy2builder[U >: T, Coll, Bld <: Builder[U, Coll]](b: Bld): Bld
    Definition Classes
    AugmentedIterableIterator
  14. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  15. def copyToArray[B >: T](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  16. def copyToArray[B >: T](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  17. def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  18. def count(p: (T) => Boolean): Int
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  19. def distinct: Iterator[T]
    Definition Classes
    Iterator
  20. def distinctBy[B](f: (T) => B): Iterator[T]
    Definition Classes
    Iterator
  21. def drop(n: Int): IterableSplitter[T]

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

    Definition Classes
    IterableSplitter → Iterator → IterableOnceOps
  22. def drop2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  23. def dropWhile(p: (T) => Boolean): Iterator[T]
    Definition Classes
    Iterator → IterableOnceOps
  24. def dup: IterRepr

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    EntryIterator → IterableSplitter
  25. def duplicate: (Iterator[T], Iterator[T])
    Definition Classes
    Iterator
  26. def exists(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  27. def filter(p: (T) => Boolean): Iterator[T]
    Definition Classes
    Iterator → IterableOnceOps
  28. def filter2combiner[U >: T, This](pred: (T) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  29. def filterNot(p: (T) => Boolean): Iterator[T]
    Definition Classes
    Iterator → IterableOnceOps
  30. def filterNot2combiner[U >: T, This](pred: (T) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  31. def find(p: (T) => Boolean): Option[T]
    Definition Classes
    IterableOnceOps
  32. def flatMap[B](f: (T) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  33. def flatmap2combiner[S, That](f: (T) => scala.IterableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  34. def flatten[B](implicit ev: (T) => IterableOnce[B]): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  35. def fold[U >: T](z: U)(op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  36. def foldLeft[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  37. def foldRight[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  38. def forall(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  39. def foreach[U](f: (T) => U): Unit
    Definition Classes
    IterableOnceOps
  40. def grouped[B >: T](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  41. def hasNext: Boolean
    Definition Classes
    EntryIterator → Iterator
  42. 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
  43. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    Iterator
  44. def indexOf[B >: T](elem: B): Int
    Definition Classes
    Iterator
  45. def indexWhere(p: (T) => Boolean, from: Int): Int
    Definition Classes
    Iterator
  46. 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
  47. def isEmpty: Boolean
    Definition Classes
    Iterator → IterableOnceOps
    Annotations
    @deprecatedOverriding("isEmpty is defined as !hasNext; override hasNext instead", "2.13.0")
  48. 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
  49. def isTraversableAgain: Boolean
    Definition Classes
    IterableOnceOps
  50. final def iterator: Iterator[T]
    Definition Classes
    Iterator → IterableOnce
    Annotations
    @inline()
  51. def knownSize: Int
    Definition Classes
    IterableOnce
  52. final def length: Int
    Definition Classes
    Iterator
    Annotations
    @inline()
  53. def map[S](f: (T) => S): Mapped[S]
    Definition Classes
    IterableSplitter → Iterator → IterableOnceOps
  54. def map2combiner[S, That](f: (T) => S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  55. def max[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  56. def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
    Definition Classes
    IterableOnceOps
  57. def maxByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  58. def maxOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  59. def min[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  60. def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
    Definition Classes
    IterableOnceOps
  61. def minByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  62. def minOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  63. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  64. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  65. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  66. def next(): T
    Definition Classes
    EntryIterator → Iterator
  67. def nextOption(): Option[T]
    Definition Classes
    Iterator
  68. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  69. def padTo[B >: T](len: Int, elem: B): Iterator[B]
    Definition Classes
    Iterator
  70. def partition(p: (T) => Boolean): (Iterator[T], Iterator[T])
    Definition Classes
    Iterator
  71. 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
  72. def patch[B >: T](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  73. def product[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  74. def reduce[U >: T](op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  75. def reduceLeft[U >: T](howmany: Int, op: (U, U) => U): U
    Definition Classes
    AugmentedIterableIterator
  76. def reduceLeft[B >: T](op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  77. def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
    Definition Classes
    IterableOnceOps
  78. def reduceOption[B >: T](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  79. def reduceRight[B >: T](op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  80. def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  81. 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
    EntryIterator → IterableSplitter → RemainsIterator
  82. def sameElements[B >: T](that: IterableOnce[B]): Boolean
    Definition Classes
    Iterator
  83. def scan(): Unit
  84. def scanLeft[B](z: B)(op: (B, T) => B): Iterator[B]
    Definition Classes
    Iterator → IterableOnceOps
  85. def scanToArray[U >: T, A >: U](z: U, op: (U, U) => U, array: Array[A], from: Int): Unit
    Definition Classes
    AugmentedIterableIterator
  86. def scanToCombiner[U >: T, That](howmany: Int, startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  87. def scanToCombiner[U >: T, That](startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  88. 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
  89. 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
  90. 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
  91. def shouldSplitFurther[S](coll: parallel.ParIterable[S], parallelismLevel: Int): Boolean
    Definition Classes
    IterableSplitter
  92. val signalDelegate: Signalling

    A delegate that method calls are redirected to.

    A delegate that method calls are redirected to.

    Definition Classes
    IterableSplitter → DelegatedSignalling
  93. def size: Int
    Definition Classes
    IterableOnceOps
  94. def slice(from1: Int, until1: Int): IterableSplitter[T]
    Definition Classes
    IterableSplitter → Iterator → IterableOnceOps
  95. def slice2combiner[U >: T, This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  96. def sliding[B >: T](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  97. def span(p: (T) => Boolean): (Iterator[T], Iterator[T])
    Definition Classes
    Iterator → IterableOnceOps
  98. 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
  99. 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
    EntryIterator → IterableSplitter → Splitter
  100. def splitAt(n: Int): (Iterator[T], Iterator[T])
    Definition Classes
    IterableOnceOps
  101. def splitAt2combiners[U >: T, This](at: Int, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  102. def splitWithSignalling: scala.Seq[IterableSplitter[T]]
    Definition Classes
    IterableSplitter
  103. def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
    Definition Classes
    IterableOnce
  104. def sum[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → IterableOnceOps
  105. 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
  106. def take(n: Int): IterableSplitter[T]
    Definition Classes
    IterableSplitter → Iterator → IterableOnceOps
  107. def take2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  108. def takeWhile(p: (T) => Boolean): Iterator[T]
    Definition Classes
    Iterator → IterableOnceOps
  109. def takeWhile2combiner[U >: T, This](p: (T) => Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  110. def tapEach[U](f: (T) => U): Iterator[T]
    Definition Classes
    Iterator → IterableOnceOps
  111. def to[C1](factory: Factory[T, C1]): C1
    Definition Classes
    IterableOnceOps
  112. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  113. final def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  114. def toIndexedSeq: immutable.IndexedSeq[T]
    Definition Classes
    IterableOnceOps
  115. def toList: immutable.List[T]
    Definition Classes
    IterableOnceOps
  116. def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  117. def toSeq: immutable.Seq[T]
    Definition Classes
    IterableOnceOps
  118. def toSet[B >: T]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  119. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  120. def toVector: immutable.Vector[T]
    Definition Classes
    IterableOnceOps
  121. def withFilter(p: (T) => Boolean): Iterator[T]
    Definition Classes
    Iterator
  122. def zip[B](that: IterableOnce[B]): Iterator[(T, B)]
    Definition Classes
    Iterator
  123. def zip2combiner[U >: T, S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  124. def zipAll[A1 >: T, B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
    Definition Classes
    Iterator
  125. 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
  126. def zipAllParSeq[S, U >: T, R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
    Definition Classes
    IterableSplitter
  127. def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
    Definition Classes
    IterableSplitter
  128. def zipWithIndex: Iterator[(T, Int)]
    Definition Classes
    Iterator → IterableOnceOps

Deprecated Value Members

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

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

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

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

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

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