TileAssembler

Instance Constructors

new TileAssembler(colIndex: Expression, rowIndex: Expression, cellValue: Expression, tileCols: Expression, tileRows: Expression)
new TileAssembler(colIndex: Expression, rowIndex: Expression, cellValue: Expression, tileCols: Expression, tileRows: Expression, mutableAggBufferOffset: Int = 0, inputAggBufferOffset: Int = 0)

Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
final lazy val aggBufferAttributes: Seq[AttributeReference]

Definition Classes
TypedImperativeAggregate → AggregateFunction
final def aggBufferSchema: StructType

Definition Classes
TypedImperativeAggregate → AggregateFunction
def apply(number: Int): TreeNode[_]

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
lazy val canonicalized: Expression

Definition Classes
Expression
val cellValue: Expression
def checkInputDataTypes(): TypeCheckResult

Definition Classes
ExpectsInputTypes → Expression
def children: Seq[Expression]

Definition Classes
TileAssembler → TreeNode
def childrenResolved: Boolean

Definition Classes
Expression
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val colIndex: Expression
def collect[B](pf: PartialFunction[Expression, B]): Seq[B]

Definition Classes
TreeNode
def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]

Definition Classes
TreeNode
def collectLeaves(): Seq[Expression]

Definition Classes
TreeNode
lazy val containsChild: Set[TreeNode[_]]

Definition Classes
TreeNode
def createAggregationBuffer(): TileBuffer

Definition Classes
TileAssembler → TypedImperativeAggregate
def dataType: DataType

Definition Classes
TileAssembler → Expression
def defaultResult: Option[Literal]

Definition Classes
AggregateFunction
def deserialize(storageFormat: Array[Byte]): TileBuffer

Definition Classes
TileAssembler → TypedImperativeAggregate
lazy val deterministic: Boolean

Definition Classes
Expression
def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode

Attributes
protected
Definition Classes
CodegenFallback → Expression
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def eval(buffer: TileBuffer): InternalRow

Definition Classes
TileAssembler → TypedImperativeAggregate
final def eval(buffer: InternalRow): Any

Definition Classes
TypedImperativeAggregate → Expression
def fastEquals(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(f: (Expression) ⇒ Boolean): Option[Expression]

Definition Classes
TreeNode
def flatArguments: Iterator[Any]

Attributes
protected
Definition Classes
Expression
def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]

Definition Classes
TreeNode
final def foldable: Boolean

Definition Classes
AggregateFunction → Expression
def foreach(f: (Expression) ⇒ Unit): Unit

Definition Classes
TreeNode
def foreachUp(f: (Expression) ⇒ Unit): Unit

Definition Classes
TreeNode
def genCode(ctx: CodegenContext): ExprCode

Definition Classes
Expression
def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

Definition Classes
TreeNode
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
TreeNode → AnyRef → Any
final def initialize(buffer: InternalRow): Unit

Definition Classes
TypedImperativeAggregate → ImperativeAggregate
def innerChildren: Seq[TreeNode[_]]

Attributes
protected
Definition Classes
TreeNode
final lazy val inputAggBufferAttributes: Seq[AttributeReference]

Definition Classes
TypedImperativeAggregate → AggregateFunction
val inputAggBufferOffset: Int

Definition Classes
TileAssembler → ImperativeAggregate
def inputTypes: Seq[NumericType with Product with Serializable]

Definition Classes
TileAssembler → ExpectsInputTypes
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def jsonFields: List[JField]

Attributes
protected
Definition Classes
TreeNode
def makeCopy(newArgs: Array[AnyRef]): Expression

Definition Classes
TreeNode
def map[A](f: (Expression) ⇒ A): Seq[A]

Definition Classes
TreeNode
def mapChildren(f: (Expression) ⇒ Expression): Expression

Definition Classes
TreeNode
def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

Attributes
protected
Definition Classes
TreeNode
def merge(inBuf: TileBuffer, input: TileBuffer): TileBuffer

Definition Classes
TileAssembler → TypedImperativeAggregate
final def merge(buffer: InternalRow, inputBuffer: InternalRow): Unit

Definition Classes
TypedImperativeAggregate → ImperativeAggregate
val mutableAggBufferOffset: Int

Definition Classes
TileAssembler → ImperativeAggregate
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodeName: String

Definition Classes
TreeNode
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def nullable: Boolean

Definition Classes
TileAssembler → Expression
def numberedTreeString: String

Definition Classes
TreeNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

Attributes
protected
Definition Classes
TreeNode
def p(number: Int): Expression

Definition Classes
TreeNode
def prettyJson: String

Definition Classes
TreeNode
def prettyName: String

Definition Classes
TileAssembler → Expression
def references: AttributeSet

Definition Classes
Expression
lazy val resolved: Boolean

Definition Classes
Expression
val rowIndex: Expression
def semanticEquals(other: Expression): Boolean

Definition Classes
Expression
def semanticHash(): Int

Definition Classes
Expression
def serialize(buffer: TileBuffer): Array[Byte]

