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 ParHashSet [T] extends ParSet[T] with GenericParTemplate[T, ParHashSet] with ParSetLike[T, ParHashSet[T], HashSet[T]] with Serializable

    Immutable parallel hash set, based on hash tries.

    Immutable parallel hash set, based on hash tries.

    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.

    T

    the element type of the set

    Definition Classes
    immutable
    Annotations
    @SerialVersionUID()
    Since

    2.9

    See also

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

  • Accessor
  • Aggregate
  • BuilderOps
  • Collect
  • Composite
  • Copy
  • CopyToArray
  • Count
  • CreateScanTree
  • Drop
  • Exists
  • Filter
  • FilterNot
  • Find
  • FlatMap
  • Fold
  • Forall
  • Foreach
  • FromScanTree
  • GroupBy
  • Map
  • Max
  • Min
  • NonDivisible
  • NonDivisibleTask
  • ParComposite
  • ParHashSetIterator
  • Partition
  • Product
  • Reduce
  • ResultMapping
  • ScanLeaf
  • ScanNode
  • ScanTree
  • SeqComposite
  • SignallingOps
  • Slice
  • Span
  • SplitAt
  • StrictSplitterCheckTask
  • Sum
  • Take
  • TakeWhile
  • TaskOps
  • ToParCollection
  • ToParMap
  • Transformer
  • Zip
  • ZipAll

class ParHashSetIterator extends IterableSplitter[T]

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

Instance Constructors

  1. new ParHashSetIterator(triter: scala.Iterator[T], sz: Int)

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: 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]
    Definition Classes
    IterableSplitter
  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
    Definition Classes
    IterableSplitter
  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 dup: IterableSplitter[T]

    Creates a copy of this iterator.

    Creates a copy of this iterator.

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

Inherited from IterableSplitter[T]

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