Packages

trait GpuDivModLike extends CudfBinaryArithmetic

Linear Supertypes
CudfBinaryArithmetic, NullIntolerant, CudfBinaryOperator, CudfBinaryExpression, GpuBinaryOperator, GpuBinaryExpression, GpuExpression, ShimBinaryExpression, BinaryOperator, ExpectsInputTypes, BinaryExpression, Expression, TreeNode[Expression], Product, Equals, AnyRef, Any
Known Subclasses
GpuDivide, GpuIntegralDivide, GpuIntegralDivideParent, GpuPmod, GpuPmodBase, GpuRemainder, GpuRemainderBase
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GpuDivModLike
  2. CudfBinaryArithmetic
  3. NullIntolerant
  4. CudfBinaryOperator
  5. CudfBinaryExpression
  6. GpuBinaryOperator
  7. GpuBinaryExpression
  8. GpuExpression
  9. ShimBinaryExpression
  10. BinaryOperator
  11. ExpectsInputTypes
  12. BinaryExpression
  13. Expression
  14. TreeNode
  15. Product
  16. Equals
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def binaryOp: BinaryOp
    Definition Classes
    CudfBinaryExpression
  2. abstract def canEqual(that: Any): Boolean
    Definition Classes
    Equals
  3. abstract def inputType: AbstractDataType
    Definition Classes
    BinaryOperator
  4. abstract def left: Expression
    Definition Classes
    BinaryExpression
  5. abstract def productArity: Int
    Definition Classes
    Product
  6. abstract def productElement(n: Int): Any
    Definition Classes
    Product
  7. abstract def right: Expression
    Definition Classes
    BinaryExpression
  8. abstract def symbol: String
    Definition Classes
    BinaryOperator

Concrete 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. lazy val canonicalized: Expression
    Definition Classes
    GpuExpression → Expression
  10. def castOutputAtEnd: Boolean
    Definition Classes
    CudfBinaryExpression
  11. def checkDivideOverflow: Boolean
    Attributes
    protected
  12. def checkInputDataTypes(): TypeCheckResult
    Definition Classes
    BinaryOperator → ExpectsInputTypes → Expression
  13. final def children: Seq[Expression]
    Definition Classes
    BinaryExpression → TreeNode
  14. def childrenResolved: Boolean
    Definition Classes
    Expression
  15. def clone(): Expression
    Definition Classes
    TreeNode → AnyRef
  16. def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
    Definition Classes
    TreeNode
  17. def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
    Definition Classes
    TreeNode
  18. def collectLeaves(): Seq[Expression]
    Definition Classes
    TreeNode
  19. 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
    GpuBinaryExpression → GpuExpression
  20. 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
  21. lazy val containsChild: Set[TreeNode[_]]
    Definition Classes
    TreeNode
  22. 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
  23. def copyTagsFrom(other: Expression): Unit
    Definition Classes
    TreeNode
  24. def dataType: DataType
    Definition Classes
    CudfBinaryArithmetic → Expression
  25. def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String) ⇒ String): ExprCode
    Attributes
    protected
    Definition Classes
    BinaryExpression
  26. lazy val deterministic: Boolean
    Definition Classes
    Expression
  27. 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
  28. 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
  29. def doColumnar(lhs: GpuColumnVector, rhs: GpuScalar): ColumnVector
    Definition Classes
    GpuDivModLike → CudfBinaryExpression → GpuBinaryExpression
  30. def doColumnar(lhs: GpuScalar, rhs: GpuColumnVector): ColumnVector
    Definition Classes
    GpuDivModLike → CudfBinaryExpression → GpuBinaryExpression
  31. def doColumnar(lhs: GpuColumnVector, rhs: GpuColumnVector): ColumnVector
    Definition Classes
    GpuDivModLike → CudfBinaryExpression → GpuBinaryExpression
  32. def doColumnar(numRows: Int, lhs: GpuScalar, rhs: GpuScalar): ColumnVector
    Definition Classes
    CudfBinaryExpression → GpuBinaryExpression
  33. def doColumnar(lhs: BinaryOperable, rhs: BinaryOperable): ColumnVector
    Definition Classes
    CudfBinaryExpression
  34. final def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
    Definition Classes
    GpuExpression → Expression
  35. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  36. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  37. final def eval(input: InternalRow = null): Any
    Definition Classes
    GpuExpression → Expression
  38. lazy val failOnError: Boolean
  39. def fastEquals(other: TreeNode[_]): Boolean
    Definition Classes
    TreeNode
  40. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  41. def find(f: (Expression) ⇒ Boolean): Option[Expression]
    Definition Classes
    TreeNode
  42. def flatArguments: Iterator[Any]
    Attributes
    protected
    Definition Classes
    Expression
  43. def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]
    Definition Classes
    TreeNode
  44. def foldable: Boolean
    Definition Classes
    BinaryExpression → Expression
  45. def foreach(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  46. def foreachUp(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  47. def genCode(ctx: CodegenContext): ExprCode
    Definition Classes
    Expression
  48. 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
  49. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  50. def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
    Definition Classes
    TreeNode
  51. 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
    CudfBinaryArithmetic → GpuExpression
  52. def hashCode(): Int
    Definition Classes
    TreeNode → AnyRef → Any
  53. def innerChildren: Seq[TreeNode[_]]
    Definition Classes
    TreeNode
  54. def inputTypes: Seq[AbstractDataType]
    Definition Classes
    BinaryOperator → ExpectsInputTypes
  55. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  56. def jsonFields: List[JField]
    Attributes
    protected
    Definition Classes
    TreeNode
  57. def makeCopy(newArgs: Array[AnyRef]): Expression
    Definition Classes
    TreeNode
  58. def map[A](f: (Expression) ⇒ A): Seq[A]
    Definition Classes
    TreeNode
  59. def mapChildren(f: (Expression) ⇒ Expression): Expression
    Definition Classes
    TreeNode
  60. def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]
    Attributes
    protected
    Definition Classes
    TreeNode
  61. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  62. def nodeName: String
    Definition Classes
    TreeNode
  63. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  64. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  65. def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String) ⇒ String): ExprCode
    Attributes
    protected
    Definition Classes
    BinaryExpression
  66. def nullSafeEval(input1: Any, input2: Any): Any
    Attributes
    protected
    Definition Classes
    BinaryExpression
  67. def nullable: Boolean
    Definition Classes
    GpuDivModLike → BinaryExpression → Expression
  68. def numberedTreeString: String
    Definition Classes
    TreeNode
  69. val origin: Origin
    Definition Classes
    TreeNode
  70. def otherCopyArgs: Seq[AnyRef]
    Attributes
    protected
    Definition Classes
    TreeNode
  71. def outputType(l: BinaryOperable, r: BinaryOperable): DType
    Definition Classes
    CudfBinaryExpression
  72. def outputTypeOverride: DType
    Definition Classes
    CudfBinaryExpression
  73. def p(number: Int): Expression
    Definition Classes
    TreeNode
  74. def prettyJson: String
    Definition Classes
    TreeNode
  75. def prettyName: String
    Definition Classes
    Expression
  76. def productIterator: Iterator[Any]
    Definition Classes
    Product
  77. def productPrefix: String
    Definition Classes
    Product
  78. def references: AttributeSet
    Definition Classes
    Expression
  79. lazy val resolved: Boolean
    Definition Classes
    Expression
  80. 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
  81. 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
  82. def semanticEquals(other: Expression): Boolean
    Definition Classes
    Expression
  83. def semanticHash(): Int
    Definition Classes
    Expression
  84. def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
    Definition Classes
    TreeNode
  85. def simpleString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  86. def simpleStringWithNodeId(): String
    Definition Classes
    Expression → TreeNode
  87. def sql: String
    Definition Classes
    BinaryOperator → Expression
  88. def sqlOperator: String
    Definition Classes
    BinaryOperator
  89. def stringArgs: Iterator[Any]
    Attributes
    protected
    Definition Classes
    TreeNode
  90. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  91. def toJSON: String
    Definition Classes
    TreeNode
  92. def toString(): String
    Definition Classes
    BinaryOperator → Expression → TreeNode → AnyRef → Any
  93. def transform(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  94. def transformDown(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  95. def transformUp(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  96. def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
    Definition Classes
    TreeNode
  97. final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
    Definition Classes
    TreeNode
  98. final def treeString: String
    Definition Classes
    TreeNode
  99. def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
    Definition Classes
    TreeNode
  100. final def verboseString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  101. def verboseStringWithSuffix(maxFields: Int): String
    Definition Classes
    TreeNode
  102. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  103. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  105. def withNewChildren(newChildren: Seq[Expression]): Expression
    Definition Classes
    TreeNode

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 Expression

Inherited from TreeNode[Expression]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped