abstract class ExecSubqueryExpression extends PlanExpression[BaseSubqueryExec]
Instance Constructors
- new ExecSubqueryExpression()
Abstract Value Members
- 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 eval(input: InternalRow): Any
- abstract def exprId: ExprId
- abstract def nullable: Boolean
- abstract def plan: BaseSubqueryExec
- abstract def productArity: Int
- abstract def productElement(n: Int): Any
- abstract def updateResult(): Unit
- abstract def withNewChildrenInternal(newChildren: IndexedSeq[Expression]): Expression
- abstract def withNewPlan(plan: BaseSubqueryExec): ExecSubqueryExpression
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def apply(number: Int): TreeNode[_]
- def argString(maxFields: Int): String
- def asCode: String
- final def asInstanceOf[T0]: T0
- lazy val canonicalized: Expression
- def checkInputDataTypes(): TypeCheckResult
- def childrenResolved: Boolean
- def clone(): Expression
- def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
- def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
- def collectLeaves(): Seq[Expression]
- def conditionString: String
- final def containsAllPatterns(patterns: TreePattern*): Boolean
- final def containsAnyPattern(patterns: TreePattern*): Boolean
- lazy val containsChild: Set[TreeNode[_]]
- final def containsPattern(t: TreePattern): Boolean
- def copyTagsFrom(other: Expression): Unit
- lazy val deterministic: Boolean
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def exists(f: (Expression) => Boolean): Boolean
- 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 freshCopyIfContainsStatefulExpression(): Expression
- def genCode(ctx: CodegenContext): ExprCode
- def generateTreeString(depth: Int, lastChildren: ArrayList[Boolean], append: (String) => Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int, printNodeId: Boolean, indent: Int): Unit
- final def getClass(): Class[_ <: AnyRef]
- def getDefaultTreePatternBits: BitSet
- def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
- def hashCode(): Int
- def innerChildren: Seq[TreeNode[_]]
- final def isInstanceOf[T0]: Boolean
- def isRuleIneffective(ruleId: RuleId): Boolean
- def jsonFields: List[JField]
- final def legacyWithNewChildren(newChildren: Seq[Expression]): Expression
- 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]
- def markRuleAsIneffective(ruleId: RuleId): Unit
- def multiTransformDown(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- def multiTransformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- final def ne(arg0: AnyRef): Boolean
- def nodeName: String
- final val nodePatterns: Seq[TreePattern]
- def nodePatternsInternal(): Seq[TreePattern]
- final def notify(): Unit
- final def notifyAll(): Unit
- def numberedTreeString: String
- val origin: Origin
- def otherCopyArgs: Seq[AnyRef]
- def p(number: Int): Expression
- def prettyJson: String
- def prettyName: String
- def productElementName(n: Int): String
- def productElementNames: Iterator[String]
- def productIterator: Iterator[Any]
- def productPrefix: String
- def references: AttributeSet
- lazy val resolved: Boolean
- final def semanticEquals(other: Expression): Boolean
- def semanticHash(): Int
- def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
- def simpleString(maxFields: Int): String
- def simpleStringWithNodeId(): String
- def sql: String
- def stateful: Boolean
- 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 transformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformUp(rule: PartialFunction[Expression, Expression]): Expression
- def transformUpWithBeforeAndAfterRuleOnChildren(cond: (Expression) => Boolean, ruleId: RuleId)(rule: PartialFunction[(Expression, Expression), Expression]): Expression
- def transformUpWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- lazy val treePatternBits: BitSet
- def treeString(append: (String) => Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
- final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
- final def treeString: String
- def typeSuffix: String
- def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
- final def verboseString(maxFields: Int): String
- def verboseStringWithSuffix(maxFields: Int): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def withCanonicalizedChildren: Expression
- final def withNewChildren(newChildren: Seq[Expression]): Expression
Value Members
- abstract def exprId: ExprId
- abstract def plan: BaseSubqueryExec
- def conditionString: String
- lazy val deterministic: Boolean
- final val nodePatterns: Seq[TreePattern]
- def nodePatternsInternal(): Seq[TreePattern]
- lazy val treePatternBits: BitSet
Inherited from Expression
Value Members
- abstract def dataType: DataType
- abstract def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode
- abstract def eval(input: InternalRow): Any
- abstract def nullable: Boolean
- lazy val canonicalized: Expression
- def checkInputDataTypes(): TypeCheckResult
- def childrenResolved: Boolean
- def flatArguments: Iterator[Any]
- def foldable: Boolean
- def freshCopyIfContainsStatefulExpression(): Expression
- def genCode(ctx: CodegenContext): ExprCode
- def prettyName: String
- def references: AttributeSet
- lazy val resolved: Boolean
- final def semanticEquals(other: Expression): Boolean
- def semanticHash(): Int
- def simpleString(maxFields: Int): String
- def simpleStringWithNodeId(): String
- def sql: String
- def stateful: Boolean
- def toString(): String
- def typeSuffix: String
- final def verboseString(maxFields: Int): String
- final def withCanonicalizedChildren: Expression
Inherited from TreeNode[Expression]
Value Members
- abstract def children: Seq[Expression]
- abstract def withNewChildrenInternal(newChildren: IndexedSeq[Expression]): Expression
- def apply(number: Int): TreeNode[_]
- def argString(maxFields: Int): String
- def asCode: String
- def clone(): Expression
- 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 copyTagsFrom(other: Expression): Unit
- def exists(f: (Expression) => Boolean): Boolean
- def fastEquals(other: TreeNode[_]): Boolean
- def find(f: (Expression) => Boolean): Option[Expression]
- def flatMap[A](f: (Expression) => TraversableOnce[A]): Seq[A]
- def foreach(f: (Expression) => Unit): Unit
- def foreachUp(f: (Expression) => Unit): Unit
- def generateTreeString(depth: Int, lastChildren: ArrayList[Boolean], append: (String) => Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int, printNodeId: Boolean, indent: Int): Unit
- def getDefaultTreePatternBits: BitSet
- def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
- def hashCode(): Int
- def innerChildren: Seq[TreeNode[_]]
- def isRuleIneffective(ruleId: RuleId): Boolean
- def jsonFields: List[JField]
- final def legacyWithNewChildren(newChildren: Seq[Expression]): Expression
- 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]
- def markRuleAsIneffective(ruleId: RuleId): Unit
- def multiTransformDown(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- def multiTransformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- def nodeName: String
- def numberedTreeString: String
- val origin: Origin
- def otherCopyArgs: Seq[AnyRef]
- def p(number: Int): Expression
- def prettyJson: String
- def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
- def stringArgs: Iterator[Any]
- def toJSON: String
- def transform(rule: PartialFunction[Expression, Expression]): Expression
- def transformDown(rule: PartialFunction[Expression, Expression]): Expression
- def transformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformUp(rule: PartialFunction[Expression, Expression]): Expression
- def transformUpWithBeforeAndAfterRuleOnChildren(cond: (Expression) => Boolean, ruleId: RuleId)(rule: PartialFunction[(Expression, Expression), Expression]): Expression
- def transformUpWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def treeString(append: (String) => Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
- final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
- final def treeString: String
- def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
- def verboseStringWithSuffix(maxFields: Int): String
- final def withNewChildren(newChildren: Seq[Expression]): Expression
Inherited from TreePatternBits
Value Members
- final def containsAllPatterns(patterns: TreePattern*): Boolean
- final def containsAnyPattern(patterns: TreePattern*): Boolean
- final def containsPattern(t: TreePattern): Boolean
Inherited from Product
Value Members
- abstract def productArity: Int
- abstract def productElement(n: Int): Any
- def productElementName(n: Int): String
- def productElementNames: Iterator[String]
- def productIterator: Iterator[Any]
- def productPrefix: String
Inherited from Equals
Value Members
- abstract def canEqual(that: Any): Boolean
Inherited from AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_ <: AnyRef]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- 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 eval(input: InternalRow): Any
- abstract def exprId: ExprId
- abstract def nullable: Boolean
- abstract def plan: BaseSubqueryExec
- abstract def productArity: Int
- abstract def productElement(n: Int): Any
- abstract def updateResult(): Unit
- abstract def withNewChildrenInternal(newChildren: IndexedSeq[Expression]): Expression
- abstract def withNewPlan(plan: BaseSubqueryExec): ExecSubqueryExpression
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def apply(number: Int): TreeNode[_]
- def argString(maxFields: Int): String
- def asCode: String
- final def asInstanceOf[T0]: T0
- lazy val canonicalized: Expression
- def checkInputDataTypes(): TypeCheckResult
- def childrenResolved: Boolean
- def clone(): Expression
- def collect[B](pf: PartialFunction[Expression, B]): Seq[B]
- def collectFirst[B](pf: PartialFunction[Expression, B]): Option[B]
- def collectLeaves(): Seq[Expression]
- def conditionString: String
- final def containsAllPatterns(patterns: TreePattern*): Boolean
- final def containsAnyPattern(patterns: TreePattern*): Boolean
- lazy val containsChild: Set[TreeNode[_]]
- final def containsPattern(t: TreePattern): Boolean
- def copyTagsFrom(other: Expression): Unit
- lazy val deterministic: Boolean
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def exists(f: (Expression) => Boolean): Boolean
- 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 freshCopyIfContainsStatefulExpression(): Expression
- def genCode(ctx: CodegenContext): ExprCode
- def generateTreeString(depth: Int, lastChildren: ArrayList[Boolean], append: (String) => Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int, printNodeId: Boolean, indent: Int): Unit
- final def getClass(): Class[_ <: AnyRef]
- def getDefaultTreePatternBits: BitSet
- def getTagValue[T](tag: TreeNodeTag[T]): Option[T]
- def hashCode(): Int
- def innerChildren: Seq[TreeNode[_]]
- final def isInstanceOf[T0]: Boolean
- def isRuleIneffective(ruleId: RuleId): Boolean
- def jsonFields: List[JField]
- final def legacyWithNewChildren(newChildren: Seq[Expression]): Expression
- 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]
- def markRuleAsIneffective(ruleId: RuleId): Unit
- def multiTransformDown(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- def multiTransformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Seq[Expression]]): Stream[Expression]
- final def ne(arg0: AnyRef): Boolean
- def nodeName: String
- final val nodePatterns: Seq[TreePattern]
- def nodePatternsInternal(): Seq[TreePattern]
- final def notify(): Unit
- final def notifyAll(): Unit
- def numberedTreeString: String
- val origin: Origin
- def otherCopyArgs: Seq[AnyRef]
- def p(number: Int): Expression
- def prettyJson: String
- def prettyName: String
- def productElementName(n: Int): String
- def productElementNames: Iterator[String]
- def productIterator: Iterator[Any]
- def productPrefix: String
- def references: AttributeSet
- lazy val resolved: Boolean
- final def semanticEquals(other: Expression): Boolean
- def semanticHash(): Int
- def setTagValue[T](tag: TreeNodeTag[T], value: T): Unit
- def simpleString(maxFields: Int): String
- def simpleStringWithNodeId(): String
- def sql: String
- def stateful: Boolean
- 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 transformDownWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformUp(rule: PartialFunction[Expression, Expression]): Expression
- def transformUpWithBeforeAndAfterRuleOnChildren(cond: (Expression) => Boolean, ruleId: RuleId)(rule: PartialFunction[(Expression, Expression), Expression]): Expression
- def transformUpWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- def transformWithPruning(cond: (TreePatternBits) => Boolean, ruleId: RuleId)(rule: PartialFunction[Expression, Expression]): Expression
- lazy val treePatternBits: BitSet
- def treeString(append: (String) => Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): Unit
- final def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int, printOperatorId: Boolean): String
- final def treeString: String
- def typeSuffix: String
- def unsetTagValue[T](tag: TreeNodeTag[T]): Unit
- final def verboseString(maxFields: Int): String
- def verboseStringWithSuffix(maxFields: Int): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def withCanonicalizedChildren: Expression
- final def withNewChildren(newChildren: Seq[Expression]): Expression