SortBasedAggregationIterator

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

def :\[B](z: B)(op: (UnsafeRow, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

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, UnsafeRow) ⇒ B, combop: (B, B) ⇒ B): B

val aggregateFunctions: Array[AggregateFunction]

val allImperativeAggregateFunctionPositions: Array[Int]

val allImperativeAggregateFunctions: Array[ImperativeAggregate]

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[UnsafeRow]

def clone(): AnyRef

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

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

val expressionAggInitialProjection: MutableProjection

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

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

def finalize(): Unit

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

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

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

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

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

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

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

val generateOutput: (UnsafeRow, InternalRow) ⇒ UnsafeRow

def generateProcessRow(expressions: Seq[AggregateExpression], functions: Seq[AggregateFunction], inputAttributes: Seq[Attribute]): (InternalRow, InternalRow) ⇒ Unit

def generateResultProjection(): (UnsafeRow, InternalRow) ⇒ UnsafeRow

final def getClass(): Class[_]

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

val groupingAttributes: Seq[Attribute]

val groupingProjection: UnsafeProjection

def hasDefiniteSize: Boolean

final def hasNext: Boolean

def hashCode(): Int

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

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

def initialize(): Unit

def initializeAggregateFunctions(expressions: Seq[AggregateExpression], startingInputBufferOffset: Int): Array[AggregateFunction]

def initializeBuffer(buffer: InternalRow): Unit

Initializes buffer values for all aggregate functions.

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

def isTraversableAgain: Boolean

def length: Int

def log: Logger

def logDebug(msg: ⇒ String, throwable: Throwable): Unit

def logDebug(msg: ⇒ String): Unit

def logError(msg: ⇒ String, throwable: Throwable): Unit

def logError(msg: ⇒ String): Unit

def logInfo(msg: ⇒ String, throwable: Throwable): Unit

def logInfo(msg: ⇒ String): Unit

def logName: String

def logTrace(msg: ⇒ String, throwable: Throwable): Unit

def logTrace(msg: ⇒ String): Unit

def logWarning(msg: ⇒ String, throwable: Throwable): Unit

def logWarning(msg: ⇒ String): Unit

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

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

final def next(): UnsafeRow

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def outputForEmptyGroupingKeyWithoutInput(): UnsafeRow

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

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

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

def processCurrentSortedGroup(): Unit

Processes rows in the current group.

val processRow: (InternalRow, InternalRow) ⇒ Unit

def product[B >: UnsafeRow](implicit num: Numeric[B]): B

def reduce[A1 >: UnsafeRow](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: UnsafeRow](op: (B, UnsafeRow) ⇒ B): B

def reduceLeftOption[B >: UnsafeRow](op: (B, UnsafeRow) ⇒ B): Option[B]

def reduceOption[A1 >: UnsafeRow](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: UnsafeRow](op: (UnsafeRow, B) ⇒ B): B

def reduceRightOption[B >: UnsafeRow](op: (UnsafeRow, B) ⇒ B): Option[B]

def reversed: List[UnsafeRow]

def sameElements(that: Iterator[_]): Boolean

def scanLeft[B](z: B)(op: (B, UnsafeRow) ⇒ B): Iterator[B]

def scanRight[B](z: B)(op: (UnsafeRow, B) ⇒ B): Iterator[B]

def seq: Iterator[UnsafeRow]

def size: Int

def slice(from: Int, until: Int): Iterator[UnsafeRow]

def sliding[B >: UnsafeRow](size: Int, step: Int): GroupedIterator[B]

def span(p: (UnsafeRow) ⇒ Boolean): (Iterator[UnsafeRow], Iterator[UnsafeRow])

def sum[B >: UnsafeRow](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def take(n: Int): Iterator[UnsafeRow]

def takeWhile(p: (UnsafeRow) ⇒ Boolean): Iterator[UnsafeRow]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, UnsafeRow, Col[UnsafeRow]]): Col[UnsafeRow]

def toArray[B >: UnsafeRow](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: UnsafeRow]: Buffer[B]

def toIndexedSeq: IndexedSeq[UnsafeRow]

def toIterable: Iterable[UnsafeRow]

def toIterator: Iterator[UnsafeRow]

def toList: List[UnsafeRow]

def toMap[T, U](implicit ev: <:<[UnsafeRow, (T, U)]): Map[T, U]

def toSeq: Seq[UnsafeRow]

def toSet[B >: UnsafeRow]: Set[B]

def toStream: Stream[UnsafeRow]

def toString(): String

def toTraversable: Traversable[UnsafeRow]

def toVector: Vector[UnsafeRow]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (UnsafeRow) ⇒ Boolean): Iterator[UnsafeRow]

def zip[B](that: Iterator[B]): Iterator[(UnsafeRow, B)]

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

def zipWithIndex: Iterator[(UnsafeRow, Int)]

def /:\[A1 >: UnsafeRow](z: A1)(op: (A1, A1) ⇒ A1): A1