SHAMapAccessor

Instance Constructors

new SHAMapAccessor(session: SnappySession, ctx: CodegenContext, keyExprs: Seq[Expression], valueExprs: Seq[Expression], classPrefix: String, hashMapTerm: String, overflowHashMapsTerm: String, keyValSize: Int, valueOffsetTerm: String, numKeyBytesTerm: String, numValueBytes: Int, currentOffSetForMapLookupUpdt: String, valueDataTerm: String, vdBaseObjectTerm: String, vdBaseOffsetTerm: String, nullKeysBitsetTerm: String, numBytesForNullKeyBits: Int, allocatorTerm: String, numBytesForNullAggBits: Int, nullAggsBitsetTerm: String, sizeAndNumNotNullFuncForStringArr: String, keyBytesHolderVarTerm: String, baseKeyObject: String, baseKeyHolderOffset: String, keyExistedTerm: String, skipLenForAttribIndex: Int, codeForLenOfSkippedTerm: String, valueDataCapacityTerm: String, storedAggNullBitsTerm: Option[String], storedKeyNullBitsTerm: Option[String], aggregateBufferVars: Seq[String], keyHolderCapacityTerm: String, shaMapClassName: String, useCustomHashMap: Boolean, previousSingleKey_Position_LenTerm: Option[(String, String, String)], codeSplitFuncParamsSize: Int, splitAggCode: Boolean, splitGroupByKeyCode: Boolean)

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
val aggregateBufferVars: Seq[String]
lazy val allAttributes: AttributeSeq

Definition Classes
QueryPlan
val allocatorTerm: String
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
val baseKeyHolderOffset: String
val baseKeyObject: String
val bbDataClass: String
val bigDecimalClass: String
val bigDecimalObjectClass: String
val bigIntegerClass: String
val byteArrayEqualsClass: String
val byteBufferClass: String
lazy val canonicalized: SparkPlan

Attributes
protected
Definition Classes
QueryPlan
def children: Seq[SparkPlan]

Definition Classes
SHAMapAccessor → TreeNode
val classPrefix: String
lazy val cleanArgs: Seq[Any]

Attributes
protected
Definition Classes
QueryPlan
def cleanExpression(e: Expression): Expression

Attributes
protected
Definition Classes
QueryPlan
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val codeForLenOfSkippedTerm: String
def codeSplit(dataTypes: Seq[DataType], vars: Seq[ExprCode], baseMethod: String, nestingLevel: Int, methodFound: (String, Seq[(ExprCode, DataType)], Int, Boolean, Int) ⇒ String, methodNotFound: (String, Seq[(ExprCode, DataType)], Seq[(ExprCode, DataType)], Int, Boolean, Int) ⇒ (String, String), separator: String, prefix: String, suffix: String, isGroupByKeys: Boolean): String
val codeSplitFuncParamsSize: Int
def collect[B](pf: PartialFunction[SparkPlan, B]): Seq[B]

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

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

Definition Classes
TreeNode
lazy val constraints: ExpressionSet

Definition Classes
QueryPlan
final def consume(ctx: CodegenContext, outputVars: Seq[ExprCode], row: String): String

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

Definition Classes
TreeNode
val ctx: CodegenContext
val currentOffSetForMapLookupUpdt: String
val decimalClass: String
def declareNullVarsForAggBuffer(varNames: Seq[String]): String
def doConsume(ctx: CodegenContext, input: Seq[ExprCode], row: ExprCode): String

Definition Classes
SHAMapAccessor → CodegenSupport
def doExecute(): RDD[InternalRow]

Attributes
protected
Definition Classes
SHAMapAccessor → SparkPlan
def doExecuteBroadcast[T](): Broadcast[T]

Attributes
protected[org.apache.spark.sql]
Definition Classes
SparkPlan
def doPrepare(): Unit

Attributes
protected
Definition Classes
SparkPlan
def doProduce(ctx: CodegenContext): String

Attributes
protected
Definition Classes
SHAMapAccessor → CodegenSupport
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def evaluateRequiredVariables(attributes: Seq[Attribute], variables: Seq[ExprCode], required: AttributeSet): String

Attributes
protected
Definition Classes
CodegenSupport
def evaluateVariables(variables: Seq[ExprCode]): String

Attributes
protected
Definition Classes
CodegenSupport
final def execute(): RDD[InternalRow]

Definition Classes
SparkPlan
final def executeBroadcast[T](): Broadcast[T]

Definition Classes
SparkPlan
def executeCollect(): Array[InternalRow]

Definition Classes
SparkPlan
def executeCollectPublic(): Array[Row]

Definition Classes
SparkPlan
final def executeQuery[T](query: ⇒ T): T

Attributes
protected
Definition Classes
SparkPlan
def executeTake(n: Int): Array[InternalRow]

Definition Classes
SparkPlan
def executeToIterator(): Iterator[InternalRow]

Definition Classes
SparkPlan
def explodeStruct(structVarName: String, structNullVarName: String, structType: StructType, nestingLevel: Int = 0): String
final def expressions: Seq[Expression]

Definition Classes
QueryPlan
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: (SparkPlan) ⇒ Boolean): Option[SparkPlan]

Definition Classes
TreeNode
def flatMap[A](f: (SparkPlan) ⇒ TraversableOnce[A]): Seq[A]

Definition Classes
TreeNode
def foreach(f: (SparkPlan) ⇒ Unit): Unit

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

Definition Classes
TreeNode
def generateCustomSHAMapClass(className: String, keyDataType: DataType): String
def generateHashCode(hashVar: Array[String], keyVars: Seq[ExprCode], keysDataType: Seq[DataType], skipDeclaration: Boolean = false, register: Boolean = true): String

Generate code to calculate the hash code for given column variables that correspond to the key columns in this class.
def generateKeyBytesHolderCodeOrEmptyString(numKeyBytesVar: String, numValueBytes: Int, keyVars: Seq[ExprCode], keysDataType: Seq[DataType], aggregatesDataType: Seq[DataType], valueInitVars: Seq[ExprCode]): String
def generateKeySizeCode(keyVars: Seq[ExprCode], keysDataType: Seq[DataType], numBytesForNullBits: Int, nestingLevel: Int = 0): String
def generateMapGetOrInsert(valueInitVars: Seq[ExprCode], valueInitCode: String, evaluatedInputCode: String, keyVars: Seq[ExprCode], keysDataType: Seq[DataType], aggregateDataTypes: Seq[DataType], dictionaryCode: Option[DictionaryCode], dictionaryArrayTerm: String, dictionaryArraySizeTerm: String, aggFuncDependentOnGroupByKey: Boolean): String

Generate code to lookup the map or insert a new key, value if not found.
def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String): StringBuilder

Definition Classes
TreeNode
def generateUpdate(bufferVars: Seq[ExprCode], aggBufferDataType: Seq[DataType]): String
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getExplodedExprCodeAndDataTypeForStruct(parentStructVarName: String, st: StructType, nestingLevel: Int): (Seq[ExprCode], Seq[DataType])
def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
def hashCode(): Int

Definition Classes
TreeNode → AnyRef → Any
val hashMapTerm: String
def initKeyOrBufferVal(dataTypes: Seq[DataType], varNames: Seq[String]): String
def initializeLogIfNecessary(isInterpreter: Boolean): Unit

Attributes
protected
Definition Classes
Logging
def innerChildren: Seq[QueryPlan[_]]

Attributes
protected
Definition Classes
QueryPlan → TreeNode
def inputRDDs(): Seq[RDD[InternalRow]]

Definition Classes
SHAMapAccessor → CodegenSupport
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
def jsonFields: List[JField]

Attributes
protected
Definition Classes
TreeNode
val keyBytesHolderVarTerm: String
val keyExistedTerm: String
val keyExprs: Seq[Expression]
val keyHolderCapacityTerm: String
val keyValSize: Int
def log: Logger

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logName: String

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def longMetric(name: String): SQLMetric

Definition Classes
SparkPlan
def makeCopy(newArgs: Array[AnyRef]): SparkPlan

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

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

Definition Classes
TreeNode
def mapExpressions(f: (Expression) ⇒ Expression): SHAMapAccessor.this.type

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

Attributes
protected
Definition Classes
TreeNode
def metadata: Map[String, String]

Definition Classes
SparkPlan
def metricTerm(ctx: CodegenContext, name: String): String

Definition Classes
CodegenSupport
def metrics: Map[String, SQLMetric]

Definition Classes
SparkPlan
def missingInput: AttributeSet

Definition Classes
QueryPlan
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newMutableProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute], useSubexprElimination: Boolean): MutableProjection

Attributes
protected
Definition Classes
SparkPlan
def newNaturalAscendingOrdering(dataTypes: Seq[DataType]): Ordering[InternalRow]

Attributes
protected
Definition Classes
SparkPlan
def newOrdering(order: Seq[SortOrder], inputSchema: Seq[Attribute]): Ordering[InternalRow]

Attributes
protected
Definition Classes
SparkPlan
def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): Predicate

Attributes
protected
Definition Classes
SparkPlan
def nodeName: String

Definition Classes
TreeNode
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val nullAggsBitsetTerm: String
val nullKeysBitsetTerm: String
val numBytesForNullAggBits: Int
val numBytesForNullKeyBits: Int
val numKeyBytesTerm: String
val numValueBytes: Int
def numberedTreeString: String

Definition Classes
TreeNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

Attributes
protected
Definition Classes
TreeNode
def output: Seq[Attribute]

Definition Classes
SHAMapAccessor → QueryPlan
def outputOrdering: Seq[SortOrder]

Definition Classes
SparkPlan
def outputPartitioning: Partitioning

Definition Classes
SparkPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
val overflowHashMapsTerm: String
def p(number: Int): SparkPlan

Definition Classes
TreeNode
var parent: CodegenSupport

Attributes
protected
Definition Classes
CodegenSupport
val platformClass: String
final def prepare(): Unit

Definition Classes
SparkPlan
def prepareSubqueries(): Unit

Attributes
protected
Definition Classes
SparkPlan
def prettyJson: String

Definition Classes
TreeNode
val previousSingleKey_Position_LenTerm: Option[(String, String, String)]
def printSchema(): Unit

Definition Classes
QueryPlan
final def produce(ctx: CodegenContext, parent: CodegenSupport): String

Definition Classes
CodegenSupport
def producedAttributes: AttributeSet

Definition Classes
QueryPlan
def readNullBitsCode(currentValueOffsetTerm: String, nullBitsetTerm: String, numBytesForNullBits: Int): String
def readVarsFromBBMap(dataTypes: Seq[DataType], varNames: Seq[String], currentValueOffsetTerm: String, isKey: Boolean, nullBitTerm: String, numBytesForNullBits: Int, skipNullBitsCode: Boolean, splitCode: Boolean, useTheseNullVarsForAggBuffer: Option[Seq[String]], castVarToDataType: Boolean = false): (Option[String], Seq[ExprCode])
def references: AttributeSet

Definition Classes
QueryPlan
def requiredChildDistribution: Seq[Distribution]

Definition Classes
SparkPlan
def requiredChildOrdering: Seq[Seq[SortOrder]]

Definition Classes
SparkPlan
def resetMetrics(): Unit

Definition Classes
SparkPlan
def sameResult(plan: SparkPlan): Boolean

Definition Classes
QueryPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
val session: SnappySession
val shaMapClassName: String
def simpleString: String

Definition Classes
QueryPlan → TreeNode
val sizeAndNumNotNullFuncForStringArr: String
val skipLenForAttribIndex: Int
def sparkContext: SparkContext

Attributes
protected
Definition Classes
SparkPlan
val splitAggCode: Boolean
val splitGroupByKeyCode: Boolean
final val sqlContext: SQLContext

Definition Classes
SparkPlan
def statePrefix: String

Attributes
protected
Definition Classes
QueryPlan
val storedAggNullBitsTerm: Option[String]
val storedKeyNullBitsTerm: Option[String]
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
val subexpressionEliminationEnabled: Boolean

Definition Classes
SparkPlan
def subqueries: Seq[SparkPlan]

Definition Classes
QueryPlan
def supportCodegen: Boolean

Definition Classes
CodegenSupport
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toJSON: String

Definition Classes
TreeNode
def toString(): String

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

Definition Classes
TreeNode
def transformAllExpressions(rule: PartialFunction[Expression, Expression]): SHAMapAccessor.this.type

Definition Classes
QueryPlan
def transformDown(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

Definition Classes
TreeNode
def transformExpressions(rule: PartialFunction[Expression, Expression]): SHAMapAccessor.this.type

Definition Classes
QueryPlan
def transformExpressionsDown(rule: PartialFunction[Expression, Expression]): SHAMapAccessor.this.type

Definition Classes
QueryPlan
def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): SHAMapAccessor.this.type

Definition Classes
QueryPlan
def transformUp(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
val typeUtiltiesObjectClass: String
val unsafeArrayClass: String
val unsafeClass: String
val unsafeRowClass: String
val useCustomHashMap: Boolean
def usedInputs: AttributeSet

Definition Classes
CodegenSupport
def validConstraints: Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
val valueDataCapacityTerm: String
val valueDataTerm: String
val valueExprs: Seq[Expression]
val valueOffsetTerm: String
val vdBaseObjectTerm: String
val vdBaseOffsetTerm: String
def verboseString: String

Definition Classes
QueryPlan → 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 waitForSubqueries(): Unit

Attributes
protected
Definition Classes
SparkPlan
def withNewChildren(newChildren: Seq[SparkPlan]): SparkPlan

Definition Classes
TreeNode
def writeKeyOrValue(baseObjectTerm: String, offsetTerm: String, dataTypes: Seq[DataType], varsToWrite: Seq[ExprCode], nullBitsTerm: String, numBytesForNullBits: Int, isKey: Boolean, skipNullEvalCode: Boolean, nestingLevel: Int = 0): String
def writeNullBitsAt(baseObjectTerm: String, offsetToWriteTerm: String, nullBitsTerm: String, numBytesForNullBits: Int): String

Related Docs: object SHAMapAccessor | package execution

Instance Constructors

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val aggregateBufferVars: Seq[String]

lazy val allAttributes: AttributeSeq

val allocatorTerm: String

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

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

val baseKeyHolderOffset: String

val baseKeyObject: String

val bbDataClass: String

val bigDecimalClass: String

val bigDecimalObjectClass: String

val bigIntegerClass: String

val byteArrayEqualsClass: String

val byteBufferClass: String

lazy val canonicalized: SparkPlan

def children: Seq[SparkPlan]

val classPrefix: String

lazy val cleanArgs: Seq[Any]

def cleanExpression(e: Expression): Expression

def clone(): AnyRef

val codeForLenOfSkippedTerm: String

val codeSplitFuncParamsSize: Int

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

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

def collectLeaves(): Seq[SparkPlan]

lazy val constraints: ExpressionSet

final def consume(ctx: CodegenContext, outputVars: Seq[ExprCode], row: String): String

lazy val containsChild: Set[TreeNode[_]]

val ctx: CodegenContext

val currentOffSetForMapLookupUpdt: String

val decimalClass: String

def declareNullVarsForAggBuffer(varNames: Seq[String]): String

def doConsume(ctx: CodegenContext, input: Seq[ExprCode], row: ExprCode): String

def doExecute(): RDD[InternalRow]

def doExecuteBroadcast[T](): Broadcast[T]

def doPrepare(): Unit

def doProduce(ctx: CodegenContext): String

final def eq(arg0: AnyRef): Boolean

def evaluateRequiredVariables(attributes: Seq[Attribute], variables: Seq[ExprCode], required: AttributeSet): String

def evaluateVariables(variables: Seq[ExprCode]): String

final def execute(): RDD[InternalRow]

final def executeBroadcast[T](): Broadcast[T]

def executeCollect(): Array[InternalRow]

def executeCollectPublic(): Array[Row]

final def executeQuery[T](query: ⇒ T): T

def executeTake(n: Int): Array[InternalRow]

def executeToIterator(): Iterator[InternalRow]

def explodeStruct(structVarName: String, structNullVarName: String, structType: StructType, nestingLevel: Int = 0): String

final def expressions: Seq[Expression]

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

def finalize(): Unit

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

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

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

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

def generateCustomSHAMapClass(className: String, keyDataType: DataType): String

def generateHashCode(hashVar: Array[String], keyVars: Seq[ExprCode], keysDataType: Seq[DataType], skipDeclaration: Boolean = false, register: Boolean = true): String

def generateKeyBytesHolderCodeOrEmptyString(numKeyBytesVar: String, numValueBytes: Int, keyVars: Seq[ExprCode], keysDataType: Seq[DataType], aggregatesDataType: Seq[DataType], valueInitVars: Seq[ExprCode]): String

def generateKeySizeCode(keyVars: Seq[ExprCode], keysDataType: Seq[DataType], numBytesForNullBits: Int, nestingLevel: Int = 0): String

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

def generateUpdate(bufferVars: Seq[ExprCode], aggBufferDataType: Seq[DataType]): String

final def getClass(): Class[_]

def getExplodedExprCodeAndDataTypeForStruct(parentStructVarName: String, st: StructType, nestingLevel: Int): (Seq[ExprCode], Seq[DataType])

def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

def hashCode(): Int

val hashMapTerm: String

def initKeyOrBufferVal(dataTypes: Seq[DataType], varNames: Seq[String]): String

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputRDDs(): Seq[RDD[InternalRow]]

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean