case class TableScan(fullName: String, table: Table, columns: Seq[TableColumn], nodeLocation: Option[NodeLocation]) extends Relation with LeafPlan with Product with Serializable
The lowest level operator to access a table
- fullName
original table reference name in SQL. Used for generating SQL text
- table
source table
- columns
projectec columns
- Alphabetic
- By Inheritance
- TableScan
- Serializable
- LeafPlan
- Relation
- LogicalPlan
- SQLSig
- Product
- Equals
- TreeNode
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new TableScan(fullName: String, table: Table, columns: Seq[TableColumn], nodeLocation: Option[NodeLocation])
- fullName
original table reference name in SQL. Used for generating SQL text
- table
source table
- columns
projectec columns
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def childExpressions: Seq[Expression]
Return child expressions associated to this LogicalPlan node
Return child expressions associated to this LogicalPlan node
- returns
child expressions of this node
- Definition Classes
- LogicalPlan
- def children: Seq[LogicalPlan]
All child nodes of this plan node
All child nodes of this plan node
- Definition Classes
- LeafPlan → LogicalPlan → TreeNode
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def collectExpressions(cond: PartialFunction[Expression, Boolean]): List[Expression]
Collect from all input expressions and report matching expressions
Collect from all input expressions and report matching expressions
- Definition Classes
- LogicalPlan
- val columns: Seq[TableColumn]
- def copyInstance(newArgs: Seq[AnyRef]): TableScan.this.type
- Attributes
- protected
- Definition Classes
- LogicalPlan
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val fullName: String
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def inputAttributes: Seq[Attribute]
- Definition Classes
- TableScan → LeafPlan → LogicalPlan
- def inputExpressions: List[Expression]
List all input expressions to the plan
List all input expressions to the plan
- Definition Classes
- LogicalPlan
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mapChildren(f: (LogicalPlan) => LogicalPlan): LogicalPlan
- Definition Classes
- LogicalPlan
- def modelName: String
- Definition Classes
- LogicalPlan
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val nodeLocation: Option[NodeLocation]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def outputAttributes: Seq[Attribute]
- Definition Classes
- TableScan → LogicalPlan
- def pp: String
- Definition Classes
- LogicalPlan
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- lazy val resolved: Boolean
- Definition Classes
- TableScan → LogicalPlan
- def resolvedChildren: Boolean
- Definition Classes
- LogicalPlan
- def sig(config: QuerySignatureConfig): String
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val table: Table
- def toString(): String
- Definition Classes
- TableScan → AnyRef → Any
- def transform(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
Iterate through LogicalPlans and apply matching rules for transformation.
Iterate through LogicalPlans and apply matching rules for transformation. The transformation will be applied to the current node as well.
- Definition Classes
- LogicalPlan
- def transformChildExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan
Transform only child expressions
Transform only child expressions
- Definition Classes
- LogicalPlan
- def transformChildren(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
Transform child node only once
Transform child node only once
- Definition Classes
- LogicalPlan
- def transformChildrenOnce(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
Apply transformOnce for all child nodes.
Apply transformOnce for all child nodes.
- Definition Classes
- LogicalPlan
- def transformExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan
Recursively transform all nested expressions
Recursively transform all nested expressions
- Definition Classes
- LogicalPlan
- def transformOnce(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
Traverse the tree until finding the nodes matching the pattern.
Traverse the tree until finding the nodes matching the pattern. All nodes found from the root will be transformed, and no further recursive match will occur from the transformed nodes.
If you want to continue the transformation for the child nodes, use transformChildren or transformChildrenOnce inside the rule.
- Definition Classes
- LogicalPlan
- def transformUp(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
- Definition Classes
- LogicalPlan
- def transformUpExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan
Depth-first transformation of expression
Depth-first transformation of expression
- Definition Classes
- LogicalPlan
- def traverse[U](rule: PartialFunction[LogicalPlan, U]): Unit
Recursively traverse plan nodes and apply the given function to LogicalPlan nodes
Recursively traverse plan nodes and apply the given function to LogicalPlan nodes
- Definition Classes
- LogicalPlan
- def traverseChildren[U](rule: PartialFunction[LogicalPlan, U]): Unit
Recursively traverse the child plan nodes and apply the given function to LogicalPlan nodes
Recursively traverse the child plan nodes and apply the given function to LogicalPlan nodes
- Definition Classes
- LogicalPlan
- def traverseChildrenOnce[U](rule: PartialFunction[LogicalPlan, U]): Unit
Recursively traverse the child plan nodes until the rule matches.
Recursively traverse the child plan nodes until the rule matches.
- Definition Classes
- LogicalPlan
- def traverseExpressions[U](rule: PartialFunction[Expression, U]): Unit
- Definition Classes
- LogicalPlan
- def traverseOnce[U](rule: PartialFunction[LogicalPlan, U]): Unit
Recursively traverse the plan nodes until the rule matches.
Recursively traverse the plan nodes until the rule matches.
- Definition Classes
- LogicalPlan
- def unresolvedExpressions: Seq[Expression]
- Definition Classes
- LogicalPlan
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated