abstract class ParFlatHashTableIterator extends IterableSplitter[T] with SizeMapUtils
- Alphabetic
- By Inheritance
- ParFlatHashTableIterator
- SizeMapUtils
- IterableSplitter
- DelegatedSignalling
- Signalling
- Splitter
- AugmentedIterableIterator
- RemainsIterator
- Iterator
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ParFlatHashTableIterator(idx: Int, until: Int, totalsize: Int)
Type Members
- class Appended[U >: T, PI <: IterableSplitter[U]] extends IterableSplitter[U]
- Definition Classes
- IterableSplitter
- class Mapped[S] extends IterableSplitter[S]
- Definition Classes
- IterableSplitter
- class Taken extends IterableSplitter[T]
- Definition Classes
- IterableSplitter
- class Zipped[S] extends IterableSplitter[(T, S)]
- Definition Classes
- IterableSplitter
- class ZippedAll[U >: T, S] extends IterableSplitter[(U, S)]
- Definition Classes
- IterableSplitter
- class GroupedIterator[B >: A] extends AbstractIterator[immutable.Seq[B]]
- Definition Classes
- Iterator
Abstract Value Members
- abstract def newIterator(index: Int, until: Int, totalsize: Int): IterableSplitter[T]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: T](xs: => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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
andexists
methods.- Definition Classes
- DelegatedSignalling → Signalling
- final def addString(b: mutable.StringBuilder): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- def appendParIterable[U >: T, PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
- Definition Classes
- IterableSplitter
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def buffered: BufferedIterator[T]
- Definition Classes
- Iterator
- def buildString(closure: ((String) => Unit) => Unit): String
- Attributes
- protected
- Definition Classes
- IterableSplitter
- def calcNumElems(from: Int, until: Int, tableLength: Int, sizeMapBucketSize: Int): Int
- Attributes
- protected
- Definition Classes
- SizeMapUtils
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def collect[B](pf: PartialFunction[T, B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def collect2combiner[S, That](pf: PartialFunction[T, S], cb: Combiner[S, That]): Combiner[S, That]
- Definition Classes
- AugmentedIterableIterator
- def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: T](xs: => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
- def contains(elem: Any): Boolean
- Definition Classes
- Iterator
- def copy2builder[U >: T, Coll, Bld <: Builder[U, Coll]](b: Bld): Bld
- Definition Classes
- AugmentedIterableIterator
- def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: T](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: T](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (T) => Boolean): Int
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def countBucketSizes(frombucket: Int, untilbucket: Int): Int
- Attributes
- protected
- Definition Classes
- ParFlatHashTableIterator → SizeMapUtils
- def countElems(from: Int, until: Int): Int
- Attributes
- protected
- Definition Classes
- ParFlatHashTableIterator → SizeMapUtils
- def debugInformation: String
- Definition Classes
- ParFlatHashTableIterator → IterableSplitter
- def distinct: Iterator[T]
- Definition Classes
- Iterator
- def distinctBy[B](f: (T) => B): Iterator[T]
- Definition Classes
- Iterator
- def drop(n: Int): IterableSplitter[T]
Drop implemented as simple eager consumption.
Drop implemented as simple eager consumption.
- Definition Classes
- IterableSplitter → Iterator → IterableOnceOps
- def drop2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
- Definition Classes
- AugmentedIterableIterator
- def dropWhile(p: (T) => Boolean): Iterator[T]
- Definition Classes
- Iterator → IterableOnceOps
- def dup: IterableSplitter[T]
Creates a copy of this iterator.
Creates a copy of this iterator.
- Definition Classes
- ParFlatHashTableIterator → IterableSplitter
- def duplicate: (Iterator[T], Iterator[T])
- Definition Classes
- Iterator
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def exists(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(p: (T) => Boolean): Iterator[T]
- Definition Classes
- Iterator → IterableOnceOps
- def filter2combiner[U >: T, This](pred: (T) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
- Definition Classes
- AugmentedIterableIterator
- def filterNot(p: (T) => Boolean): Iterator[T]
- Definition Classes
- Iterator → IterableOnceOps
- def filterNot2combiner[U >: T, This](pred: (T) => Boolean, cb: Combiner[U, This]): Combiner[U, This]
- Definition Classes
- AugmentedIterableIterator
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: (T) => Boolean): Option[T]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: (T) => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def flatmap2combiner[S, That](f: (T) => scala.IterableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
- Definition Classes
- AugmentedIterableIterator
- def flatten[B](implicit ev: (T) => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def fold[U >: T](z: U)(op: (U, U) => U): U
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def foldLeft[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (T) => U): Unit
- Definition Classes
- IterableOnceOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def grouped[B >: T](size: Int): GroupedIterator[B]
- Definition Classes
- Iterator
- def hasNext: Boolean
- Definition Classes
- ParFlatHashTableIterator → Iterator
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- var idx: Int
- 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 aretakeWhile
,dropWhile
,span
andindexOf
.- returns
the value of the index flag
- Definition Classes
- DelegatedSignalling → Signalling
- def indexOf[B >: T](elem: B, from: Int): Int
- Definition Classes
- Iterator
- def indexOf[B >: T](elem: B): Int
- Definition Classes
- Iterator
- def indexWhere(p: (T) => Boolean, from: Int): Int
- Definition Classes
- Iterator
- 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
andexists
methods.- returns
the state of the abort
- Definition Classes
- DelegatedSignalling → Signalling
- def isEmpty: Boolean
- Definition Classes
- Iterator → IterableOnceOps
- Annotations
- @deprecatedOverriding("isEmpty is defined as !hasNext; override hasNext instead", "2.13.0")
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOnceOps
- final def iterator: Iterator[T]
- Definition Classes
- Iterator → IterableOnce
- Annotations
- @inline()
- def knownSize: Int
- Definition Classes
- IterableOnce
- final def length: Int
- Definition Classes
- Iterator
- Annotations
- @inline()
- def map[S](f: (T) => S): Mapped[S]
- Definition Classes
- IterableSplitter → Iterator → IterableOnceOps
- def map2combiner[S, That](f: (T) => S, cb: Combiner[S, That]): Combiner[S, That]
- Definition Classes
- AugmentedIterableIterator
- def max[U >: T](implicit ord: Ordering[U]): T
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def min[U >: T](implicit ord: Ordering[U]): T
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def minOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def next(): T
- Definition Classes
- ParFlatHashTableIterator → Iterator
- def nextOption(): Option[T]
- Definition Classes
- Iterator
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def padTo[B >: T](len: Int, elem: B): Iterator[B]
- Definition Classes
- Iterator
- def partition(p: (T) => Boolean): (Iterator[T], Iterator[T])
- Definition Classes
- Iterator
- 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
- def patch[B >: T](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
- Definition Classes
- Iterator
- def product[U >: T](implicit num: Numeric[U]): U
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def reduce[U >: T](op: (U, U) => U): U
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- def reduceLeft[U >: T](howmany: Int, op: (U, U) => U): U
- Definition Classes
- AugmentedIterableIterator
- def reduceLeft[B >: T](op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: T](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: T](op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- 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 methodstake
,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
- ParFlatHashTableIterator → IterableSplitter → RemainsIterator
- def reversed: Iterable[T]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def sameElements[B >: T](that: IterableOnce[B]): Boolean
- Definition Classes
- Iterator
- def scanLeft[B](z: B)(op: (B, T) => B): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def scanToArray[U >: T, A >: U](z: U, op: (U, U) => U, array: Array[A], from: Int): Unit
- Definition Classes
- AugmentedIterableIterator
- def scanToCombiner[U >: T, That](howmany: Int, startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
- Definition Classes
- AugmentedIterableIterator
- def scanToCombiner[U >: T, That](startValue: U, op: (U, U) => U, cb: Combiner[U, That]): Combiner[U, That]
- Definition Classes
- AugmentedIterableIterator
- 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 aretakeWhile
,dropWhile
,span
andindexOf
.- f
the value to which the index flag is set.
- Definition Classes
- DelegatedSignalling → Signalling
- 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 aretakeWhile
,dropWhile
,span
andindexOf
.- f
the value to which the index flag is set
- Definition Classes
- DelegatedSignalling → Signalling
- 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 aretakeWhile
,dropWhile
,span
andindexOf
.- f
the value to which the index flag is set
- Definition Classes
- DelegatedSignalling → Signalling
- def shouldSplitFurther[S](coll: parallel.ParIterable[S], parallelismLevel: Int): Boolean
- Definition Classes
- IterableSplitter
- val signalDelegate: Signalling
A delegate that method calls are redirected to.
A delegate that method calls are redirected to.
- Definition Classes
- IterableSplitter → DelegatedSignalling
- def size: Int
- Definition Classes
- IterableOnceOps
- def slice(from1: Int, until1: Int): IterableSplitter[T]
- Definition Classes
- IterableSplitter → Iterator → IterableOnceOps
- def slice2combiner[U >: T, This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
- Definition Classes
- AugmentedIterableIterator
- def sliceIterator(from: Int, until: Int): Iterator[T]
- Attributes
- protected
- Definition Classes
- Iterator
- def sliding[B >: T](size: Int, step: Int): GroupedIterator[B]
- Definition Classes
- Iterator
- def span(p: (T) => Boolean): (Iterator[T], Iterator[T])
- Definition Classes
- Iterator → IterableOnceOps
- 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
- 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
- ParFlatHashTableIterator → IterableSplitter → Splitter
- def splitAt(n: Int): (Iterator[T], Iterator[T])
- Definition Classes
- IterableOnceOps
- def splitAt2combiners[U >: T, This](at: Int, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
- Definition Classes
- AugmentedIterableIterator
- def splitWithSignalling: scala.Seq[IterableSplitter[T]]
- Definition Classes
- IterableSplitter
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
- Definition Classes
- IterableOnce
- def sum[U >: T](implicit num: Numeric[U]): U
- Definition Classes
- AugmentedIterableIterator → IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- def take(n: Int): IterableSplitter[T]
- Definition Classes
- IterableSplitter → Iterator → IterableOnceOps
- def take2combiner[U >: T, This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
- Definition Classes
- AugmentedIterableIterator
- def takeWhile(p: (T) => Boolean): Iterator[T]
- Definition Classes
- Iterator → IterableOnceOps
- def takeWhile2combiner[U >: T, This](p: (T) => Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
- Definition Classes
- AugmentedIterableIterator
- def tapEach[U](f: (T) => U): Iterator[T]
- Definition Classes
- Iterator → IterableOnceOps
- def to[C1](factory: Factory[T, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: T]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: immutable.IndexedSeq[T]
- Definition Classes
- IterableOnceOps
- def toList: immutable.List[T]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: immutable.Seq[T]
- Definition Classes
- IterableOnceOps
- def toSet[B >: T]: immutable.Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Iterator → AnyRef → Any
- def toVector: immutable.Vector[T]
- Definition Classes
- IterableOnceOps
- val totalsize: Int
- val until: Int
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def withFilter(p: (T) => Boolean): Iterator[T]
- Definition Classes
- Iterator
- def zip[B](that: IterableOnce[B]): Iterator[(T, B)]
- Definition Classes
- Iterator
- def zip2combiner[U >: T, S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
- Definition Classes
- AugmentedIterableIterator
- def zipAll[A1 >: T, B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
- Definition Classes
- Iterator
- 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
- def zipAllParSeq[S, U >: T, R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
- Definition Classes
- IterableSplitter
- def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
- Definition Classes
- IterableSplitter
- def zipWithIndex: Iterator[(T, Int)]
- Definition Classes
- Iterator → IterableOnceOps
Deprecated Value Members
- 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 /:
- 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 :\
- 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. UsefoldLeft(z)(seqop)
instead.
- 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
- 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
- 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.
- def seq: ParFlatHashTableIterator.this.type
- Definition Classes
- Iterator
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterator.seq always returns the iterator itself
- final def toIterator: Iterator[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: immutable.Stream[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream