Packages

c

org.apache.spark.sql.rapids

GpuIntegralDivide

case class GpuIntegralDivide(left: Expression, right: Expression, failOnError: Boolean = SQLConf.get.ansiEnabled) extends GpuIntegralDivideParent with Product with Serializable

Linear Supertypes
GpuIntegralDivideParent, Serializable, Serializable, GpuDivModLike, CudfBinaryArithmetic, NullIntolerant, 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. GpuIntegralDivide
  2. GpuIntegralDivideParent
  3. Serializable
  4. Serializable
  5. GpuDivModLike
  6. CudfBinaryArithmetic
  7. NullIntolerant
  8. CudfBinaryOperator
  9. CudfBinaryExpression
  10. GpuBinaryOperator
  11. GpuBinaryExpression
  12. GpuExpression
  13. ShimBinaryExpression
  14. BinaryOperator
  15. ExpectsInputTypes
  16. BinaryExpression
  17. BinaryLike
  18. Expression
  19. TreeNode
  20. TreePatternBits
  21. Product
  22. Equals
  23. AnyRef
  24. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GpuIntegralDivide(left: Expression, right: Expression, failOnError: Boolean = SQLConf.get.ansiEnabled)

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

Inherited from GpuIntegralDivideParent

Inherited from Serializable

Inherited from Serializable

Inherited from GpuDivModLike

Inherited from CudfBinaryArithmetic

Inherited from NullIntolerant

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