Packages

class ParHashMapIterator extends EntryIterator[(K, V), ParHashMapIterator]

Linear Supertypes
ParHashMap.EntryIterator[(K, V), ParHashMapIterator], SizeMapUtils, IterableSplitter[(K, V)], DelegatedSignalling, Signalling, Splitter[(K, V)], AugmentedIterableIterator[(K, V)], RemainsIterator[(K, V)], Iterator[(K, V)], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParHashMapIterator
  2. EntryIterator
  3. SizeMapUtils
  4. IterableSplitter
  5. DelegatedSignalling
  6. Signalling
  7. Splitter
  8. AugmentedIterableIterator
  9. RemainsIterator
  10. Iterator
  11. TraversableOnce
  12. GenTraversableOnce
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParHashMapIterator(start: Int, untilIdx: Int, totalSize: Int, e: DefaultEntry[K, V])

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 >: (K, V)](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: ((K, V), 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, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. def appendParIterable[U >: (K, V), PI <: IterableSplitter[U]](that: PI): Appended[U, PI]
    Definition Classes
    IterableSplitter
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def buffered: BufferedIterator[(K, V)]
    Definition Classes
    Iterator
  15. def buildString(closure: ((String) ⇒ Unit) ⇒ Unit): String
    Attributes
    protected
    Definition Classes
    IterableSplitter
  16. def calcNumElems(from: Int, until: Int, tableLength: Int, sizeMapBucketSize: Int): Int
    Attributes
    protected
    Definition Classes
    SizeMapUtils
  17. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. def collect[B](pf: PartialFunction[(K, V), 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.

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

    Drop implemented as simple eager consumption.

    Drop implemented as simple eager consumption.

    Definition Classes
    IterableSplitter → Iterator
  32. def drop2combiner[U >: (K, V), This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  33. def dropWhile(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Definition Classes
    Iterator
  34. def dup: ParHashMapIterator

    Creates a copy of this iterator.

    Creates a copy of this iterator.

    Definition Classes
    EntryIterator → IterableSplitter
  35. def duplicate: (Iterator[(K, V)], Iterator[(K, V)])
    Definition Classes
    Iterator
  36. def entry2item(entry: DefaultEntry[K, V]): (K, V)
    Definition Classes
    ParHashMapIterator → EntryIterator
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  39. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  40. def filter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Definition Classes
    Iterator
  41. def filter2combiner[U >: (K, V), This](pred: ((K, V)) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  42. def filterNot(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Definition Classes
    Iterator
  43. def filterNot2combiner[U >: (K, V), This](pred: ((K, V)) ⇒ Boolean, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  44. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  46. def flatMap[B](f: ((K, V)) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  47. def flatmap2combiner[S, That](f: ((K, V)) ⇒ GenTraversableOnce[S], cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  48. def fold[U >: (K, V)](z: U)(op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  49. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  52. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Definition Classes
    Iterator → GenTraversableOnce
  53. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  54. def grouped[B >: (K, V)](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  55. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  56. def hasNext: Boolean
    Definition Classes
    EntryIterator → Iterator
  57. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  58. def indexFlag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  59. def indexOf[B >: (K, V)](elem: B, from: Int): Int
    Definition Classes
    Iterator
  60. def indexOf[B >: (K, V)](elem: B): Int
    Definition Classes
    Iterator
  61. def indexWhere(p: ((K, V)) ⇒ Boolean, from: Int): Int
    Definition Classes
    Iterator
  62. def indexWhere(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    Iterator
  63. def isAborted: Boolean
    Definition Classes
    DelegatedSignalling → Signalling
  64. def isEmpty: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  65. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  66. 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
  67. def isTraversableAgain: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  68. def length: Int
    Definition Classes
    Iterator
  69. def map[S](f: ((K, V)) ⇒ S): Mapped[S]
    Definition Classes
    IterableSplitter → Iterator
  70. def map2combiner[S, That](f: ((K, V)) ⇒ S, cb: Combiner[S, That]): Combiner[S, That]
    Definition Classes
    AugmentedIterableIterator
  71. def max[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  72. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def min[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  74. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  79. def newIterator(idxFrom: Int, idxUntil: Int, totalSz: Int, es: DefaultEntry[K, V]): ParHashMapIterator
    Definition Classes
    ParHashMapIterator → EntryIterator
  80. def next(): (K, V)
    Definition Classes
    EntryIterator → Iterator
  81. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. final def notify(): Unit
    Definition Classes
    AnyRef
  83. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  84. def padTo[A1 >: (K, V)](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  85. def partition(p: ((K, V)) ⇒ Boolean): (Iterator[(K, V)], Iterator[(K, V)])
    Definition Classes
    Iterator
  86. def partition2combiners[U >: (K, V), This](pred: ((K, V)) ⇒ Boolean, btrue: Combiner[U, This], bfalse: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  87. def patch[B >: (K, V)](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  88. def product[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  89. def reduce[U >: (K, V)](op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  90. def reduceLeft[U >: (K, V)](howmany: Int, op: (U, U) ⇒ U): U
    Definition Classes
    AugmentedIterableIterator
  91. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  92. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. 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
  97. def reversed: List[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  98. def sameElements(that: Iterator[_]): Boolean
    Definition Classes
    Iterator
  99. def scan(): Unit
    Definition Classes
    EntryIterator
  100. def scanLeft[B](z: B)(op: (B, (K, V)) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  101. def scanRight[B](z: B)(op: ((K, V), B) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  102. def scanToArray[U >: (K, V), A >: U](z: U, op: (U, U) ⇒ U, array: Array[A], from: Int): Unit
    Definition Classes
    AugmentedIterableIterator
  103. def scanToCombiner[U >: (K, V), That](howmany: Int, startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  104. def scanToCombiner[U >: (K, V), That](startValue: U, op: (U, U) ⇒ U, cb: Combiner[U, That]): Combiner[U, That]
    Definition Classes
    AugmentedIterableIterator
  105. def seq: Iterator[(K, V)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  106. def setIndexFlag(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  107. def setIndexFlagIfGreater(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  108. def setIndexFlagIfLesser(f: Int): Unit
    Definition Classes
    DelegatedSignalling → Signalling
  109. def shouldSplitFurther[S](coll: parallel.ParIterable[S], parallelismLevel: Int): Boolean
    Definition Classes
    IterableSplitter
  110. val signalDelegate: Signalling
    Definition Classes
    IterableSplitter → DelegatedSignalling
  111. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  113. def slice(from1: Int, until1: Int): IterableSplitter[(K, V)]
    Definition Classes
    IterableSplitter → Iterator
  114. def slice2combiner[U >: (K, V), This](from: Int, until: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  115. def sliceIterator(from: Int, until: Int): Iterator[(K, V)]
    Attributes
    protected
    Definition Classes
    Iterator
  116. def sliding[B >: (K, V)](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  117. def span(p: ((K, V)) ⇒ Boolean): (Iterator[(K, V)], Iterator[(K, V)])
    Definition Classes
    Iterator
  118. def span2combiners[U >: (K, V), This](p: ((K, V)) ⇒ Boolean, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  119. def split: Seq[IterableSplitter[(K, V)]]

    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
  120. def splitAt2combiners[U >: (K, V), This](at: Int, before: Combiner[U, This], after: Combiner[U, This]): (Combiner[U, This], Combiner[U, This])
    Definition Classes
    AugmentedIterableIterator
  121. def splitWithSignalling: scala.Seq[IterableSplitter[(K, V)]]
    Definition Classes
    IterableSplitter
  122. def sum[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    AugmentedIterableIterator → TraversableOnce → GenTraversableOnce
  123. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  124. def tag: Int
    Definition Classes
    DelegatedSignalling → Signalling
  125. def take(n: Int): IterableSplitter[(K, V)]
    Definition Classes
    IterableSplitter → Iterator
  126. def take2combiner[U >: (K, V), This](n: Int, cb: Combiner[U, This]): Combiner[U, This]
    Definition Classes
    AugmentedIterableIterator
  127. def takeWhile(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Definition Classes
    Iterator
  128. def takeWhile2combiner[U >: (K, V), This](p: ((K, V)) ⇒ Boolean, cb: Combiner[U, This]): (Combiner[U, This], Boolean)
    Definition Classes
    AugmentedIterableIterator
  129. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toBuffer[B >: (K, V)]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def toIndexedSeq: immutable.IndexedSeq[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toIterable: Iterable[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toIterator: Iterator[(K, V)]
    Definition Classes
    Iterator → GenTraversableOnce
  135. def toList: List[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): immutable.Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toSeq: Seq[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toSet[B >: (K, V)]: immutable.Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toStream: immutable.Stream[(K, V)]
    Definition Classes
    Iterator → GenTraversableOnce
  140. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  141. def toTraversable: Traversable[(K, V)]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  142. def toVector: Vector[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  144. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  145. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  146. def withFilter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Definition Classes
    Iterator
  147. def zip[B](that: Iterator[B]): Iterator[((K, V), B)]
    Definition Classes
    Iterator
  148. def zip2combiner[U >: (K, V), S, That](otherpit: RemainsIterator[S], cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  149. def zipAll[B, A1 >: (K, V), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
    Definition Classes
    Iterator
  150. def zipAll2combiner[U >: (K, V), S, That](that: RemainsIterator[S], thiselem: U, thatelem: S, cb: Combiner[(U, S), That]): Combiner[(U, S), That]
    Definition Classes
    AugmentedIterableIterator
  151. def zipAllParSeq[S, U >: (K, V), R >: S](that: SeqSplitter[S], thisElem: U, thatElem: R): ZippedAll[U, R]
    Definition Classes
    IterableSplitter
  152. def zipParSeq[S](that: SeqSplitter[S]): Zipped[S]
    Definition Classes
    IterableSplitter
  153. def zipWithIndex: Iterator[((K, V), Int)]
    Definition Classes
    Iterator

Inherited from ParHashMap.EntryIterator[(K, V), ParHashMapIterator]

Inherited from SizeMapUtils

Inherited from IterableSplitter[(K, V)]

Inherited from DelegatedSignalling

Inherited from Signalling

Inherited from Splitter[(K, V)]

Inherited from AugmentedIterableIterator[(K, V)]

Inherited from RemainsIterator[(K, V)]

Inherited from Iterator[(K, V)]

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped