Class/Object

org.apache.spark.sql.execution

SHAMapAccessor

Related Docs: object SHAMapAccessor | package execution

Permalink

case class 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) extends SparkPlan with CodegenSupport with Product with Serializable

Linear Supertypes
CodegenSupport, SparkPlan, Serializable, Serializable, internal.Logging, QueryPlan[SparkPlan], TreeNode[SparkPlan], Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SHAMapAccessor
  2. CodegenSupport
  3. SparkPlan
  4. Serializable
  5. Serializable
  6. Logging
  7. QueryPlan
  8. TreeNode
  9. Product
  10. Equals
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. 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)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. val aggregateBufferVars: Seq[String]

    Permalink
  5. lazy val allAttributes: AttributeSeq

    Permalink

    All the attributes that are used for this plan.

    All the attributes that are used for this plan.

    Definition Classes
    QueryPlan
  6. val allocatorTerm: String

    Permalink
  7. def apply(number: Int): TreeNode[_]

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    Note that this cannot return BaseType because logical plan's plan node might return physical plan for innerChildren, e.g. in-memory relation logical plan node has a reference to the physical plan node it is referencing.

    Definition Classes
    TreeNode
  8. def argString: String

    Permalink

    Returns a string representing the arguments to this node, minus any children

    Returns a string representing the arguments to this node, minus any children

    Definition Classes
    TreeNode
  9. def asCode: String

    Permalink

    Returns a 'scala code' representation of this TreeNode and its children.

    Returns a 'scala code' representation of this TreeNode and its children. Intended for use when debugging where the prettier toString function is obfuscating the actual structure. In the case of 'pure' TreeNodes that only contain primitives and other TreeNodes, the result can be pasted in the REPL to build an equivalent Tree.

    Definition Classes
    TreeNode
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. val baseKeyHolderOffset: String

    Permalink
  12. val baseKeyObject: String

    Permalink
  13. val bbDataClass: String

    Permalink
  14. val bigDecimalClass: String

    Permalink
  15. val bigDecimalObjectClass: String

    Permalink
  16. val bigIntegerClass: String

    Permalink
  17. val byteArrayEqualsClass: String

    Permalink
  18. val byteBufferClass: String

    Permalink
  19. lazy val canonicalized: SparkPlan

    Permalink

    Canonicalized copy of this query plan.

    Canonicalized copy of this query plan.

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

    Permalink

    Returns a Seq of the children of this node.

    Returns a Seq of the children of this node. Children should not change. Immutability required for containsChild optimization

    Definition Classes
    SHAMapAccessorTreeNode
  21. val classPrefix: String

    Permalink
  22. lazy val cleanArgs: Seq[Any]

    Permalink

    Args that have cleaned such that differences in expression id should not affect equality

    Args that have cleaned such that differences in expression id should not affect equality

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

    Permalink
    Attributes
    protected
    Definition Classes
    QueryPlan
  24. def clearBroadcasts(removeFromDriver: Boolean = false): Unit

    Permalink

    Eagerly clear any broadcasts created by this plan execution.

    Eagerly clear any broadcasts created by this plan execution.

    Definition Classes
    SparkPlan
  25. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. val codeForLenOfSkippedTerm: String

    Permalink
  27. 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

    Permalink
  28. val codeSplitFuncParamsSize: Int

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

    Permalink

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

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

    Permalink

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

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

    Permalink

    Returns a Seq containing the leaves in this tree.

    Returns a Seq containing the leaves in this tree.

    Definition Classes
    TreeNode
  32. lazy val constraints: ExpressionSet

    Permalink

    An ExpressionSet that contains invariants about the rows output by this operator.

    An ExpressionSet that contains invariants about the rows output by this operator. For example, if this set contains the expression a = 2 then that expression is guaranteed to evaluate to true for all rows produced.

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

    Permalink

    Consume the generated columns or row from current SparkPlan, call its parent's doConsume().

    Consume the generated columns or row from current SparkPlan, call its parent's doConsume().

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

    Permalink
    Definition Classes
    TreeNode
  35. val ctx: CodegenContext

    Permalink
  36. val currentOffSetForMapLookupUpdt: String

    Permalink
  37. val decimalClass: String

    Permalink
  38. def declareNullVarsForAggBuffer(varNames: Seq[String]): String

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

    Permalink

    Generate the Java source code to process the rows from child SparkPlan.

    Generate the Java source code to process the rows from child SparkPlan.

    This should be override by subclass to support codegen.

    For example, Filter will generate the code like this:

    # code to evaluate the predicate expression, result is isNull1 and value2 if (isNull1 || !value2) continue; # call consume(), which will call parent.doConsume()

    Note: A plan can either consume the rows as UnsafeRow (row), or a list of variables (input).

    Definition Classes
    SHAMapAccessorCodegenSupport
  40. def doExecute(): RDD[InternalRow]

    Permalink

    Overridden by concrete implementations of SparkPlan.

    Overridden by concrete implementations of SparkPlan. Produces the result of the query as an RDD[InternalRow]

    Attributes
    protected
    Definition Classes
    SHAMapAccessorSparkPlan
  41. def doExecuteBroadcast[T](): Broadcast[T]

    Permalink

    Overridden by concrete implementations of SparkPlan.

    Overridden by concrete implementations of SparkPlan. Produces the result of the query as a broadcast variable.

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

    Permalink

    Overridden by concrete implementations of SparkPlan.

    Overridden by concrete implementations of SparkPlan. It is guaranteed to run before any execute of SparkPlan. This is helpful if we want to set up some state before executing the query, e.g., BroadcastHashJoin uses it to broadcast asynchronously.

    Note: the prepare method has already walked down the tree, so the implementation doesn't need to call children's prepare methods.

    This will only be called once, protected by this.

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

    Permalink

    Generate the Java source code to process, should be overridden by subclass to support codegen.

    Generate the Java source code to process, should be overridden by subclass to support codegen.

    doProduce() usually generate the framework, for example, aggregation could generate this:

    if (!initialized) { # create a hash map, then build the aggregation hash map # call child.produce() initialized = true; } while (hashmap.hasNext()) { row = hashmap.next(); # build the aggregation results # create variables for results # call consume(), which will call parent.doConsume() if (shouldStop()) return; }

    Attributes
    protected
    Definition Classes
    SHAMapAccessorCodegenSupport
  44. final def eq(arg0: AnyRef): Boolean

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

    Permalink

    Returns source code to evaluate the variables for required attributes, and clear the code of evaluated variables, to prevent them to be evaluated twice.

    Returns source code to evaluate the variables for required attributes, and clear the code of evaluated variables, to prevent them to be evaluated twice.

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

    Permalink

    Returns source code to evaluate all the variables, and clear the code of them, to prevent them to be evaluated twice.

    Returns source code to evaluate all the variables, and clear the code of them, to prevent them to be evaluated twice.

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

    Permalink

    Returns the result of this query as an RDD[InternalRow] by delegating to doExecute after preparations.

    Returns the result of this query as an RDD[InternalRow] by delegating to doExecute after preparations.

    Concrete implementations of SparkPlan should override doExecute.

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

    Permalink

    Returns the result of this query as a broadcast variable by delegating to doExecuteBroadcast after preparations.

    Returns the result of this query as a broadcast variable by delegating to doExecuteBroadcast after preparations.

    Concrete implementations of SparkPlan should override doExecuteBroadcast.

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

    Permalink

    Runs this query returning the result as an array.

    Runs this query returning the result as an array.

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

    Permalink

    Runs this query returning the result as an array, using external Row format.

    Runs this query returning the result as an array, using external Row format.

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

    Permalink

    Execute a query after preparing the query and adding query plan information to created RDDs for visualization.

    Execute a query after preparing the query and adding query plan information to created RDDs for visualization.

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

    Permalink

    Runs this query returning the first n rows as an array.

    Runs this query returning the first n rows as an array.

    This is modeled after RDD.take but never runs any job locally on the driver.

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

    Permalink

    Runs this query returning the result as an iterator of InternalRow.

    Runs this query returning the result as an iterator of InternalRow.

    Note: this will trigger multiple jobs (one for each partition).

    Definition Classes
    SparkPlan
  54. def explodeStruct(structVarName: String, structNullVarName: String, structType: StructType, nestingLevel: Int = 0): String

    Permalink
  55. final def expressions: Seq[Expression]

    Permalink

    Returns all of the expressions present in this query plan operator.

    Returns all of the expressions present in this query plan operator.

    Definition Classes
    QueryPlan
  56. def fastEquals(other: TreeNode[_]): Boolean

    Permalink

    Faster version of equality which short-circuits when two treeNodes are the same instance.

    Faster version of equality which short-circuits when two treeNodes are the same instance. We don't just override Object.equals, as doing so prevents the scala compiler from generating case class equals methods

    Definition Classes
    TreeNode
  57. def finalize(): Unit

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

    Permalink

    Find the first TreeNode that satisfies the condition specified by f.

    Find the first TreeNode that satisfies the condition specified by f. The condition is recursively applied to this node and all of its children (pre-order).

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

    Permalink

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

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

    Permalink

    Runs the given function on this node and then recursively on children.

    Runs the given function on this node and then recursively on children.

    f

    the function to be applied to each node in the tree.

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

    Permalink

    Runs the given function recursively on children then on this node.

    Runs the given function recursively on children then on this node.

    f

    the function to be applied to each node in the tree.

    Definition Classes
    TreeNode
  62. def generateCustomSHAMapClass(className: String, keyDataType: DataType): String

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

    Permalink

    Generate code to calculate the hash code for given column variables that correspond to the key columns in this class.

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

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

    Permalink
  66. 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

    Permalink

    Generate code to lookup the map or insert a new key, value if not found.

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

    Permalink

    Appends the string represent of this node and its children to the given StringBuilder.

    Appends the string represent of this node and its children to the given StringBuilder.

    The i-th element in lastChildren indicates whether the ancestor of the current node at depth i + 1 is the last child of its own parent node. The depth of the root node is 0, and lastChildren for the root node should be empty.

    Note that this traversal (numbering) order must be the same as getNodeNumbered.

    Definition Classes
    TreeNode
  68. def generateUpdate(bufferVars: Seq[ExprCode], aggBufferDataType: Seq[DataType]): String

    Permalink
  69. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  70. def getExplodedExprCodeAndDataTypeForStruct(parentStructVarName: String, st: StructType, nestingLevel: Int): (Seq[ExprCode], Seq[DataType])

    Permalink
  71. def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

    Permalink

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Attributes
    protected
    Definition Classes
    QueryPlan
  72. def hashCode(): Int

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  73. val hashMapTerm: String

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

    Permalink
  75. def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean = false): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  76. def initializeLogIfNecessary(isInterpreter: Boolean): Unit

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

    Permalink

    All the nodes that should be shown as a inner nested tree of this node.

    All the nodes that should be shown as a inner nested tree of this node. For example, this can be used to show sub-queries.

    Attributes
    protected
    Definition Classes
    QueryPlanTreeNode
  78. def inputRDDs(): Seq[RDD[InternalRow]]

    Permalink

    Returns all the RDDs of InternalRow which generates the input rows.

    Returns all the RDDs of InternalRow which generates the input rows.

    Note: right now we support up to two RDDs.

    Definition Classes
    SHAMapAccessorCodegenSupport
  79. def inputSet: AttributeSet

    Permalink

    The set of all attributes that are input to this operator by its children.

    The set of all attributes that are input to this operator by its children.

    Definition Classes
    QueryPlan
  80. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  81. def isTraceEnabled(): Boolean

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

    Permalink
    Attributes
    protected
    Definition Classes
    TreeNode
  83. val keyBytesHolderVarTerm: String

    Permalink
  84. val keyExistedTerm: String

    Permalink
  85. val keyExprs: Seq[Expression]

    Permalink
  86. val keyHolderCapacityTerm: String

    Permalink
  87. val keyValSize: Int

    Permalink
  88. def log: Logger

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  95. def logName: String

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

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

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

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

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

    Permalink

    Return a LongSQLMetric according to the name.

    Return a LongSQLMetric according to the name.

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

    Permalink

    Overridden make copy also propagates sqlContext to copied plan.

    Overridden make copy also propagates sqlContext to copied plan.

    newArgs

    the new product arguments.

    Definition Classes
    SparkPlanTreeNode
  102. def map[A](f: (SparkPlan) ⇒ A): Seq[A]

    Permalink

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    f

    the function to be applied.

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

    Permalink

    Returns a copy of this node where f has been applied to all the nodes children.

    Returns a copy of this node where f has been applied to all the nodes children.

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

    Permalink

    Apply a map function to each expression present in this query operator, and return a new query operator based on the mapped expressions.

    Apply a map function to each expression present in this query operator, and return a new query operator based on the mapped expressions.

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

    Permalink

    Efficient alternative to productIterator.map(f).toArray.

    Efficient alternative to productIterator.map(f).toArray.

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

    Permalink

    Return all metadata that describes more details of this SparkPlan.

    Return all metadata that describes more details of this SparkPlan.

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

    Permalink

    Creates a metric using the specified name.

    Creates a metric using the specified name.

    returns

    name of the variable representing the metric

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

    Permalink

    Return all metrics containing metrics of this SparkPlan.

    Return all metrics containing metrics of this SparkPlan.

    Definition Classes
    SparkPlan
  109. def missingInput: AttributeSet

    Permalink

    Attributes that are referenced by expressions but not provided by this nodes children.

    Attributes that are referenced by expressions but not provided by this nodes children. Subclasses should override this method if they produce attributes internally as it is used by assertions designed to prevent the construction of invalid plans.

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

    Permalink
    Definition Classes
    AnyRef
  111. def newMutableProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute], useSubexprElimination: Boolean = false): MutableProjection

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

    Permalink

    Creates a row ordering for the given schema, in natural ascending order.

    Creates a row ordering for the given schema, in natural ascending order.

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    SparkPlan
  115. def nodeName: String

    Permalink

    Returns the name of this type of TreeNode.

    Returns the name of this type of TreeNode. Defaults to the class name. Note that we remove the "Exec" suffix for physical operators here.

    Definition Classes
    TreeNode
  116. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  117. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  118. val nullAggsBitsetTerm: String

    Permalink
  119. val nullKeysBitsetTerm: String

    Permalink
  120. val numBytesForNullAggBits: Int

    Permalink
  121. val numBytesForNullKeyBits: Int

    Permalink
  122. val numKeyBytesTerm: String

    Permalink
  123. val numValueBytes: Int

    Permalink
  124. def numberedTreeString: String

    Permalink

    Returns a string representation of the nodes in this tree, where each operator is numbered.

    Returns a string representation of the nodes in this tree, where each operator is numbered. The numbers can be used with TreeNode.apply to easily access specific subtrees.

    The numbers are based on depth-first traversal of the tree (with innerChildren traversed first before children).

    Definition Classes
    TreeNode
  125. val origin: Origin

    Permalink
    Definition Classes
    TreeNode
  126. def otherCopyArgs: Seq[AnyRef]

    Permalink

    Args to the constructor that should be copied, but not transformed.

    Args to the constructor that should be copied, but not transformed. These are appended to the transformed args automatically by makeCopy

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

    Permalink
    Definition Classes
    SHAMapAccessorQueryPlan
  128. def outputOrdering: Seq[SortOrder]

    Permalink

    Specifies how data is ordered in each partition.

    Specifies how data is ordered in each partition.

    Definition Classes
    SparkPlan
  129. def outputPartitioning: Partitioning

    Permalink

    Specifies how data is partitioned across different nodes in the cluster.

    Specifies how data is partitioned across different nodes in the cluster.

    Definition Classes
    SparkPlan
  130. def outputSet: AttributeSet

    Permalink

    Returns the set of attributes that are output by this node.

    Returns the set of attributes that are output by this node.

    Definition Classes
    QueryPlan
  131. val overflowHashMapsTerm: String

    Permalink
  132. def p(number: Int): SparkPlan

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    This is a variant of apply that returns the node as BaseType (if the type matches).

    Definition Classes
    TreeNode
  133. var parent: CodegenSupport

    Permalink

    Which SparkPlan is calling produce() of this one.

    Which SparkPlan is calling produce() of this one. It's itself for the first SparkPlan.

    Attributes
    protected
    Definition Classes
    CodegenSupport
  134. val platformClass: String

    Permalink
  135. final def prepare(): Unit

    Permalink

    Prepare a SparkPlan for execution.

    Prepare a SparkPlan for execution. It's idempotent.

    Definition Classes
    SparkPlan
  136. def prepareSubqueries(): Unit

    Permalink

    Finds scalar subquery expressions in this plan node and starts evaluating them.

    Finds scalar subquery expressions in this plan node and starts evaluating them.

    Attributes
    protected
    Definition Classes
    SparkPlan
  137. def prettyJson: String

    Permalink
    Definition Classes
    TreeNode
  138. val previousSingleKey_Position_LenTerm: Option[(String, String, String)]

    Permalink
  139. def printSchema(): Unit

    Permalink

    Prints out the schema in the tree format

    Prints out the schema in the tree format

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

    Permalink

    Returns Java source code to process the rows from input RDD.

    Returns Java source code to process the rows from input RDD.

    Definition Classes
    CodegenSupport
  141. def producedAttributes: AttributeSet

    Permalink

    The set of all attributes that are produced by this node.

    The set of all attributes that are produced by this node.

    Definition Classes
    QueryPlan
  142. def readNullBitsCode(currentValueOffsetTerm: String, nullBitsetTerm: String, numBytesForNullBits: Int): String

    Permalink
  143. 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])

    Permalink
  144. def references: AttributeSet

    Permalink

    All Attributes that appear in expressions from this operator.

    All Attributes that appear in expressions from this operator. Note that this set does not include attributes that are implicitly referenced by being passed through to the output tuple.

    Definition Classes
    QueryPlan
  145. def requiredChildDistribution: Seq[Distribution]

    Permalink

    Specifies any partition requirements on the input data for this operator.

    Specifies any partition requirements on the input data for this operator.

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

    Permalink

    Specifies sort order for each partition requirements on the input data for this operator.

    Specifies sort order for each partition requirements on the input data for this operator.

    Definition Classes
    SparkPlan
  147. def resetMetrics(): Unit

    Permalink

    Reset all the metrics.

    Reset all the metrics.

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

    Permalink

    Returns true when the given query plan will return the same results as this query plan.

    Returns true when the given query plan will return the same results as this query plan.

    Since its likely undecidable to generally determine if two given plans will produce the same results, it is okay for this function to return false, even if the results are actually the same. Such behavior will not affect correctness, only the application of performance enhancements like caching. However, it is not acceptable to return true if the results could possibly be different.

    By default this function performs a modified version of equality that is tolerant of cosmetic differences like attribute naming and or expression id differences. Operators that can do better should override this function.

    Definition Classes
    QueryPlan
  149. lazy val schema: StructType

    Permalink
    Definition Classes
    QueryPlan
  150. def schemaString: String

    Permalink

    Returns the output schema in the tree format.

    Returns the output schema in the tree format.

    Definition Classes
    QueryPlan
  151. val session: SnappySession

    Permalink
  152. val shaMapClassName: String

    Permalink
  153. def simpleString: String

    Permalink

    ONE line description of this node.

    ONE line description of this node.

    Definition Classes
    QueryPlanTreeNode
  154. val sizeAndNumNotNullFuncForStringArr: String

    Permalink
  155. val skipLenForAttribIndex: Int

    Permalink
  156. def sparkContext: SparkContext

    Permalink
    Attributes
    protected
    Definition Classes
    SparkPlan
  157. val splitAggCode: Boolean

    Permalink
  158. val splitGroupByKeyCode: Boolean

    Permalink
  159. final val sqlContext: SQLContext

    Permalink

    A handle to the SQL Context that was used to create this plan.

    A handle to the SQL Context that was used to create this plan. Since many operators need access to the sqlContext for RDD operations or configuration this field is automatically populated by the query planning infrastructure.

    Definition Classes
    SparkPlan
  160. def statePrefix: String

    Permalink

    A prefix string used when printing the plan.

    A prefix string used when printing the plan.

    We use "!" to indicate an invalid plan, and "'" to indicate an unresolved plan.

    Attributes
    protected
    Definition Classes
    QueryPlan
  161. val storedAggNullBitsTerm: Option[String]

    Permalink
  162. val storedKeyNullBitsTerm: Option[String]

    Permalink
  163. def stringArgs: Iterator[Any]

    Permalink

    The arguments that should be included in the arg string.

    The arguments that should be included in the arg string. Defaults to the productIterator.

    Attributes
    protected
    Definition Classes
    TreeNode
  164. val subexpressionEliminationEnabled: Boolean

    Permalink
    Definition Classes
    SparkPlan
  165. def subqueries: Seq[SparkPlan]

    Permalink

    All the subqueries of current plan.

    All the subqueries of current plan.

    Definition Classes
    QueryPlan
  166. def supportCodegen: Boolean

    Permalink

    Whether this SparkPlan support whole stage codegen or not.

    Whether this SparkPlan support whole stage codegen or not.

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

    Permalink
    Definition Classes
    AnyRef
  168. def toJSON: String

    Permalink
    Definition Classes
    TreeNode
  169. def toString(): String

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

    Permalink

    Returns a copy of this node where rule has been recursively applied to the tree.

    Returns a copy of this node where rule has been recursively applied to the tree. When rule does not apply to a given node it is left unchanged. Users should not expect a specific directionality. If a specific directionality is needed, transformDown or transformUp should be used.

    rule

    the function use to transform this nodes children

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

    Permalink

    Returns the result of running transformExpressions on this node and all its children.

    Returns the result of running transformExpressions on this node and all its children.

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

    Permalink

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order).

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order). When rule does not apply to a given node it is left unchanged.

    rule

    the function used to transform this nodes children

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

    Permalink

    Runs transform with rule on all expressions present in this query operator.

    Runs transform with rule on all expressions present in this query operator. Users should not expect a specific directionality. If a specific directionality is needed, transformExpressionsDown or transformExpressionsUp should be used.

    rule

    the rule to be applied to every expression in this operator.

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

    Permalink

    Runs transformDown with rule on all expressions present in this query operator.

    Runs transformDown with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

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

    Permalink

    Runs transformUp with rule on all expressions present in this query operator.

    Runs transformUp with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

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

    Permalink

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order).

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order). When rule does not apply to a given node, it is left unchanged.

    rule

    the function use to transform this nodes children

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

    Permalink
    Definition Classes
    TreeNode
  178. def treeString: String

    Permalink

    Returns a string representation of the nodes in this tree

    Returns a string representation of the nodes in this tree

    Definition Classes
    TreeNode
  179. val typeUtiltiesObjectClass: String

    Permalink
  180. val unsafeArrayClass: String

    Permalink
  181. val unsafeClass: String

    Permalink
  182. val unsafeRowClass: String

    Permalink
  183. val useCustomHashMap: Boolean

    Permalink
  184. def usedInputs: AttributeSet

    Permalink

    The subset of inputSet those should be evaluated before this plan.

    The subset of inputSet those should be evaluated before this plan.

    We will use this to insert some code to access those columns that are actually used by current plan before calling doConsume().

    Definition Classes
    CodegenSupport
  185. def validConstraints: Set[Expression]

    Permalink

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic.

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic. These constraints are then canonicalized and filtered automatically to contain only those attributes that appear in the outputSet.

    See Canonicalize for more details.

    Attributes
    protected
    Definition Classes
    QueryPlan
  186. val valueDataCapacityTerm: String

    Permalink
  187. val valueDataTerm: String

    Permalink
  188. val valueExprs: Seq[Expression]

    Permalink
  189. val valueOffsetTerm: String

    Permalink
  190. val vdBaseObjectTerm: String

    Permalink
  191. val vdBaseOffsetTerm: String

    Permalink
  192. def verboseString: String

    Permalink

    ONE line description of this node with more information

    ONE line description of this node with more information

    Definition Classes
    QueryPlanTreeNode
  193. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  196. def waitForSubqueries(): Unit

    Permalink

    Blocks the thread until all subqueries finish evaluation and update the results.

    Blocks the thread until all subqueries finish evaluation and update the results.

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

    Permalink

    Returns a copy of this node with the children replaced.

    Returns a copy of this node with the children replaced. TODO: Validate somewhere (in debug mode?) that children are ordered correctly.

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

    Permalink
  199. def writeNullBitsAt(baseObjectTerm: String, offsetToWriteTerm: String, nullBitsTerm: String, numBytesForNullBits: Int): String

    Permalink

Inherited from CodegenSupport

Inherited from SparkPlan

Inherited from Serializable

Inherited from Serializable

Inherited from internal.Logging

Inherited from QueryPlan[SparkPlan]

Inherited from TreeNode[SparkPlan]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped