Packages

abstract class QuinaryExpression extends Expression

An expression with five inputs and one output. The output is by default evaluated to null if any input is evaluated to null.

Linear Supertypes
Expression, TreeNode[Expression], Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. QuinaryExpression
  2. Expression
  3. TreeNode
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new QuinaryExpression()

Abstract Value Members

  1. abstract def canEqual(that: Any): Boolean
    Definition Classes
    Equals
  2. abstract def children: Seq[Expression]
    Definition Classes
    TreeNode
  3. abstract def dataType: DataType
    Definition Classes
    Expression
  4. abstract def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
    Attributes
    protected
    Definition Classes
    Expression
  5. abstract def productArity: Int
    Definition Classes
    Product
  6. abstract def productElement(n: Int): Any
    Definition Classes
    Product

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: 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
    Expression
  9. def checkInputDataTypes(): TypeCheckResult
    Definition Classes
    Expression
  10. def childrenResolved: Boolean
    Definition Classes
    Expression
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
    Definition Classes
    TreeNode
  13. def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
    Definition Classes
    TreeNode
  14. def collectLeaves(): Seq[Expression]
    Definition Classes
    TreeNode
  15. lazy val containsChild: Set[TreeNode[_]]
    Definition Classes
    TreeNode
  16. def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, String, String) ⇒ String): ExprCode

    Short hand for generating quinary evaluation code.

    Short hand for generating quinary evaluation code. If either of the sub-expressions is null, the result of this computation is assumed to be null.

    f

    accepts five variable names and returns Java code to compute the output.

    Attributes
    protected
  17. lazy val deterministic: Boolean
    Definition Classes
    Expression
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. def eval(input: InternalRow): Any

    Default behavior of evaluation according to the default nullability of QuinaryExpression.

    Default behavior of evaluation according to the default nullability of QuinaryExpression. If subclass of QuinaryExpression override nullable, probably should also override this.

    Definition Classes
    QuinaryExpression → Expression
  21. def fastEquals(other: TreeNode[_]): Boolean
    Definition Classes
    TreeNode
  22. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. def find(f: (Expression) ⇒ Boolean): Option[Expression]
    Definition Classes
    TreeNode
  24. def flatArguments: Iterator[Any]
    Attributes
    protected
    Definition Classes
    Expression
  25. def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]
    Definition Classes
    TreeNode
  26. def foldable: Boolean
    Definition Classes
    QuinaryExpression → Expression
  27. def foreach(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  28. def foreachUp(f: (Expression) ⇒ Unit): Unit
    Definition Classes
    TreeNode
  29. def genCode(ctx: CodegenContext): ExprCode
    Definition Classes
    Expression
  30. def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder
    Definition Classes
    TreeNode
  31. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  32. def hashCode(): Int
    Definition Classes
    TreeNode → AnyRef → Any
  33. def innerChildren: Seq[TreeNode[_]]
    Attributes
    protected
    Definition Classes
    TreeNode
  34. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  35. def jsonFields: List[JField]
    Attributes
    protected
    Definition Classes
    TreeNode
  36. def makeCopy(newArgs: Array[AnyRef]): Expression
    Definition Classes
    TreeNode
  37. def map[A](f: (Expression) ⇒ A): Seq[A]
    Definition Classes
    TreeNode
  38. def mapChildren(f: (Expression) ⇒ Expression): Expression
    Definition Classes
    TreeNode
  39. def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]
    Attributes
    protected
    Definition Classes
    TreeNode
  40. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  41. def nodeName: String
    Definition Classes
    TreeNode
  42. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  44. def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, String, String) ⇒ String): ExprCode

    Short hand for generating quinary evaluation code.

    Short hand for generating quinary evaluation code. If either of the sub-expressions is null, the result of this computation is assumed to be null.

    f

    function that accepts the 5 non-null evaluation result names of children and returns Java code to compute the output.

    Attributes
    protected
  45. def nullSafeEval(input1: Any, input2: Any, input3: Any, input4: Any, input5: Any): Any

    Called by default eval implementation.

    Called by default eval implementation. If subclass of QuinaryExpression keep the default nullability, they can override this method to save null-check code. If we need full control of evaluation process, we should override eval.

    Attributes
    protected
  46. def nullable: Boolean
    Definition Classes
    QuinaryExpression → Expression
  47. def numberedTreeString: String
    Definition Classes
    TreeNode
  48. val origin: Origin
    Definition Classes
    TreeNode
  49. def otherCopyArgs: Seq[AnyRef]
    Attributes
    protected
    Definition Classes
    TreeNode
  50. def p(number: Int): Expression
    Definition Classes
    TreeNode
  51. def prettyJson: String
    Definition Classes
    TreeNode
  52. def prettyName: String
    Definition Classes
    Expression
  53. def productIterator: Iterator[Any]
    Definition Classes
    Product
  54. def productPrefix: String
    Definition Classes
    Product
  55. def references: AttributeSet
    Definition Classes
    Expression
  56. lazy val resolved: Boolean
    Definition Classes
    Expression
  57. def semanticEquals(other: Expression): Boolean
    Definition Classes
    Expression
  58. def semanticHash(): Int
    Definition Classes
    Expression
  59. def simpleString: String
    Definition Classes
    Expression → TreeNode
  60. def sql: String
    Definition Classes
    Expression
  61. def stringArgs: Iterator[Any]
    Attributes
    protected
    Definition Classes
    TreeNode
  62. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  63. def toJSON: String
    Definition Classes
    TreeNode
  64. def toString(): String
    Definition Classes
    Expression → TreeNode → AnyRef → Any
  65. def transform(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  66. def transformDown(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  67. def transformUp(rule: PartialFunction[Expression, Expression]): Expression
    Definition Classes
    TreeNode
  68. def treeString(verbose: Boolean, addSuffix: Boolean): String
    Definition Classes
    TreeNode
  69. def treeString: String
    Definition Classes
    TreeNode
  70. final def verboseString: String
    Definition Classes
    Expression → TreeNode
  71. def verboseStringWithSuffix: String
    Definition Classes
    TreeNode
  72. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  73. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  74. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  75. def withNewChildren(newChildren: Seq[Expression]): Expression
    Definition Classes
    TreeNode

Inherited from Expression

Inherited from TreeNode[Expression]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped