Packages

c

com.nvidia.spark.rapids.window

GpuSpecialFrameBoundary

case class GpuSpecialFrameBoundary(boundary: SpecialFrameBoundary) extends Expression with GpuExpression with ShimExpression with GpuUnevaluable with Product with Serializable

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

Instance Constructors

  1. new GpuSpecialFrameBoundary(boundary: SpecialFrameBoundary)

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. val boundary: SpecialFrameBoundary
  9. lazy val canonicalized: Expression
    Definition Classes
    GpuExpression → Expression
  10. def checkInputDataTypes(): TypeCheckResult
    Definition Classes
    Expression
  11. def children: Seq[Expression]
    Definition Classes
    GpuSpecialFrameBoundary → TreeNode
  12. def childrenResolved: Boolean
    Definition Classes
    Expression
  13. def clone(): Expression
    Definition Classes
    TreeNode → AnyRef
  14. def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
    Definition Classes
    TreeNode
  15. def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
    Definition Classes
    TreeNode
  16. def collectLeaves(): Seq[Expression]
    Definition Classes
    TreeNode
  17. 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
  18. 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
  19. final def containsAllPatterns(patterns: TreePattern*): Boolean
    Definition Classes
    TreePatternBits
  20. final def containsAnyPattern(patterns: TreePattern*): Boolean
    Definition Classes
    TreePatternBits
  21. lazy val containsChild: Set[TreeNode[_]]
    Definition Classes
    TreeNode
  22. final def containsPattern(t: TreePattern): Boolean
    Definition Classes
    TreePatternBits
    Annotations
    @inline()
  23. 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
  24. def copyTagsFrom(other: Expression): Unit
    Definition Classes
    TreeNode
  25. def dataType: DataType
    Definition Classes
    GpuSpecialFrameBoundary → Expression
  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. final def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
    Definition Classes
    GpuExpression → Expression
  30. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. final def eval(input: InternalRow = null): Any
    Definition Classes
    GpuExpression → Expression
  32. def fastEquals(other: TreeNode[_]): Boolean
    Definition Classes
    TreeNode
  33. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  34. def find(f: (Expression) ⇒ Boolean): Option[Expression]
    Definition Classes
    TreeNode
  35. def flatArguments: Iterator[Any]
    Attributes
    protected
    Definition Classes
    Expression
  36. def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]
    Definition Classes
    TreeNode
  37. def foldable: Boolean
    Definition Classes
    GpuSpecialFrameBoundary → Expression
  38. def foreach(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  39. def foreachUp(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  40. def genCode(ctx: CodegenContext): ExprCode
    Definition Classes
    Expression
  41. 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
  42. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  43. def getDefaultTreePatternBits: BitSet
    Attributes
    protected
    Definition Classes
    TreeNode
  44. def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
    Definition Classes
    TreeNode
  45. 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
  46. def hashCode(): Int
    Definition Classes
    TreeNode → AnyRef → Any
  47. def innerChildren: Seq[TreeNode[_]]
    Definition Classes
    TreeNode
  48. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  49. def isRuleIneffective(ruleId: RuleId): Boolean
    Attributes
    protected
    Definition Classes
    TreeNode
  50. def isUnbounded: Boolean
  51. def jsonFields: List[JField]
    Attributes
    protected
    Definition Classes
    TreeNode
  52. final def legacyWithNewChildren(newChildren: Seq[Expression]): Expression
    Attributes
    protected
    Definition Classes
    TreeNode
  53. def makeCopy(newArgs: Array[AnyRef]): Expression
    Definition Classes
    TreeNode
  54. def map[A](f: (Expression) ⇒ A): Seq[A]
    Definition Classes
    TreeNode
  55. def mapChildren(f: (Expression) ⇒ Expression): Expression
    Definition Classes
    TreeNode
  56. def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]
    Attributes
    protected
    Definition Classes
    TreeNode
  57. def markRuleAsIneffective(ruleId: RuleId): Unit
    Attributes
    protected
    Definition Classes
    TreeNode
  58. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def nodeName: String
    Definition Classes
    TreeNode
  60. val nodePatterns: Seq[TreePattern]
    Attributes
    protected
    Definition Classes
    TreeNode
  61. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  62. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  63. def nullable: Boolean
    Definition Classes
    GpuSpecialFrameBoundary → Expression
  64. def numberedTreeString: String
    Definition Classes
    TreeNode
  65. val origin: Origin
    Definition Classes
    TreeNode
  66. def otherCopyArgs: Seq[AnyRef]
    Attributes
    protected
    Definition Classes
    TreeNode
  67. def p(number: Int): Expression
    Definition Classes
    TreeNode
  68. def prettyJson: String
    Definition Classes
    TreeNode
  69. def prettyName: String
    Definition Classes
    Expression
  70. def references: AttributeSet
    Definition Classes
    Expression
  71. lazy val resolved: Boolean
    Definition Classes
    Expression
  72. 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
  73. 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
  74. final def semanticEquals(other: Expression): Boolean
    Definition Classes
    Expression
  75. def semanticHash(): Int
    Definition Classes
    Expression
  76. def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
    Definition Classes
    TreeNode
  77. def simpleString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  78. def simpleStringWithNodeId(): String
    Definition Classes
    Expression → TreeNode
  79. def sql: String
    Definition Classes
    Expression
  80. def stringArgs: Iterator[Any]
    Attributes
    protected
    Definition Classes
    TreeNode
  81. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  82. def toJSON: String
    Definition Classes
    TreeNode
  83. def toString(): String
    Definition Classes
    Expression → TreeNode → AnyRef → Any
  84. def transform(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  85. def transformDown(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  86. def transformDownWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  87. def transformUp(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  88. def transformUpWithBeforeAndAfterRuleOnChildren(cond: (Expression) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[(Expression, Expression), Expression]): Expression
    Definition Classes
    TreeNode
  89. def transformUpWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  90. def transformWithPruning(cond: (TreePatternBits) ⇒ Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  91. lazy val treePatternBits: BitSet
    Definition Classes
    TreeNode → TreePatternBits
  92. def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
    Definition Classes
    TreeNode
  93. final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
    Definition Classes
    TreeNode
  94. final def treeString: String
    Definition Classes
    TreeNode
  95. def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
    Definition Classes
    TreeNode
  96. def value: Int

    Maps boundary to an Int value that in some cases can be used to build up the window options for a window aggregation.

    Maps boundary to an Int value that in some cases can be used to build up the window options for a window aggregation. UnboundedPreceding and UnboundedFollowing produce Int.MinValue and Int.MaxValue respectively. In row based operations this should be fine because we cannot have a batch with that many rows in it anyways. For range based queries isUnbounded should be called too, to properly interpret the data. CurrentRow produces 0 which works for both row and range based queries.

  97. final def verboseString(maxFields: Int): String
    Definition Classes
    Expression → TreeNode
  98. def verboseStringWithSuffix(maxFields: Int): String
    Definition Classes
    TreeNode
  99. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  100. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  101. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  102. final def withNewChildren(newChildren: Seq[Expression]): Expression
    Definition Classes
    TreeNode
  103. def withNewChildrenInternal(newChildren: IndexedSeq[Expression]): Expression
    Definition Classes
    ShimExpression → TreeNode

Inherited from Serializable

Inherited from Serializable

Inherited from GpuUnevaluable

Inherited from ShimExpression

Inherited from GpuExpression

Inherited from Expression

Inherited from TreeNode[Expression]

Inherited from TreePatternBits

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped