case class GroupedIterator[T, G](i: Iterator[T], grouper: (T) => G) extends Iterator[(G, List[T])] with Product with Serializable
Convenience Iterator that groups sorted elements together based on the grouper function.
Note: this is only useful is the underlying iterator is properly sorted by G.
- Alphabetic
- By Inheritance
- GroupedIterator
- Serializable
- Product
- Equals
- Iterator
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new GroupedIterator(i: Iterator[T], grouper: (T) => G)
Type Members
- class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]]
- Definition Classes
- Iterator
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: (G, List[T])](xs: => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
- Definition Classes
- IterableOnceOps
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def buffered: BufferedIterator[(G, List[T])]
- Definition Classes
- Iterator
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- def collect[B](pf: PartialFunction[(G, List[T]), B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[(G, List[T]), B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: (G, List[T])](xs: => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
- def contains(elem: Any): Boolean
- Definition Classes
- Iterator
- def copyToArray[B >: (G, List[T])](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (G, List[T])](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: (G, List[T])](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: ((G, List[T]), B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: ((G, List[T])) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def distinct: Iterator[(G, List[T])]
- Definition Classes
- Iterator
- def distinctBy[B](f: ((G, List[T])) => B): Iterator[(G, List[T])]
- Definition Classes
- Iterator
- def drop(n: Int): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def dropWhile(p: ((G, List[T])) => Boolean): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def duplicate: (Iterator[(G, List[T])], Iterator[(G, List[T])])
- Definition Classes
- Iterator
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def exists(p: ((G, List[T])) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(p: ((G, List[T])) => Boolean): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def filterNot(p: ((G, List[T])) => Boolean): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def find(p: ((G, List[T])) => Boolean): Option[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: ((G, List[T])) => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def flatten[B](implicit ev: ((G, List[T])) => IterableOnce[B]): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def fold[A1 >: (G, List[T])](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, (G, List[T])) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: ((G, List[T]), B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: ((G, List[T])) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: ((G, List[T])) => U): Unit
- Definition Classes
- IterableOnceOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def grouped[B >: (G, List[T])](size: Int): GroupedIterator[B]
- Definition Classes
- Iterator
- val grouper: (T) => G
- def hasNext: Boolean
- Definition Classes
- GroupedIterator → Iterator
- val i: Iterator[T]
- def indexOf[B >: (G, List[T])](elem: B, from: Int): Int
- Definition Classes
- Iterator
- def indexOf[B >: (G, List[T])](elem: B): Int
- Definition Classes
- Iterator
- def indexWhere(p: ((G, List[T])) => Boolean, from: Int): Int
- Definition Classes
- Iterator
- def isEmpty: Boolean
- Definition Classes
- Iterator → IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOnceOps
- final def iterator: Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnce
- Annotations
- @inline()
- def knownSize: Int
- Definition Classes
- IterableOnce
- final def length: Int
- Definition Classes
- Iterator
- Annotations
- @inline()
- def map[B](f: ((G, List[T])) => B): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def max[B >: (G, List[T])](implicit ord: Ordering[B]): (G, List[T])
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: ((G, List[T])) => B)(implicit ord: Ordering[B]): (G, List[T])
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: ((G, List[T])) => B)(implicit ord: Ordering[B]): Option[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: (G, List[T])](implicit ord: Ordering[B]): Option[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def min[B >: (G, List[T])](implicit ord: Ordering[B]): (G, List[T])
- Definition Classes
- IterableOnceOps
- def minBy[B](f: ((G, List[T])) => B)(implicit ord: Ordering[B]): (G, List[T])
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: ((G, List[T])) => B)(implicit ord: Ordering[B]): Option[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def minOption[B >: (G, List[T])](implicit ord: Ordering[B]): Option[(G, List[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(): (G, List[T])
- Definition Classes
- GroupedIterator → Iterator
- def nextOption(): Option[(G, List[T])]
- Definition Classes
- Iterator
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def padTo[B >: (G, List[T])](len: Int, elem: B): Iterator[B]
- Definition Classes
- Iterator
- def partition(p: ((G, List[T])) => Boolean): (Iterator[(G, List[T])], Iterator[(G, List[T])])
- Definition Classes
- Iterator
- def patch[B >: (G, List[T])](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
- Definition Classes
- Iterator
- def product[B >: (G, List[T])](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reduce[B >: (G, List[T])](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: (G, List[T])](op: (B, (G, List[T])) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: (G, List[T])](op: (B, (G, List[T])) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: (G, List[T])](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: (G, List[T])](op: ((G, List[T]), B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: (G, List[T])](op: ((G, List[T]), B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[(G, List[T])]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def sameElements[B >: (G, List[T])](that: IterableOnce[B]): Boolean
- Definition Classes
- Iterator
- def scanLeft[B](z: B)(op: (B, (G, List[T])) => B): Iterator[B]
- Definition Classes
- Iterator → IterableOnceOps
- def size: Int
- Definition Classes
- IterableOnceOps
- def slice(from: Int, until: Int): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def sliceIterator(from: Int, until: Int): Iterator[(G, List[T])]
- Attributes
- protected
- Definition Classes
- Iterator
- def sliding[B >: (G, List[T])](size: Int, step: Int): GroupedIterator[B]
- Definition Classes
- Iterator
- def span(p: ((G, List[T])) => Boolean): (Iterator[(G, List[T])], Iterator[(G, List[T])])
- Definition Classes
- Iterator → IterableOnceOps
- def splitAt(n: Int): (Iterator[(G, List[T])], Iterator[(G, List[T])])
- Definition Classes
- IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[(G, List[T]), S]): S
- Definition Classes
- IterableOnce
- def sum[B >: (G, List[T])](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def take(n: Int): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def takeWhile(p: ((G, List[T])) => Boolean): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def tapEach[U](f: ((G, List[T])) => U): Iterator[(G, List[T])]
- Definition Classes
- Iterator → IterableOnceOps
- def to[C1](factory: Factory[(G, List[T]), C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: (G, List[T])](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: (G, List[T])]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def toList: List[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[(G, List[T]), (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[(G, List[T])]
- Definition Classes
- IterableOnceOps
- def toSet[B >: (G, List[T])]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Iterator → AnyRef → Any
- def toVector: Vector[(G, List[T])]
- Definition Classes
- IterableOnceOps
- 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])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: ((G, List[T])) => Boolean): Iterator[(G, List[T])]
- Definition Classes
- Iterator
- def zip[B](that: IterableOnce[B]): Iterator[((G, List[T]), B)]
- Definition Classes
- Iterator
- def zipAll[A1 >: (G, List[T]), B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
- Definition Classes
- Iterator
- def zipWithIndex: Iterator[((G, List[T]), Int)]
- Definition Classes
- Iterator → IterableOnceOps
Deprecated Value Members
- final def /:[B](z: B)(op: (B, (G, List[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: ((G, List[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, (G, List[T])) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) For sequential collections, prefer
foldLeft(z)(seqop)
. For parallel collections, useParIterableLike#aggregate
.
- final def copyToBuffer[B >: (G, List[T])](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)
- 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: ((G, List[T]), B) => B): Iterator[B]
- Definition Classes
- Iterator
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Call scanRight on an Iterable instead.
- def seq: util.GroupedIterator.this.type
- Definition Classes
- Iterator
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterator.seq always returns the iterator itself
- final def toIterator: Iterator[(G, List[T])]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[(G, List[T])]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream