QuaternaryExpression

abstract def canEqual(that: Any): Boolean

abstract def children: Seq[Expression]

abstract def dataType: DataType

abstract def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode

abstract def productArity: Int

abstract def productElement(n: Int): Any

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(number: Int): TreeNode[_]

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: Expression

def checkInputDataTypes(): TypeCheckResult

def childrenResolved: Boolean

def clone(): AnyRef

def collect[B](pf: PartialFunction[Expression, B]): Seq[B]

def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]

def collectLeaves(): Seq[Expression]

lazy val containsChild: Set[TreeNode[_]]

def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, String) ⇒ String): ExprCode

Short hand for generating quaternary evaluation code.

lazy val deterministic: Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def eval(input: InternalRow): Any

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

def fastEquals(other: TreeNode[_]): Boolean

def finalize(): Unit

def find(f: (Expression) ⇒ Boolean): Option[Expression]

def flatArguments: Iterator[Any]

def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]

def foldable: Boolean

def foreach(f: (Expression) ⇒ Unit): Unit

def foreachUp(f: (Expression) ⇒ Unit): Unit

def genCode(ctx: CodegenContext): ExprCode

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

final def getClass(): Class[_]

def hashCode(): Int

def innerChildren: Seq[TreeNode[_]]

final def isInstanceOf[T0]: Boolean

def jsonFields: List[JField]

def makeCopy(newArgs: Array[AnyRef]): Expression

def map[A](f: (Expression) ⇒ A): Seq[A]

def mapChildren(f: (Expression) ⇒ Expression): Expression

def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, String) ⇒ String): ExprCode

Short hand for generating quaternary evaluation code.

def nullSafeEval(input1: Any, input2: Any, input3: Any, input4: Any): Any

Called by default eval implementation.

def nullable: Boolean

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def p(number: Int): Expression

def prettyJson: String

def prettyName: String

def productIterator: Iterator[Any]

def productPrefix: String

def references: AttributeSet

lazy val resolved: Boolean

def semanticEquals(other: Expression): Boolean

def semanticHash(): Int

def simpleString: String

def sql: String

def stringArgs: Iterator[Any]

final def synchronized[T0](arg0: ⇒ T0): T0

def toJSON: String

def toString(): String

def transform(rule: PartialFunction[Expression, Expression]): Expression

def transformDown(rule: PartialFunction[Expression, Expression]): Expression

def transformUp(rule: PartialFunction[Expression, Expression]): Expression

def treeString(verbose: Boolean, addSuffix: Boolean): String

def treeString: String

final def verboseString: String

def verboseStringWithSuffix: String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withNewChildren(newChildren: Seq[Expression]): Expression