Definition Classes
TileAssembler → TypedImperativeAggregate
final def serializeAggregateBufferInPlace(buffer: InternalRow): Unit

Definition Classes
TypedImperativeAggregate
def simpleString: String

Definition Classes
Expression → TreeNode
def sql(isDistinct: Boolean): String

Definition Classes
AggregateFunction
def sql: String

Definition Classes
Expression
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val tileCols: Expression
val tileRows: Expression
def toAggString(isDistinct: Boolean): String

Definition Classes
AggregateFunction
def toAggregateExpression(isDistinct: Boolean): AggregateExpression

Definition Classes
AggregateFunction
def toAggregateExpression(): AggregateExpression

Definition Classes
AggregateFunction
def toJSON: String

Definition Classes
TreeNode
def toString(): String

Definition Classes
Expression → TreeNode → AnyRef → Any
def transform(rule: PartialFunction[Expression, Expression]): Expression

Definition Classes
TreeNode
def transformDown(rule: PartialFunction[Expression, Expression]): Expression

Definition Classes
TreeNode
def transformUp(rule: PartialFunction[Expression, Expression]): Expression

Definition Classes
TreeNode
def treeString(verbose: Boolean, addSuffix: Boolean): String

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
def update(inBuf: TileBuffer, input: InternalRow): TileBuffer

Definition Classes
TileAssembler → TypedImperativeAggregate
final def update(buffer: InternalRow, input: InternalRow): Unit

Definition Classes
TypedImperativeAggregate → ImperativeAggregate
final def verboseString: String

Definition Classes
Expression → TreeNode
def verboseStringWithSuffix: String

Definition Classes
TreeNode
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def withNewChildren(newChildren: Seq[Expression]): Expression

Definition Classes
TreeNode
def withNewInputAggBufferOffset(newInputAggBufferOffset: Int): ImperativeAggregate

Definition Classes
TileAssembler → ImperativeAggregate
def withNewMutableAggBufferOffset(newMutableAggBufferOffset: Int): ImperativeAggregate

Definition Classes
TileAssembler → ImperativeAggregate

Related Docs: object TileAssembler | package expressions

Instance Constructors

new TileAssembler(colIndex: Expression, rowIndex: Expression, cellValue: Expression, tileCols: Expression, tileRows: Expression)

new TileAssembler(colIndex: Expression, rowIndex: Expression, cellValue: Expression, tileCols: Expression, tileRows: Expression, mutableAggBufferOffset: Int = 0, inputAggBufferOffset: Int = 0)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final lazy val aggBufferAttributes: Seq[AttributeReference]

final def aggBufferSchema: StructType

def apply(number: Int): TreeNode[_]

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: Expression

val cellValue: Expression

def checkInputDataTypes(): TypeCheckResult

def children: Seq[Expression]

def childrenResolved: Boolean

def clone(): AnyRef

val colIndex: Expression

def collect[B](pf: PartialFunction[Expression, B]): Seq[B]

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

def collectLeaves(): Seq[Expression]

lazy val containsChild: Set[TreeNode[_]]

def createAggregationBuffer(): TileBuffer

def dataType: DataType

def defaultResult: Option[Literal]

def deserialize(storageFormat: Array[Byte]): TileBuffer

lazy val deterministic: Boolean

def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode

final def eq(arg0: AnyRef): Boolean

def eval(buffer: TileBuffer): InternalRow

final def eval(buffer: InternalRow): Any

def fastEquals(other: TreeNode[_]): Boolean

def finalize(): Unit

def find(f: (Expression) ⇒ Boolean): Option[Expression]

def flatArguments: Iterator[Any]

def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]

final def foldable: Boolean

def foreach(f: (Expression) ⇒ Unit): Unit

def foreachUp(f: (Expression) ⇒ Unit): Unit

def genCode(ctx: CodegenContext): ExprCode

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

final def getClass(): Class[_]

def hashCode(): Int

final def initialize(buffer: InternalRow): Unit

def innerChildren: Seq[TreeNode[_]]

final lazy val inputAggBufferAttributes: Seq[AttributeReference]

val inputAggBufferOffset: Int

def inputTypes: Seq[NumericType with Product with Serializable]

final def isInstanceOf[T0]: Boolean

def jsonFields: List[JField]

def makeCopy(newArgs: Array[AnyRef]): Expression

def map[A](f: (Expression) ⇒ A): Seq[A]

def mapChildren(f: (Expression) ⇒ Expression): Expression

def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

def merge(inBuf: TileBuffer, input: TileBuffer): TileBuffer

final def merge(buffer: InternalRow, inputBuffer: InternalRow): Unit

val mutableAggBufferOffset: Int

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def nullable: Boolean

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def p(number: Int): Expression

def prettyJson: String

def prettyName: String

def references: AttributeSet

lazy val resolved: Boolean

val rowIndex: Expression

def semanticEquals(other: Expression): Boolean

def semanticHash(): Int

def serialize(buffer: TileBuffer): Array[Byte]

final def serializeAggregateBufferInPlace(buffer: InternalRow): Unit

def simpleString: String