Packages

case class GpuAnd(left: Expression, right: Expression) extends CudfBinaryPredicateWithSideEffect with Product with Serializable

Linear Supertypes
Serializable, Serializable, CudfBinaryPredicateWithSideEffect, Predicate, CudfBinaryOperator, CudfBinaryExpression, GpuBinaryOperator, GpuBinaryExpression, GpuExpression, ShimBinaryExpression, BinaryOperator, ExpectsInputTypes, BinaryExpression, BinaryLike[Expression], Expression, TreeNode[Expression], TreePatternBits, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GpuAnd
  2. Serializable
  3. Serializable
  4. CudfBinaryPredicateWithSideEffect
  5. Predicate
  6. CudfBinaryOperator
  7. CudfBinaryExpression
  8. GpuBinaryOperator
  9. GpuBinaryExpression
  10. GpuExpression
  11. ShimBinaryExpression
  12. BinaryOperator
  13. ExpectsInputTypes
  14. BinaryExpression
  15. BinaryLike
  16. Expression
  17. TreeNode
  18. TreePatternBits
  19. Product
  20. Equals
  21. AnyRef
  22. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GpuAnd(left: Expression, right: Expression)

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 applyShortCircuit(col: GpuColumnVector): GpuColumnVector
    Definition Classes
    CudfBinaryPredicateWithSideEffect
  6. def argString(maxFields: Int): String
    Definition Classes
    TreeNode
  7. def asCode: String
    Definition Classes
    TreeNode
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def astOperator: Option[BinaryOperator]
    Definition Classes
    GpuAnd → CudfBinaryExpression
  10. def binaryOp: BinaryOp
    Definition Classes
    GpuAnd → CudfBinaryExpression
  11. lazy val canonicalized: Expression
    Definition Classes
    GpuExpression → Expression
  12. def castOutputAtEnd: Boolean
    Definition Classes
    CudfBinaryExpression
  13. def checkInputDataTypes(): TypeCheckResult
    Definition Classes
    BinaryOperator → ExpectsInputTypes → Expression
  14. final lazy val children: Seq[Expression]
    Definition Classes
    BinaryLike
    Annotations
    @transient()
  15. def childrenResolved: Boolean
    Definition Classes
    Expression
  16. def clone(): Expression
    Definition Classes
    TreeNode → AnyRef
  17. def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
    Definition Classes
    TreeNode
  18. def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
    Definition Classes
    TreeNode
  19. def collectLeaves(): Seq[Expression]
    Definition Classes
    TreeNode
  20. 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
    CudfBinaryPredicateWithSideEffect → GpuBinaryExpression → GpuExpression
  21. 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
    GpuExpression
  22. def columnarEvalWithSideEffects(batch: ColumnarBatch): GpuColumnVector

    When computing logical expressions on the CPU, the true and false expressions are evaluated lazily, meaning that the RHS expression of logical-AND is not evaluated when LHS is False.

    When computing logical expressions on the CPU, the true and false expressions are evaluated lazily, meaning that the RHS expression of logical-AND is not evaluated when LHS is False. For logical-OR, RHS is not evaluated when LHS is True. This is important in the case where the expressions can have side-effects, such as throwing exceptions for invalid inputs.

    This method performs lazy evaluation on the GPU by first filtering the input batch where the LHS predicate is True. The RHS predicate is evaluated against these batches and then the results are combined back into a single batch using the gather algorithm.

    Definition Classes
    CudfBinaryPredicateWithSideEffect
  23. final def containsAllPatterns(patterns: TreePattern*): Boolean
    Definition Classes
    TreePatternBits
  24. final def containsAnyPattern(patterns: TreePattern*): Boolean
    Definition Classes
    TreePatternBits
  25. lazy val containsChild: Set[TreeNode[_]]
    Definition Classes
    TreeNode
  26. final def containsPattern(t: TreePattern): Boolean
    Definition Classes
    TreePatternBits
    Annotations
    @inline()
  27. 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
    CudfBinaryExpression → GpuExpression
  28. def copyTagsFrom(other: Expression): Unit
    Definition Classes
    TreeNode
  29. def dataType: DataType
    Definition Classes
    Predicate → Expression
  30. def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String) ⇒ String): ExprCode
    Attributes
    protected
    Definition Classes
    BinaryExpression
  31. lazy val deterministic: Boolean
    Definition Classes
    Expression
  32. 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
  33. 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
  34. def doColumnar(numRows: Int, lhs: GpuScalar, rhs: GpuScalar): ColumnVector
    Definition Classes
    CudfBinaryExpression → GpuBinaryExpression
  35. def doColumnar(lhs: GpuColumnVector, rhs: GpuScalar): ColumnVector
    Definition Classes
    CudfBinaryExpression → GpuBinaryExpression
  36. def doColumnar(lhs: GpuScalar, rhs: GpuColumnVector): ColumnVector
    Definition Classes
    CudfBinaryExpression → GpuBinaryExpression
  37. def doColumnar(lhs: GpuColumnVector, rhs: GpuColumnVector): ColumnVector
    Definition Classes
    CudfBinaryExpression → GpuBinaryExpression
  38. def doColumnar(lhs: BinaryOperable, rhs: BinaryOperable): ColumnVector
    Definition Classes
    CudfBinaryExpression
  39. final def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
    Definition Classes
    GpuExpression → Expression
  40. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  41. final def eval(input: InternalRow = null): Any
    Definition Classes
    GpuExpression → Expression
  42. def fastEquals(other: TreeNode[_]): Boolean
    Definition Classes
    TreeNode
  43. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  44. def find(f: (Expression) ⇒ Boolean): Option[Expression]
    Definition Classes
    TreeNode
  45. def flatArguments: Iterator[Any]
    Attributes
    protected
    Definition Classes
    Expression
  46. def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]
    Definition Classes
    TreeNode
  47. def foldable: Boolean
    Definition Classes
    BinaryExpression → Expression
  48. def foreach(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  49. def foreachUp(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  50. def genCode(ctx: CodegenContext): ExprCode
    Definition Classes
    Expression
  51. 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
  52. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  53. def getDefaultTreePatternBits: BitSet
    Attributes
    protected
    Definition Classes
    TreeNode
  54. def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
    Definition Classes
    TreeNode
  55. 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
  56. def hashCode(): Int
    Definition Classes
    TreeNode → AnyRef → Any
  57. def innerChildren: Seq[TreeNode[_]]
    Definition Classes
    TreeNode
  58. def inputType: AbstractDataType
    Definition Classes
    CudfBinaryPredicateWithSideEffect → BinaryOperator
  59. def inputTypes: Seq[AbstractDataType]
    Definition Classes
    BinaryOperator → ExpectsInputTypes
  60. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  61. def isRuleIneffective(ruleId: RuleId): Boolean
    Attributes
    protected
    Definition Classes
    TreeNode
  62. def jsonFields: List[JField]
    Attributes
    protected
    Definition Classes
    TreeNode
  63. val left: Expression
    Definition Classes
    GpuAnd → BinaryLike
  64. final def legacyWithNewChildren(newChildren: Seq[Expression]): Expression
    Attributes
    protected
    Definition Classes
    TreeNode
  65. def makeCopy(newArgs: Array[AnyRef]): Expression
    Definition Classes
    TreeNode
  66. def map[A](f: (Expression) ⇒ A): Seq[A]
    Definition Classes
    TreeNode
  67. final def mapChildren(f: (Expression) ⇒ Expression): Expression
    Definition Classes
    BinaryLike
  68. def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]
    Attributes
    protected
    Definition Classes
    TreeNode
  69. def markRuleAsIneffective(ruleId: RuleId): Unit
    Attributes
    protected
    Definition Classes
    TreeNode
  70. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  71. def nodeName: String
    Definition Classes
    TreeNode
  72. val nodePatterns: Seq[TreePattern]
    Attributes
    protected
    Definition Classes
    TreeNode
  73. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  74. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  75. def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String) ⇒ String): ExprCode
    Attributes
    protected
    Definition Classes
    BinaryExpression
  76. def nullSafeEval(input1: Any, input2: Any): Any
    Attributes
    protected
    Definition Classes
    BinaryExpression
  77. def nullable: Boolean
    Definition Classes
    BinaryExpression → Expression
  78. def numberedTreeString: String
    Definition Classes
    TreeNode
  79. val origin: Origin
    Definition Classes
    TreeNode
  80. def otherCopyArgs: Seq[AnyRef]
    Attributes
    protected
    Definition Classes
    TreeNode
  81. def outputType(l: BinaryOperable, r: BinaryOperable): DType
    Definition Classes
    CudfBinaryExpression
  82. def outputTypeOverride: DType
    Definition Classes
    CudfBinaryExpression
  83. def p(number: Int): Expression
    Definition Classes
    TreeNode
  84. def prettyJson: String
    Definition Classes
    TreeNode
  85. def prettyName: String
    Definition Classes
    Expression
  86. def processLHS(col: ColumnVector): ColumnVector
    Definition Classes
    GpuAnd → CudfBinaryPredicateWithSideEffect
  87. def references: AttributeSet
    Definition Classes
    Expression
  88. lazy val resolved: Boolean
    Definition Classes
    Expression
  89. 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
  90. val right: Expression
    Definition Classes
    GpuAnd → BinaryLike
  91. 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
    GpuExpression
  92. final def semanticEquals(other: Expression): Boolean
    Definition Classes
    Expression
  93. def semanticHash(): Int
    Definition Classes
    Expression
  94. def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
    Definition Classes
    TreeNode
  95. def shortCircuitVal: Boolean
    Definition Classes
    GpuAnd → CudfBinaryPredicateWithSideEffect
  96. def shouldShortCircuit(col: GpuColumnVector): Boolean
    Definition Classes
    GpuAnd → CudfBinaryPredicateWithSideEffect
  97. def simpleString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  98. def simpleStringWithNodeId(): String
    Definition Classes
    Expression → TreeNode
  99. def sql: String
    Definition Classes
    BinaryOperator → Expression
  100. def sqlOperator: String
    Definition Classes
    GpuAnd → BinaryOperator
  101. def stringArgs: Iterator[Any]
    Attributes
    protected
    Definition Classes
    TreeNode
  102. def symbol: String
    Definition Classes
    GpuAnd → BinaryOperator
  103. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  104. def toJSON: String
    Definition Classes
    TreeNode
  105. def toString(): String
    Definition Classes
    BinaryOperator → Expression → TreeNode → AnyRef → Any
  106. def transform(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  107. def transformDown(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  108. def transformDownWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  109. def transformUp(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  110. def transformUpWithBeforeAndAfterRuleOnChildren(cond: (Expression) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[(Expression, Expression), Expression]): Expression
    Definition Classes
    TreeNode
  111. def transformUpWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  112. def transformWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  113. lazy val treePatternBits: BitSet
    Definition Classes
    TreeNode → TreePatternBits
  114. def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
    Definition Classes
    TreeNode
  115. final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
    Definition Classes
    TreeNode
  116. final def treeString: String
    Definition Classes
    TreeNode
  117. def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
    Definition Classes
    TreeNode
  118. final def verboseString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  119. def verboseStringWithSuffix(maxFields: Int): String
    Definition Classes
    TreeNode
  120. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  121. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  122. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  123. final def withNewChildren(newChildren: Seq[Expression]): Expression
    Definition Classes
    TreeNode
  124. def withNewChildrenInternal(newLeft: Expression, newRight: Expression): Expression
    Definition Classes
    ShimBinaryExpression → BinaryLike
  125. final def withNewChildrenInternal(newChildren: IndexedSeq[Expression]): Expression
    Definition Classes
    BinaryLike

Inherited from Serializable

Inherited from Serializable

Inherited from CudfBinaryPredicateWithSideEffect

Inherited from Predicate

Inherited from CudfBinaryOperator

Inherited from CudfBinaryExpression

Inherited from GpuBinaryOperator

Inherited from GpuBinaryExpression

Inherited from GpuExpression

Inherited from ShimBinaryExpression

Inherited from BinaryOperator

Inherited from ExpectsInputTypes

Inherited from BinaryExpression

Inherited from BinaryLike[Expression]

Inherited from Expression

Inherited from TreeNode[Expression]

Inherited from TreePatternBits

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped