Scala Standard Library 2.13.1 - scala.collection.Iterator.GroupedIterator (original) (raw)

class GroupedIterator[B >: A] extends AbstractIterator[immutable.Seq[B]]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. GroupedIterator
2. AbstractIterator
3. Iterator
4. IterableOnceOps
5. IterableOnce
6. AnyRef
7. Any

Implicitly

1. by iterableOnceExtensionMethods

2. by any2stringadd

3. by StringFormat

4. by Ensuring

5. by ArrowAssoc

6. Hide All

7. Show All

Visibility

1. Public
2. Protected

Instance Constructors

1.  new GroupedIterator(self: Iterator[B], size: Int, step: Int)

Value Members

1.  final def !=(arg0: Any): Boolean
2.  final def ##(): Int
3.  def +(other: String): String
4.  final def ++[B >: immutable.Seq[B]](xs: => IterableOnce[B]): Iterator[B]
5.  def ->[B](y: B): (GroupedIterator[B], B)
6.  final def ==(arg0: Any): Boolean
7.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder
8.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
9.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
10.  final def asInstanceOf[T0]: T0
11.  def buffered: BufferedIterator[immutable.Seq[B]]
12.  def clone(): AnyRef
13.  def collect[B](pf: PartialFunction[immutable.Seq[B], B]): Iterator[B]
14.  def collectFirst[B](pf: PartialFunction[immutable.Seq[B], B]): Option[B]
15.  def concat[B >: immutable.Seq[B]](xs: => IterableOnce[B]): Iterator[B]
16.  def contains(elem: Any): Boolean
17.  def copyToArray[B >: immutable.Seq[B]](xs: Array[B], start: Int, len: Int): Int
18.  def copyToArray[B >: immutable.Seq[B]](xs: Array[B], start: Int): Int
19.  def copyToArray[B >: immutable.Seq[B]](xs: Array[B]): Int
20.  def corresponds[B](that: IterableOnce[B])(p: (immutable.Seq[B], B) => Boolean): Boolean
21.  def count(p: (immutable.Seq[B]) => Boolean): Int
22.  def distinct: Iterator[immutable.Seq[B]]
23.  def distinctBy[B](f: (immutable.Seq[B]) => B): Iterator[immutable.Seq[B]]
24.  def drop(n: Int): Iterator[immutable.Seq[B]]
25.  def dropWhile(p: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
26.  def duplicate: (Iterator[immutable.Seq[B]], Iterator[immutable.Seq[B]])
27.  def ensuring(cond: (GroupedIterator[B]) => Boolean, msg: => Any): GroupedIterator[B]
28.  def ensuring(cond: (GroupedIterator[B]) => Boolean): GroupedIterator[B]
29.  def ensuring(cond: Boolean, msg: => Any): GroupedIterator[B]
30.  def ensuring(cond: Boolean): GroupedIterator[B]
31.  final def eq(arg0: AnyRef): Boolean
32.  def equals(arg0: AnyRef): Boolean
33.  def exists(p: (immutable.Seq[B]) => Boolean): Boolean
34.  def filter(p: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
35.  def filterNot(p: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
36.  def finalize(): Unit
37.  def find(p: (immutable.Seq[B]) => Boolean): Option[immutable.Seq[B]]
38.  def flatMap[B](f: (immutable.Seq[B]) => IterableOnce[B]): Iterator[B]
39.  def flatten[B](implicit ev: (immutable.Seq[B]) => IterableOnce[B]): Iterator[B]
40.  def fold[A1 >: immutable.Seq[B]](z: A1)(op: (A1, A1) => A1): A1
41.  def foldLeft[B](z: B)(op: (B, immutable.Seq[B]) => B): B
42.  def foldRight[B](z: B)(op: (immutable.Seq[B], B) => B): B
43.  def forall(p: (immutable.Seq[B]) => Boolean): Boolean
44.  def foreach[U](f: (immutable.Seq[B]) => U): Unit
45.  def formatted(fmtstr: String): String
46.  final def getClass(): Class[_ <: AnyRef]
47.  def grouped[B >: immutable.Seq[B]](size: Int): GroupedIterator[B]
48.  def hasNext: Boolean
49.  def hashCode(): Int
50.  def indexOf[B >: immutable.Seq[B]](elem: B, from: Int): Int
51.  def indexOf[B >: immutable.Seq[B]](elem: B): Int
52.  def indexWhere(p: (immutable.Seq[B]) => Boolean, from: Int = 0): Int
53.  def isEmpty: Boolean
54.  final def isInstanceOf[T0]: Boolean
55.  def isTraversableAgain: Boolean
56.  final def iterator: Iterator[immutable.Seq[B]]
57.  def knownSize: Int
58.  final def length: Int
59.  def map[B](f: (immutable.Seq[B]) => B): Iterator[B]
60.  def max[B >: immutable.Seq[B]](implicit ord: math.Ordering[B]): immutable.Seq[B]
61.  def maxBy[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): immutable.Seq[B]
62.  def maxByOption[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): Option[immutable.Seq[B]]
63.  def maxOption[B >: immutable.Seq[B]](implicit ord: math.Ordering[B]): Option[immutable.Seq[B]]
64.  def min[B >: immutable.Seq[B]](implicit ord: math.Ordering[B]): immutable.Seq[B]
65.  def minBy[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): immutable.Seq[B]
66.  def minByOption[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): Option[immutable.Seq[B]]
67.  def minOption[B >: immutable.Seq[B]](implicit ord: math.Ordering[B]): Option[immutable.Seq[B]]
68.  final def mkString: String
69.  final def mkString(sep: String): String
70.  final def mkString(start: String, sep: String, end: String): String
71.  final def ne(arg0: AnyRef): Boolean
72.  def next(): immutable.Seq[B]
73.  def nextOption(): Option[immutable.Seq[B]]
74.  def nonEmpty: Boolean
75.  final def notify(): Unit
76.  final def notifyAll(): Unit
77.  def padTo[B >: immutable.Seq[B]](len: Int, elem: B): Iterator[B]
78.  def partition(p: (immutable.Seq[B]) => Boolean): (Iterator[immutable.Seq[B]], Iterator[immutable.Seq[B]])
79.  def patch[B >: immutable.Seq[B]](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
80.  def product[B >: immutable.Seq[B]](implicit num: math.Numeric[B]): B
81.  def reduce[B >: immutable.Seq[B]](op: (B, B) => B): B
82.  def reduceLeft[B >: immutable.Seq[B]](op: (B, immutable.Seq[B]) => B): B
83.  def reduceLeftOption[B >: immutable.Seq[B]](op: (B, immutable.Seq[B]) => B): Option[B]
84.  def reduceOption[B >: immutable.Seq[B]](op: (B, B) => B): Option[B]
85.  def reduceRight[B >: immutable.Seq[B]](op: (immutable.Seq[B], B) => B): B
86.  def reduceRightOption[B >: immutable.Seq[B]](op: (immutable.Seq[B], B) => B): Option[B]
87.  def reversed: Iterable[immutable.Seq[B]]
88.  def sameElements[B >: immutable.Seq[B]](that: IterableOnce[B]): Boolean
89.  def scanLeft[B](z: B)(op: (B, immutable.Seq[B]) => B): Iterator[B]
90.  def size: Int
91.  def slice(from: Int, until: Int): Iterator[immutable.Seq[B]]
92.  def sliceIterator(from: Int, until: Int): Iterator[immutable.Seq[B]]
93.  def sliding[B >: immutable.Seq[B]](size: Int, step: Int = 1): GroupedIterator[B]
94.  def span(p: (immutable.Seq[B]) => Boolean): (Iterator[immutable.Seq[B]], Iterator[immutable.Seq[B]])
95.  def splitAt(n: Int): (Iterator[immutable.Seq[B]], Iterator[immutable.Seq[B]])
96.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[immutable.Seq[B], S]): S
97.  def sum[B >: immutable.Seq[B]](implicit num: math.Numeric[B]): B
98.  final def synchronized[T0](arg0: => T0): T0
99.  def take(n: Int): Iterator[immutable.Seq[B]]
100.  def takeWhile(p: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
101.  def tapEach[U](f: (immutable.Seq[B]) => U): Iterator[immutable.Seq[B]]
102.  def to[C1](factory: Factory[immutable.Seq[B], C1]): C1
103.  def toArray[B >: immutable.Seq[B]](implicit arg0: ClassTag[B]): Array[B]
104.  final def toBuffer[B >: immutable.Seq[B]]: Buffer[B]
105.  def toIndexedSeq: immutable.IndexedSeq[immutable.Seq[B]]
106.  def toList: immutable.List[immutable.Seq[B]]
107.  def toMap[K, V](implicit ev: <:<[immutable.Seq[B], (K, V)]): immutable.Map[K, V]
108.  def toSeq: immutable.Seq[immutable.Seq[B]]
109.  def toSet[B >: immutable.Seq[B]]: immutable.Set[B]
110.  def toString(): String
111.  def toVector: immutable.Vector[immutable.Seq[B]]
112.  final def wait(): Unit
113.  final def wait(arg0: Long, arg1: Int): Unit
114.  final def wait(arg0: Long): Unit
115.  def withFilter(p: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
116.  def withPadding(x: => B): GroupedIterator.this.type
117.  def withPartial(x: Boolean): GroupedIterator.this.type
118.  def zip[B](that: IterableOnce[B]): Iterator[(immutable.Seq[B], B)]
119.  def zipAll[A1 >: immutable.Seq[B], B](that: IterableOnce[B], thisElem: A1, thatElem: B): Iterator[(A1, B)]
120.  def zipWithIndex: Iterator[(immutable.Seq[B], Int)]

Deprecated Value Members

1.  def /:[B](z: B)(op: (B, immutable.Seq[B]) => B): B
2.  final def /:[B](z: B)(op: (B, immutable.Seq[B]) => B): B
3.  def :\[B](z: B)(op: (immutable.Seq[B], B) => B): B
4.  final def :\[B](z: B)(op: (immutable.Seq[B], B) => B): B
5.  def aggregate[B](z: => B)(seqop: (B, immutable.Seq[B]) => B, combop: (B, B) => B): B
6.  def collectFirst[B](f: PartialFunction[immutable.Seq[B], B]): Option[B]
7.  def copyToBuffer(dest: Buffer[immutable.Seq[B]]): Unit
8.  final def copyToBuffer[B >: immutable.Seq[B]](dest: Buffer[B]): Unit
9.  def count(f: (immutable.Seq[B]) => Boolean): Int
10.  def exists(f: (immutable.Seq[B]) => Boolean): Boolean
11.  def filter(f: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
12.  def find(p: (immutable.Seq[B]) => Boolean): Option[immutable.Seq[B]]
13.  def flatMap[B](f: (immutable.Seq[B]) => IterableOnce[B]): IterableOnce[B]
14.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
15.  def foldLeft[B](z: B)(op: (B, immutable.Seq[B]) => B): B
16.  def foldRight[B](z: B)(op: (immutable.Seq[B], B) => B): B
17.  def forall(f: (immutable.Seq[B]) => Boolean): Boolean
18.  def foreach[U](f: (immutable.Seq[B]) => U): Unit
19.  final def hasDefiniteSize: Boolean
20.  def isEmpty: Boolean
21.  def map[B](f: (immutable.Seq[B]) => B): IterableOnce[B]
22.  def max(implicit ord: math.Ordering[immutable.Seq[B]]): immutable.Seq[B]
23.  def maxBy[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): immutable.Seq[B]
24.  def min(implicit ord: math.Ordering[immutable.Seq[B]]): immutable.Seq[B]
25.  def minBy[B](f: (immutable.Seq[B]) => B)(implicit cmp: math.Ordering[B]): immutable.Seq[B]
26.  def mkString: String
27.  def mkString(sep: String): String
28.  def mkString(start: String, sep: String, end: String): String
29.  def nonEmpty: Boolean
30.  def product(implicit num: math.Numeric[immutable.Seq[B]]): immutable.Seq[B]
31.  def reduce(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): immutable.Seq[B]
32.  def reduceLeft(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): immutable.Seq[B]
33.  def reduceLeftOption(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): Option[immutable.Seq[B]]
34.  def reduceOption(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): Option[immutable.Seq[B]]
35.  def reduceRight(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): immutable.Seq[B]
36.  def reduceRightOption(f: (immutable.Seq[B], immutable.Seq[B]) => immutable.Seq[B]): Option[immutable.Seq[B]]
37.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
38.  def scanRight[B](z: B)(op: (immutable.Seq[B], B) => B): Iterator[B]
39.  def seq: GroupedIterator.this.type
40.  def size: Int
41.  def sum(implicit num: math.Numeric[immutable.Seq[B]]): immutable.Seq[B]
42.  def to[C1](factory: Factory[immutable.Seq[B], C1]): C1
43.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
44.  def toBuffer[B >: A]: Buffer[B]
45.  def toIndexedSeq: IndexedSeq[immutable.Seq[B]]
46.  final def toIterable: Iterable[immutable.Seq[B]]
47.  def toIterator: Iterator[immutable.Seq[B]]
48.  final def toIterator: Iterator[immutable.Seq[B]]
49.  def toList: immutable.List[immutable.Seq[B]]
50.  def toMap[K, V](implicit ev: <:<[immutable.Seq[B], (K, V)]): immutable.Map[K, V]
51.  def toSeq: immutable.Seq[immutable.Seq[B]]
52.  def toSet[B >: A]: immutable.Set[B]
53.  def toStream: immutable.Stream[immutable.Seq[B]]
54.  final def toStream: immutable.Stream[immutable.Seq[B]]
55.  final def toTraversable: Traversable[immutable.Seq[B]]
56.  def toVector: immutable.Vector[immutable.Seq[B]]
57.  def withFilter(f: (immutable.Seq[B]) => Boolean): Iterator[immutable.Seq[B]]
58.  def →[B](y: B): (GroupedIterator[B], B)

Ungrouped