Packages

c

com.nvidia.spark.rapids

GpuNamedLambdaVariable

case class GpuNamedLambdaVariable(name: String, dataType: DataType, nullable: Boolean, exprId: ExprId = NamedExpression.newExprId) extends GpuLeafExpression with NamedExpression with GpuUnevaluable with Product with Serializable

A named lambda variable. In Spark on the CPU this includes an AtomicReference to the value that is updated each time a lambda function is called. On the GPU we have to bind this and turn it into a GpuBoundReference for a modified input batch. In the future this should also work with AST when cudf supports that type of operation.

Linear Supertypes
Serializable, Serializable, GpuUnevaluable, NamedExpression, GpuLeafExpression, ShimExpression, GpuExpression, Expression, TreeNode[Expression], Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GpuNamedLambdaVariable
  2. Serializable
  3. Serializable
  4. GpuUnevaluable
  5. NamedExpression
  6. GpuLeafExpression
  7. ShimExpression
  8. GpuExpression
  9. Expression
  10. TreeNode
  11. Product
  12. Equals
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GpuNamedLambdaVariable(name: String, dataType: DataType, nullable: Boolean, exprId: ExprId = NamedExpression.newExprId)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(number: Int): TreeNode[_]
    Definition Classes
    TreeNode
  5. def argString(maxFields: Int): String
    Definition Classes
    TreeNode
  6. def asCode: String
    Definition Classes
    TreeNode
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. lazy val canonicalized: Expression
    Definition Classes
    GpuExpression → Expression
  9. def checkInputDataTypes(): TypeCheckResult
    Definition Classes
    Expression
  10. final def children: Seq[Expression]
    Definition Classes
    GpuLeafExpression → TreeNode
  11. def childrenResolved: Boolean
    Definition Classes
    Expression
  12. def clone(): Expression
    Definition Classes
    TreeNode → AnyRef
  13. def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
    Definition Classes
    TreeNode
  14. def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
    Definition Classes
    TreeNode
  15. def collectLeaves(): Seq[Expression]
    Definition Classes
    TreeNode
  16. final def columnarEval(batch: ColumnarBatch): GpuColumnVector

    Returns the result of evaluating this expression on the entire ColumnarBatch.

    Returns the result of evaluating this expression on the entire ColumnarBatch. The result of calling this is a GpuColumnVector.

    By convention any GpuColumnVector returned by columnarEval is owned by the caller and will need to be closed by them. This can happen by putting it into a ColumnarBatch and closing the batch or by closing the vector directly if it is a temporary value.

    Definition Classes
    GpuUnevaluable → GpuExpression
  17. final def columnarEvalAny(batch: ColumnarBatch): Any

    Returns the result of evaluating this expression on the entire ColumnarBatch.

    Returns the result of evaluating this expression on the entire ColumnarBatch. The result of calling this may be a single GpuColumnVector or a scalar value. Scalar values typically happen if they are a part of the expression i.e. col("a") + 100. In this case the 100 is a literal that Add would have to be able to handle.

    By convention any AutoCloseable returned by columnarEvalAny is owned by the caller and will need to be closed by them.

    Definition Classes
    GpuUnevaluable → GpuExpression
  18. lazy val containsChild: Set[TreeNode[_]]
    Definition Classes
    TreeNode
  19. def convertToAst(numFirstTableColumns: Int): AstExpression

    Build an equivalent representation of this expression in a cudf AST.

    Build an equivalent representation of this expression in a cudf AST.

    numFirstTableColumns

    number of columns in the leftmost input table. Spark places the columns of all inputs in a single sequence, while cudf AST uses an explicit table reference to make column indices unique. This parameter helps translate input column references from Spark's single sequence into cudf's separate sequences.

    returns

    top node of the equivalent AST

    Definition Classes
    GpuExpression
  20. def copyTagsFrom(other: Expression): Unit
    Definition Classes
    TreeNode
  21. val dataType: DataType
    Definition Classes
    GpuNamedLambdaVariable → Expression
  22. lazy val deterministic: Boolean
    Definition Classes
    Expression
  23. def disableCoalesceUntilInput(): Boolean

    Override this if your expression cannot allow combining of data from multiple files into a single batch before it operates on them.

    Override this if your expression cannot allow combining of data from multiple files into a single batch before it operates on them. These are for things like getting the input file name. Which for spark is stored in a thread local variable which means we have to jump through some hoops to make this work.

    Definition Classes
    GpuExpression
  24. def disableTieredProjectCombine: Boolean

    If this returns true then tiered project will stop looking to combine expressions when this is seen.

    If this returns true then tiered project will stop looking to combine expressions when this is seen.

    Definition Classes
    GpuExpression
  25. final def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
    Definition Classes
    GpuExpression → Expression
  26. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def eval(input: InternalRow = null): Any
    Definition Classes
    GpuExpression → Expression
  28. val exprId: ExprId
    Definition Classes
    GpuNamedLambdaVariable → NamedExpression
  29. def fastEquals(other: TreeNode[_]): Boolean
    Definition Classes
    TreeNode
  30. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. def find(f: (Expression) ⇒ Boolean): Option[Expression]
    Definition Classes
    TreeNode
  32. def flatArguments: Iterator[Any]
    Attributes
    protected
    Definition Classes
    Expression
  33. def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]
    Definition Classes
    TreeNode
  34. def foldable: Boolean
    Definition Classes
    NamedExpression → Expression
  35. def foreach(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  36. def foreachUp(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  37. def genCode(ctx: CodegenContext): ExprCode
    Definition Classes
    Expression
  38. def generateTreeString(depth: Int, lastChildren: Seq[Boolean], append: (String) ⇒ Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int, printNodeId: Boolean, indent: Int): Unit
    Definition Classes
    TreeNode
  39. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  40. def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
    Definition Classes
    TreeNode
  41. def hasSideEffects: Boolean

    Could evaluating this expression cause side-effects, such as throwing an exception?

    Could evaluating this expression cause side-effects, such as throwing an exception?

    Definition Classes
    GpuExpression
  42. def hashCode(): Int
    Definition Classes
    TreeNode → AnyRef → Any
  43. def innerChildren: Seq[TreeNode[_]]
    Definition Classes
    TreeNode
  44. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  45. def jsonFields: List[JField]
    Attributes
    protected
    Definition Classes
    TreeNode
  46. def makeCopy(newArgs: Array[AnyRef]): Expression
    Definition Classes
    TreeNode
  47. def map[A](f: (Expression) ⇒ A): Seq[A]
    Definition Classes
    TreeNode
  48. def mapChildren(f: (Expression) ⇒ Expression): Expression
    Definition Classes
    TreeNode
  49. def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]
    Attributes
    protected
    Definition Classes
    TreeNode
  50. def metadata: Metadata
    Definition Classes
    NamedExpression
  51. val name: String
    Definition Classes
    GpuNamedLambdaVariable → NamedExpression
  52. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  53. def newInstance(): NamedExpression
    Definition Classes
    GpuNamedLambdaVariable → NamedExpression
  54. def nodeName: String
    Definition Classes
    TreeNode
  55. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  56. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  57. val nullable: Boolean
    Definition Classes
    GpuNamedLambdaVariable → Expression
  58. def numberedTreeString: String
    Definition Classes
    TreeNode
  59. val origin: Origin
    Definition Classes
    TreeNode
  60. def otherCopyArgs: Seq[AnyRef]
    Attributes
    protected
    Definition Classes
    TreeNode
  61. def p(number: Int): Expression
    Definition Classes
    TreeNode
  62. def prettyJson: String
    Definition Classes
    TreeNode
  63. def prettyName: String
    Definition Classes
    Expression
  64. def qualifiedName: String
    Definition Classes
    NamedExpression
  65. def qualifier: Seq[String]
    Definition Classes
    GpuNamedLambdaVariable → NamedExpression
  66. def references: AttributeSet
    Definition Classes
    Expression
  67. lazy val resolved: Boolean
    Definition Classes
    Expression
  68. lazy val retryable: Boolean

    true means this expression can be used inside a retry block, otherwise false.

    true means this expression can be used inside a retry block, otherwise false. An expression is retryable when

    • it is deterministic, or
    • when being non-deterministic, it is a Retryable and its children are all retryable.
    Definition Classes
    GpuExpression
  69. final val selfNonDeterministic: Boolean

    Whether an expression itself is non-deterministic when its "deterministic" is false, no matter whether it has any non-deterministic children.

    Whether an expression itself is non-deterministic when its "deterministic" is false, no matter whether it has any non-deterministic children. An expression is actually a tree, and deterministic being false means there is at least one tree node is non-deterministic, but we need to know the exact nodes which are non-deterministic to check if it implements the Retryable.

    Default to false because Spark checks only children by default in Expression. So it is non-deterministic iff it has non-deterministic children.

    NOTE When overriding "deterministic", this should be taken care of.

    Definition Classes
    GpuLeafExpression → GpuExpression
  70. def semanticEquals(other: Expression): Boolean
    Definition Classes
    Expression
  71. def semanticHash(): Int
    Definition Classes
    Expression
  72. def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
    Definition Classes
    TreeNode
  73. def simpleString(maxFields: Int): String
    Definition Classes
    GpuNamedLambdaVariable → Expression → TreeNode
  74. def simpleStringWithNodeId(): String
    Definition Classes
    Expression → TreeNode
  75. def sql: String
    Definition Classes
    Expression
  76. def stringArgs: Iterator[Any]
    Attributes
    protected
    Definition Classes
    TreeNode
  77. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  78. def toAttribute: Attribute
    Definition Classes
    GpuNamedLambdaVariable → NamedExpression
  79. def toJSON: String
    Definition Classes
    TreeNode
  80. def toString(): String
    Definition Classes
    GpuNamedLambdaVariable → Expression → TreeNode → AnyRef → Any
  81. def transform(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  82. def transformDown(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  83. def transformUp(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  84. def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
    Definition Classes
    TreeNode
  85. final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
    Definition Classes
    TreeNode
  86. final def treeString: String
    Definition Classes
    TreeNode
  87. def typeSuffix: String
    Attributes
    protected
    Definition Classes
    NamedExpression
  88. def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
    Definition Classes
    TreeNode
  89. final def verboseString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  90. def verboseStringWithSuffix(maxFields: Int): String
    Definition Classes
    TreeNode
  91. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  92. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  93. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  94. def withNewChildren(newChildren: Seq[Expression]): Expression
    Definition Classes
    TreeNode

Inherited from Serializable

Inherited from Serializable

Inherited from GpuUnevaluable

Inherited from NamedExpression

Inherited from GpuLeafExpression

Inherited from ShimExpression

Inherited from GpuExpression

Inherited from Expression

Inherited from TreeNode[Expression]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped