InterimIteratorVersionWrapper

Instance Constructors

new InterimIteratorVersionWrapper(name: String, numRows: Int, rowAccumulator: CollectionAccumulator[InterimRow], collectStats: Boolean, statAccumulator: Array[FieldStatAccumulator], countAccumulator: LongAccumulator, partitionCounter: LongAccumulator, partitionId: Int)(schema: StructType, underlying: Iterator[InternalRow])

Type Members

class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

Definition Classes
Iterator

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++[B >: InternalRow](that: ⇒ GenTraversableOnce[B]): Iterator[B]

Definition Classes
Iterator
def /:[B](z: B)(op: (B, InternalRow) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (InternalRow, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, InternalRow) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buffered: BufferedIterator[InternalRow]

Definition Classes
Iterator
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
def collect[B](pf: PartialFunction[InternalRow, 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.
def collectFirst[B](pf: PartialFunction[InternalRow, B]): Option[B]

Definition Classes
TraversableOnce
val collectStats: Boolean

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def contains(elem: Any): Boolean

Definition Classes
Iterator
def copyToArray[B >: InternalRow](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def copyToArray[B >: InternalRow](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: InternalRow](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: InternalRow](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def corresponds[B](that: GenTraversableOnce[B])(p: (InternalRow, B) ⇒ Boolean): Boolean

Definition Classes
Iterator
def count(p: (InternalRow) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
val countAccumulator: LongAccumulator

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def drop(n: Int): Iterator[InternalRow]

Definition Classes
Iterator
def dropWhile(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

Definition Classes
Iterator
def duplicate: (Iterator[InternalRow], Iterator[InternalRow])

Definition Classes
Iterator
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def exists(p: (InternalRow) ⇒ Boolean): Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def filter(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

Definition Classes
Iterator
def filterNot(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

Definition Classes
Iterator
def find(p: (InternalRow) ⇒ Boolean): Option[InternalRow]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def flatMap[B](f: (InternalRow) ⇒ GenTraversableOnce[B]): Iterator[B]

Definition Classes
Iterator
def fold[A1 >: InternalRow](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, InternalRow) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (InternalRow, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def forall(p: (InternalRow) ⇒ Boolean): Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def foreach[U](f: (InternalRow) ⇒ U): Unit

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def grouped[B >: InternalRow](size: Int): GroupedIterator[B]

Definition Classes
Iterator
def hasDefiniteSize: Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def hasNext: Boolean

Definition Classes
InterimIteratorWrapperTrait → Iterator
def hasNextAcc(field: StructField, index: Int, acc: FieldStatAccumulator): Unit

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def indexOf[B >: InternalRow](elem: B): Int

Definition Classes
Iterator
def indexWhere(p: (InternalRow) ⇒ Boolean): Int

Definition Classes
Iterator
lazy val interimSchema: StructType

Definition Classes
InterimIteratorWrapperTrait
def isEmpty: Boolean

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraversableAgain: Boolean

Definition Classes
Iterator → GenTraversableOnce
def jsonForRow(r: InternalRow): String

Definition Classes
InterimIteratorWrapperTrait
def length: Int

Definition Classes
Iterator
def map[B](f: (InternalRow) ⇒ B): Iterator[B]

Definition Classes
Iterator
def max[B >: InternalRow](implicit cmp: Ordering[B]): InternalRow

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (InternalRow) ⇒ B)(implicit cmp: Ordering[B]): InternalRow

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: InternalRow](implicit cmp: Ordering[B]): InternalRow

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (InternalRow) ⇒ B)(implicit cmp: Ordering[B]): InternalRow

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
val name: String

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def next(): InternalRow

Definition Classes
InterimIteratorWrapperTrait → Iterator
def nextAcc(n: InternalRow, field: StructField, index: Int, acc: FieldStatAccumulator): Unit

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
val numRows: Int

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def padTo[A1 >: InternalRow](len: Int, elem: A1): Iterator[A1]

Definition Classes
Iterator
def partition(p: (InternalRow) ⇒ Boolean): (Iterator[InternalRow], Iterator[InternalRow])

Definition Classes
Iterator
val partitionCounter: LongAccumulator

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
val partitionId: Int

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
val partitionMaxs: Array[Option[Any]]

Definition Classes
InterimIteratorWrapperTrait
val partitionMins: Array[Option[Any]]

Definition Classes
InterimIteratorWrapperTrait
def patch[B >: InternalRow](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

Definition Classes
Iterator
def product[B >: InternalRow](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: InternalRow](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: InternalRow](op: (B, InternalRow) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: InternalRow](op: (B, InternalRow) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: InternalRow](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: InternalRow](op: (InternalRow, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: InternalRow](op: (InternalRow, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reversed: List[InternalRow]

Attributes
protected[this]
Definition Classes
TraversableOnce
val rowAccumulator: CollectionAccumulator[InterimRow]

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def sameElements(that: Iterator[_]): Boolean

Definition Classes
Iterator
def scanLeft[B](z: B)(op: (B, InternalRow) ⇒ B): Iterator[B]

Definition Classes
Iterator
def scanRight[B](z: B)(op: (InternalRow, B) ⇒ B): Iterator[B]

Definition Classes
Iterator
val schema: StructType

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def seq: Iterator[InternalRow]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): Iterator[InternalRow]

Definition Classes
Iterator
def sliding[B >: InternalRow](size: Int, step: Int): GroupedIterator[B]

Definition Classes
Iterator
def span(p: (InternalRow) ⇒ Boolean): (Iterator[InternalRow], Iterator[InternalRow])

Definition Classes
Iterator
val statAccumulator: Array[FieldStatAccumulator]

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
def sum[B >: InternalRow](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def take(n: Int): Iterator[InternalRow]

Definition Classes
Iterator
def takeWhile(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

Definition Classes
Iterator
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, InternalRow, Col[InternalRow]]): Col[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
def toArray[B >: InternalRow](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: InternalRow]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIndexedSeq: IndexedSeq[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterator: Iterator[InternalRow]

Definition Classes
Iterator → GenTraversableOnce
def toList: List[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[InternalRow, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: InternalRow]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[InternalRow]

Definition Classes
Iterator → GenTraversableOnce
def toString(): String

Definition Classes
Iterator → AnyRef → Any
def toTraversable: Traversable[InternalRow]

Definition Classes
Iterator → TraversableOnce → GenTraversableOnce
def toVector: Vector[InternalRow]

Definition Classes
TraversableOnce → GenTraversableOnce
val underlying: Iterator[InternalRow]

Definition Classes
InterimIteratorVersionWrapper → InterimIteratorWrapperTrait
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

Definition Classes
Iterator
def zip[B](that: Iterator[B]): Iterator[(InternalRow, B)]

Definition Classes
Iterator
def zipAll[B, A1 >: InternalRow, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

Definition Classes
Iterator
def zipWithIndex: Iterator[(InternalRow, Int)]

Definition Classes
Iterator

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object InterimIteratorVersionWrapper | package sql

Instance Constructors

Type Members

class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: InternalRow](that: ⇒ GenTraversableOnce[B]): Iterator[B]

def /:[B](z: B)(op: (B, InternalRow) ⇒ B): B

def :\[B](z: B)(op: (InternalRow, 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, InternalRow) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[InternalRow]

def clone(): AnyRef

def collect[B](pf: PartialFunction[InternalRow, B]): Iterator[B]

def collectFirst[B](pf: PartialFunction[InternalRow, B]): Option[B]

val collectStats: Boolean

def contains(elem: Any): Boolean

def copyToArray[B >: InternalRow](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: InternalRow](xs: Array[B]): Unit

def copyToArray[B >: InternalRow](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: InternalRow](dest: Buffer[B]): Unit

def corresponds[B](that: GenTraversableOnce[B])(p: (InternalRow, B) ⇒ Boolean): Boolean

def count(p: (InternalRow) ⇒ Boolean): Int

val countAccumulator: LongAccumulator

def drop(n: Int): Iterator[InternalRow]

def dropWhile(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

def duplicate: (Iterator[InternalRow], Iterator[InternalRow])

final def eq(arg0: AnyRef): Boolean

def exists(p: (InternalRow) ⇒ Boolean): Boolean

def filter(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

def filterNot(p: (InternalRow) ⇒ Boolean): Iterator[InternalRow]

def find(p: (InternalRow) ⇒ Boolean): Option[InternalRow]

def flatMap[B](f: (InternalRow) ⇒ GenTraversableOnce[B]): Iterator[B]

def fold[A1 >: InternalRow](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, InternalRow) ⇒ B): B

def foldRight[B](z: B)(op: (InternalRow, B) ⇒ B): B

def forall(p: (InternalRow) ⇒ Boolean): Boolean

def foreach[U](f: (InternalRow) ⇒ U): Unit

final def getClass(): Class[_]

def grouped[B >: InternalRow](size: Int): GroupedIterator[B]

def hasDefiniteSize: Boolean

def hasNext: Boolean

def hasNextAcc(field: StructField, index: Int, acc: FieldStatAccumulator): Unit

def indexOf[B >: InternalRow](elem: B): Int

def indexWhere(p: (InternalRow) ⇒ Boolean): Int

lazy val interimSchema: StructType

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def jsonForRow(r: InternalRow): String

def length: Int

def map[B](f: (InternalRow) ⇒ B): Iterator[B]

def max[B >: InternalRow](implicit cmp: Ordering[B]): InternalRow

def maxBy[B](f: (InternalRow) ⇒ B)(implicit cmp: Ordering[B]): InternalRow

def min[B >: InternalRow](implicit cmp: Ordering[B]): InternalRow

def minBy[B](f: (InternalRow) ⇒ B)(implicit cmp: Ordering[B]): InternalRow

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

val name: String

final def ne(arg0: AnyRef): Boolean

def next(): InternalRow

def nextAcc(n: InternalRow, field: StructField, index: Int, acc: FieldStatAccumulator): Unit

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

val numRows: Int

def padTo[A1 >: InternalRow](len: Int, elem: A1): Iterator[A1]

def partition(p: (InternalRow) ⇒ Boolean): (Iterator[InternalRow], Iterator[InternalRow])

val partitionCounter: LongAccumulator

val partitionId: Int

val partitionMaxs: Array[Option[Any]]

val partitionMins: Array[Option[Any]]

def patch[B >: InternalRow](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]