class
GroupConsecutiveIterator[T, R] extends Iterator[(R, Iterator[T])]
Instance Constructors
-
new
GroupConsecutiveIterator(iter: Iterator[T])(f: (T) ⇒ R)
Type Members
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
/:[B](z: B)(op: (B, (R, Iterator[T])) ⇒ B): B
-
def
:\[B](z: B)(op: ((R, Iterator[T]), B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (R, Iterator[T])) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
-
def
collectFirst[B](pf: PartialFunction[(R, Iterator[T]), B]): Option[B]
-
def
contains(elem: Any): Boolean
-
def
copyToArray[B >: (R, Iterator[T])](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (R, Iterator[T])](xs: Array[B]): Unit
-
def
copyToArray[B >: (R, Iterator[T])](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (R, Iterator[T])](dest: Buffer[B]): Unit
-
-
def
count(p: ((R, Iterator[T])) ⇒ Boolean): Int
-
def
drop(n: Int): Iterator[(R, Iterator[T])]
-
def
dropWhile(p: ((R, Iterator[T])) ⇒ Boolean): Iterator[(R, Iterator[T])]
-
def
duplicate: (Iterator[(R, Iterator[T])], Iterator[(R, Iterator[T])])
-
-
-
def
exists(p: ((R, Iterator[T])) ⇒ Boolean): Boolean
-
def
filter(p: ((R, Iterator[T])) ⇒ Boolean): Iterator[(R, Iterator[T])]
-
def
filterNot(p: ((R, Iterator[T])) ⇒ Boolean): Iterator[(R, Iterator[T])]
-
def
finalize(): Unit
-
def
find(p: ((R, Iterator[T])) ⇒ Boolean): Option[(R, Iterator[T])]
-
-
def
fold[A1 >: (R, Iterator[T])](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (R, Iterator[T])) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((R, Iterator[T]), B) ⇒ B): B
-
def
forall(p: ((R, Iterator[T])) ⇒ Boolean): Boolean
-
def
foreach[U](f: ((R, Iterator[T])) ⇒ U): Unit
-
final
def
getClass(): Class[_]
-
def
grouped[B >: (R, Iterator[T])](size: Int): GroupedIterator[B]
-
def
hasDefiniteSize: Boolean
-
-
def
hashCode(): Int
-
def
indexOf[B >: (R, Iterator[T])](elem: B): Int
-
def
indexWhere(p: ((R, Iterator[T])) ⇒ Boolean): Int
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
def
length: Int
-
def
map[B](f: ((R, Iterator[T])) ⇒ B): Iterator[B]
-
def
max[B >: (R, Iterator[T])](implicit cmp: Ordering[B]): (R, Iterator[T])
-
def
maxBy[B](f: ((R, Iterator[T])) ⇒ B)(implicit cmp: Ordering[B]): (R, Iterator[T])
-
def
min[B >: (R, Iterator[T])](implicit cmp: Ordering[B]): (R, Iterator[T])
-
def
minBy[B](f: ((R, Iterator[T])) ⇒ B)(implicit cmp: Ordering[B]): (R, Iterator[T])
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
def
next(): (R, Iterator[T])
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo[A1 >: (R, Iterator[T])](len: Int, elem: A1): Iterator[A1]
-
def
partition(p: ((R, Iterator[T])) ⇒ Boolean): (Iterator[(R, Iterator[T])], Iterator[(R, Iterator[T])])
-
def
patch[B >: (R, Iterator[T])](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
-
def
product[B >: (R, Iterator[T])](implicit num: Numeric[B]): B
-
def
reduce[A1 >: (R, Iterator[T])](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (R, Iterator[T])](op: (B, (R, Iterator[T])) ⇒ B): B
-
def
reduceLeftOption[B >: (R, Iterator[T])](op: (B, (R, Iterator[T])) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (R, Iterator[T])](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (R, Iterator[T])](op: ((R, Iterator[T]), B) ⇒ B): B
-
def
reduceRightOption[B >: (R, Iterator[T])](op: ((R, Iterator[T]), B) ⇒ B): Option[B]
-
def
reversed: List[(R, Iterator[T])]
-
-
def
scanLeft[B](z: B)(op: (B, (R, Iterator[T])) ⇒ B): Iterator[B]
-
def
scanRight[B](z: B)(op: ((R, Iterator[T]), B) ⇒ B): Iterator[B]
-
def
seq: Iterator[(R, Iterator[T])]
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterator[(R, Iterator[T])]
-
def
sliding[B >: (R, Iterator[T])](size: Int, step: Int): GroupedIterator[B]
-
def
span(p: ((R, Iterator[T])) ⇒ Boolean): (Iterator[(R, Iterator[T])], Iterator[(R, Iterator[T])])
-
def
sum[B >: (R, Iterator[T])](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(n: Int): Iterator[(R, Iterator[T])]
-
def
takeWhile(p: ((R, Iterator[T])) ⇒ Boolean): Iterator[(R, Iterator[T])]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (R, Iterator[T]), Col[(R, Iterator[T])]]): Col[(R, Iterator[T])]
-
def
toArray[B >: (R, Iterator[T])](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: (R, Iterator[T])]: Buffer[B]
-
def
toIndexedSeq: IndexedSeq[(R, Iterator[T])]
-
def
toIterable: Iterable[(R, Iterator[T])]
-
def
toIterator: Iterator[(R, Iterator[T])]
-
def
toList: List[(R, Iterator[T])]
-
def
toMap[T, U](implicit ev: <:<[(R, Iterator[T]), (T, U)]): Map[T, U]
-
def
toSeq: Seq[(R, Iterator[T])]
-
def
toSet[B >: (R, Iterator[T])]: Set[B]
-
def
toStream: Stream[(R, Iterator[T])]
-
def
toString(): String
-
def
toTraversable: Traversable[(R, Iterator[T])]
-
def
toVector: Vector[(R, Iterator[T])]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: ((R, Iterator[T])) ⇒ Boolean): Iterator[(R, Iterator[T])]
-
def
zip[B](that: Iterator[B]): Iterator[((R, Iterator[T]), B)]
-
def
zipAll[B, A1 >: (R, Iterator[T]), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex: Iterator[((R, Iterator[T]), Int)]
Inherited from Iterator[(R, Iterator[T])]
Groups consecutive records that share a projection from an iterator to form an iterator of iterators.
You can think of this as Iterator equivalent of.groupBy that only works on consecutive records.