Class

org.apache.spark.sql.catalyst.analysis

UnresolvedRelation

Related Doc: package analysis

Permalink

case class UnresolvedRelation(tableIdentifier: TableIdentifier, alias: Option[String] = None) extends LeafNode with Product with Serializable

Holds the name of a relation that has yet to be looked up in a catalog.

Linear Supertypes
Serializable, Serializable, LeafNode, LogicalPlan, Logging, QueryPlan[LogicalPlan], TreeNode[LogicalPlan], Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnresolvedRelation
  2. Serializable
  3. Serializable
  4. LeafNode
  5. LogicalPlan
  6. Logging
  7. QueryPlan
  8. TreeNode
  9. Product
  10. Equals
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new UnresolvedRelation(tableIdentifier: TableIdentifier, alias: Option[String] = None)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val alias: Option[String]

    Permalink
  5. lazy val allAttributes: Seq[Attribute]

    Permalink

    All the attributes that are used for this plan.

    All the attributes that are used for this plan.

    Definition Classes
    QueryPlan
  6. def analyzed: Boolean

    Permalink

    Returns true if this node and its children have already been gone through analysis and verification.

    Returns true if this node and its children have already been gone through analysis and verification. Note that this is only an optimization used to avoid analyzing trees that have already been analyzed, and can be reset by transformations.

    Definition Classes
    LogicalPlan
  7. def apply(number: Int): LogicalPlan

    Permalink

    Returns the tree node at the specified number.

    Returns the tree node at the specified number. Numbers for each node can be found in the numberedTreeString.

    Definition Classes
    TreeNode
  8. def argString: String

    Permalink

    Returns a string representing the arguments to this node, minus any children

    Returns a string representing the arguments to this node, minus any children

    Definition Classes
    TreeNode
  9. def asCode: String

    Permalink

    Returns a 'scala code' representation of this TreeNode and its children.

    Returns a 'scala code' representation of this TreeNode and its children. Intended for use when debugging where the prettier toString function is obfuscating the actual structure. In the case of 'pure' TreeNodes that only contain primitives and other TreeNodes, the result can be pasted in the REPL to build an equivalent Tree.

    Definition Classes
    TreeNode
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. lazy val canonicalized: LogicalPlan

    Permalink

    Canonicalized copy of this query plan.

    Canonicalized copy of this query plan.

    Definition Classes
    LogicalPlanQueryPlan
  12. def children: Seq[LogicalPlan]

    Permalink

    Returns a Seq of the children of this node.

    Returns a Seq of the children of this node. Children should not change. Immutability required for containsChild optimization

    Definition Classes
    LeafNodeTreeNode
  13. def childrenResolved: Boolean

    Permalink

    Returns true if all its children of this query plan have been resolved.

    Returns true if all its children of this query plan have been resolved.

    Definition Classes
    LogicalPlan
  14. lazy val cleanArgs: Seq[Any]

    Permalink

    Args that have cleaned such that differences in expression id should not affect equality

    Args that have cleaned such that differences in expression id should not affect equality

    Attributes
    protected
    Definition Classes
    QueryPlan
  15. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def collect[B](pf: PartialFunction[LogicalPlan, B]): Seq[B]

    Permalink

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

    Definition Classes
    TreeNode
  17. def collectFirst[B](pf: PartialFunction[LogicalPlan, B]): Option[B]

    Permalink

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Definition Classes
    TreeNode
  18. lazy val constraints: ExpressionSet

    Permalink

    An ExpressionSet that contains invariants about the rows output by this operator.

    An ExpressionSet that contains invariants about the rows output by this operator. For example, if this set contains the expression a = 2 then that expression is guaranteed to evaluate to true for all rows produced.

    Definition Classes
    QueryPlan
  19. lazy val containsChild: Set[TreeNode[_]]

    Permalink
    Definition Classes
    TreeNode
  20. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def expressions: Seq[Expression]

    Permalink

    Returns all of the expressions present in this query plan operator.

    Returns all of the expressions present in this query plan operator.

    Definition Classes
    QueryPlan
  22. def fastEquals(other: TreeNode[_]): Boolean

    Permalink

    Faster version of equality which short-circuits when two treeNodes are the same instance.

    Faster version of equality which short-circuits when two treeNodes are the same instance. We don't just override Object.equals, as doing so prevents the scala compiler from generating case class equals methods

    Definition Classes
    TreeNode
  23. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  24. def find(f: (LogicalPlan) ⇒ Boolean): Option[LogicalPlan]

    Permalink

    Find the first TreeNode that satisfies the condition specified by f.

    Find the first TreeNode that satisfies the condition specified by f. The condition is recursively applied to this node and all of its children (pre-order).

    Definition Classes
    TreeNode
  25. def flatMap[A](f: (LogicalPlan) ⇒ TraversableOnce[A]): Seq[A]

    Permalink

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

    Definition Classes
    TreeNode
  26. def foreach(f: (LogicalPlan) ⇒ Unit): Unit

    Permalink

    Runs the given function on this node and then recursively on children.

    Runs the given function on this node and then recursively on children.

    f

    the function to be applied to each node in the tree.

    Definition Classes
    TreeNode
  27. def foreachUp(f: (LogicalPlan) ⇒ Unit): Unit

    Permalink

    Runs the given function recursively on children then on this node.

    Runs the given function recursively on children then on this node.

    f

    the function to be applied to each node in the tree.

    Definition Classes
    TreeNode
  28. def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder): StringBuilder

    Permalink

    Appends the string represent of this node and its children to the given StringBuilder.

    Appends the string represent of this node and its children to the given StringBuilder.

    The i-th element in lastChildren indicates whether the ancestor of the current node at depth i + 1 is the last child of its own parent node. The depth of the root node is 0, and lastChildren for the root node should be empty.

    Definition Classes
    TreeNode
  29. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  30. def getNodeNumbered(number: MutableInt): LogicalPlan

    Permalink
    Attributes
    protected
    Definition Classes
    TreeNode
  31. def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

    Permalink

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Attributes
    protected
    Definition Classes
    QueryPlan
  32. def hashCode(): Int

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  33. def initializeLogIfNecessary(isInterpreter: Boolean): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  34. def innerChildren: Seq[LogicalPlan]

    Permalink

    All the nodes that are parts of this node.

    All the nodes that are parts of this node.

    For example:

    WholeStageCodegen +- SortMergeJoin |-- InputAdapter | +-- Sort +-- InputAdapter +-- Sort

    the innerChildren of WholeStageCodegen will be Seq(SortMergeJoin), it will generate a tree string like this:

    WholeStageCodegen : +- SortMergeJoin : :- INPUT : :- INPUT :- Sort :- Sort

    Definition Classes
    QueryPlanTreeNode
  35. def inputSet: AttributeSet

    Permalink

    The set of all attributes that are input to this operator by its children.

    The set of all attributes that are input to this operator by its children.

    Definition Classes
    QueryPlan
  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  37. def isStreaming: Boolean

    Permalink

    Returns true if this subtree contains any streaming data sources.

    Returns true if this subtree contains any streaming data sources.

    Definition Classes
    LogicalPlan
  38. def isTraceEnabled(): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  39. def jsonFields: List[JField]

    Permalink
    Attributes
    protected
    Definition Classes
    TreeNode
  40. def log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  41. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  42. def logDebug(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  43. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  44. def logError(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  45. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  46. def logInfo(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  47. def logName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  48. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  49. def logTrace(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  50. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  51. def logWarning(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  52. def makeCopy(newArgs: Array[AnyRef]): LogicalPlan

    Permalink

    Creates a copy of this type of tree node after a transformation.

    Creates a copy of this type of tree node after a transformation. Must be overridden by child classes that have constructor arguments that are not present in the productIterator.

    newArgs

    the new product arguments.

    Definition Classes
    TreeNode
  53. def map[A](f: (LogicalPlan) ⇒ A): Seq[A]

    Permalink

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    f

    the function to be applied.

    Definition Classes
    TreeNode
  54. def mapChildren(f: (LogicalPlan) ⇒ LogicalPlan): LogicalPlan

    Permalink

    Returns a copy of this node where f has been applied to all the nodes children.

    Returns a copy of this node where f has been applied to all the nodes children.

    Definition Classes
    TreeNode
  55. def maxRows: Option[Long]

    Permalink

    Returns the maximum number of rows that this plan may compute.

    Returns the maximum number of rows that this plan may compute.

    Any operator that a Limit can be pushed passed should override this function (e.g., Union). Any operator that can push through a Limit should override this function (e.g., Project).

    Definition Classes
    LogicalPlan
  56. def missingInput: AttributeSet

    Permalink

    Attributes that are referenced by expressions but not provided by this nodes children.

    Attributes that are referenced by expressions but not provided by this nodes children. Subclasses should override this method if they produce attributes internally as it is used by assertions designed to prevent the construction of invalid plans.

    Definition Classes
    QueryPlan
  57. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  58. def nodeName: String

    Permalink

    Returns the name of this type of TreeNode.

    Returns the name of this type of TreeNode. Defaults to the class name. Note that we remove the "Exec" suffix for physical operators here.

    Definition Classes
    TreeNode
  59. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  60. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  61. def numberedTreeString: String

    Permalink

    Returns a string representation of the nodes in this tree, where each operator is numbered.

    Returns a string representation of the nodes in this tree, where each operator is numbered. The numbers can be used with apply to easily access specific subtrees.

    Definition Classes
    TreeNode
  62. val origin: Origin

    Permalink
    Definition Classes
    TreeNode
  63. def otherCopyArgs: Seq[AnyRef]

    Permalink

    Args to the constructor that should be copied, but not transformed.

    Args to the constructor that should be copied, but not transformed. These are appended to the transformed args automatically by makeCopy

    Attributes
    protected
    Definition Classes
    TreeNode
  64. def output: Seq[Attribute]

    Permalink
    Definition Classes
    UnresolvedRelationQueryPlan
  65. def outputSet: AttributeSet

    Permalink

    Returns the set of attributes that are output by this node.

    Returns the set of attributes that are output by this node.

    Definition Classes
    QueryPlan
  66. def prettyJson: String

    Permalink
    Definition Classes
    TreeNode
  67. def printSchema(): Unit

    Permalink

    Prints out the schema in the tree format

    Prints out the schema in the tree format

    Definition Classes
    QueryPlan
  68. def producedAttributes: AttributeSet

    Permalink

    The set of all attributes that are produced by this node.

    The set of all attributes that are produced by this node.

    Definition Classes
    LeafNodeQueryPlan
  69. def references: AttributeSet

    Permalink

    All Attributes that appear in expressions from this operator.

    All Attributes that appear in expressions from this operator. Note that this set does not include attributes that are implicitly referenced by being passed through to the output tuple.

    Definition Classes
    QueryPlan
  70. def resolve(nameParts: Seq[String], input: Seq[Attribute], resolver: Resolver): Option[NamedExpression]

    Permalink

    Performs attribute resolution given a name and a sequence of possible attributes.

    Performs attribute resolution given a name and a sequence of possible attributes.

    Attributes
    protected
    Definition Classes
    LogicalPlan
  71. def resolve(nameParts: Seq[String], resolver: Resolver): Option[NamedExpression]

    Permalink

    Optionally resolves the given strings to a NamedExpression based on the output of this LogicalPlan.

    Optionally resolves the given strings to a NamedExpression based on the output of this LogicalPlan. The attribute is expressed as string in the following form: [scope].AttributeName.[nested].[fields]....

    Definition Classes
    LogicalPlan
  72. def resolve(schema: StructType, resolver: Resolver): Seq[Attribute]

    Permalink

    Resolves a given schema to concrete Attribute references in this query plan.

    Resolves a given schema to concrete Attribute references in this query plan. This function should only be called on analyzed plans since it will throw AnalysisException for unresolved Attributes.

    Definition Classes
    LogicalPlan
  73. def resolveChildren(nameParts: Seq[String], resolver: Resolver): Option[NamedExpression]

    Permalink

    Optionally resolves the given strings to a NamedExpression using the input from all child nodes of this LogicalPlan.

    Optionally resolves the given strings to a NamedExpression using the input from all child nodes of this LogicalPlan. The attribute is expressed as as string in the following form: [scope].AttributeName.[nested].[fields]....

    Definition Classes
    LogicalPlan
  74. def resolveExpressions(r: PartialFunction[Expression, Expression]): LogicalPlan

    Permalink

    Recursively transforms the expressions of a tree, skipping nodes that have already been analyzed.

    Recursively transforms the expressions of a tree, skipping nodes that have already been analyzed.

    Definition Classes
    LogicalPlan
  75. def resolveOperators(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Permalink

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order).

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order). When rule does not apply to a given node, it is left unchanged. This function is similar to transformUp, but skips sub-trees that have already been marked as analyzed.

    rule

    the function use to transform this nodes children

    Definition Classes
    LogicalPlan
  76. def resolveQuoted(name: String, resolver: Resolver): Option[NamedExpression]

    Permalink

    Given an attribute name, split it to name parts by dot, but don't split the name parts quoted by backticks, for example, ab.cd.efg should be split into two parts "ab.cd" and "efg".

    Given an attribute name, split it to name parts by dot, but don't split the name parts quoted by backticks, for example, ab.cd.efg should be split into two parts "ab.cd" and "efg".

    Definition Classes
    LogicalPlan
  77. lazy val resolved: Boolean

    Permalink

    Returns true if this expression and all its children have been resolved to a specific schema and false if it still contains any unresolved placeholders.

    Returns true if this expression and all its children have been resolved to a specific schema and false if it still contains any unresolved placeholders. Implementations of LogicalPlan can override this (e.g. UnresolvedRelation should return false).

    Definition Classes
    UnresolvedRelationLogicalPlan
  78. def sameResult(plan: LogicalPlan): Boolean

    Permalink

    Returns true when the given query plan will return the same results as this query plan.

    Returns true when the given query plan will return the same results as this query plan.

    Since its likely undecidable to generally determine if two given plans will produce the same results, it is okay for this function to return false, even if the results are actually the same. Such behavior will not affect correctness, only the application of performance enhancements like caching. However, it is not acceptable to return true if the results could possibly be different.

    By default this function performs a modified version of equality that is tolerant of cosmetic differences like attribute naming and or expression id differences. Operators that can do better should override this function.

    Definition Classes
    QueryPlan
  79. lazy val schema: StructType

    Permalink
    Definition Classes
    QueryPlan
  80. def schemaString: String

    Permalink

    Returns the output schema in the tree format.

    Returns the output schema in the tree format.

    Definition Classes
    QueryPlan
  81. def simpleString: String

    Permalink

    String representation of this node without any children.

    String representation of this node without any children.

    Definition Classes
    QueryPlanTreeNode
  82. def statePrefix: String

    Permalink

    A prefix string used when printing the plan.

    A prefix string used when printing the plan.

    We use "!" to indicate an invalid plan, and "'" to indicate an unresolved plan.

    Attributes
    protected
    Definition Classes
    LogicalPlanQueryPlan
  83. def statistics: Statistics

    Permalink

    Computes Statistics for this plan.

    Computes Statistics for this plan. The default implementation assumes the output cardinality is the product of all child plan's cardinality, i.e. applies in the case of cartesian joins.

    LeafNodes must override this.

    Definition Classes
    LogicalPlan
  84. def stringArgs: Iterator[Any]

    Permalink

    The arguments that should be included in the arg string.

    The arguments that should be included in the arg string. Defaults to the productIterator.

    Attributes
    protected
    Definition Classes
    TreeNode
  85. def subqueries: Seq[LogicalPlan]

    Permalink

    All the subqueries of current plan.

    All the subqueries of current plan.

    Definition Classes
    QueryPlan
  86. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  87. val tableIdentifier: TableIdentifier

    Permalink
  88. def tableName: String

    Permalink

    Returns a . separated name for this relation.

  89. def toJSON: String

    Permalink
    Definition Classes
    TreeNode
  90. def toString(): String

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  91. def transform(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Permalink

    Returns a copy of this node where rule has been recursively applied to the tree.

    Returns a copy of this node where rule has been recursively applied to the tree. When rule does not apply to a given node it is left unchanged. Users should not expect a specific directionality. If a specific directionality is needed, transformDown or transformUp should be used.

    rule

    the function use to transform this nodes children

    Definition Classes
    TreeNode
  92. def transformAllExpressions(rule: PartialFunction[Expression, Expression]): UnresolvedRelation.this.type

    Permalink

    Returns the result of running transformExpressions on this node and all its children.

    Returns the result of running transformExpressions on this node and all its children.

    Definition Classes
    QueryPlan
  93. def transformChildren(rule: PartialFunction[LogicalPlan, LogicalPlan], nextOperation: (LogicalPlan, PartialFunction[LogicalPlan, LogicalPlan]) ⇒ LogicalPlan): LogicalPlan

    Permalink

    Returns a copy of this node where rule has been recursively applied to all the children of this node.

    Returns a copy of this node where rule has been recursively applied to all the children of this node. When rule does not apply to a given node it is left unchanged.

    rule

    the function used to transform this nodes children

    Attributes
    protected
    Definition Classes
    TreeNode
  94. def transformDown(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Permalink

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order).

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order). When rule does not apply to a given node it is left unchanged.

    rule

    the function used to transform this nodes children

    Definition Classes
    TreeNode
  95. def transformExpressions(rule: PartialFunction[Expression, Expression]): UnresolvedRelation.this.type

    Permalink

    Runs transform with rule on all expressions present in this query operator.

    Runs transform with rule on all expressions present in this query operator. Users should not expect a specific directionality. If a specific directionality is needed, transformExpressionsDown or transformExpressionsUp should be used.

    rule

    the rule to be applied to every expression in this operator.

    Definition Classes
    QueryPlan
  96. def transformExpressionsDown(rule: PartialFunction[Expression, Expression]): UnresolvedRelation.this.type

    Permalink

    Runs transformDown with rule on all expressions present in this query operator.

    Runs transformDown with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

    Definition Classes
    QueryPlan
  97. def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): UnresolvedRelation.this.type

    Permalink

    Runs transformUp with rule on all expressions present in this query operator.

    Runs transformUp with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

    Definition Classes
    QueryPlan
  98. def transformUp(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Permalink

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order).

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order). When rule does not apply to a given node, it is left unchanged.

    rule

    the function use to transform this nodes children

    Definition Classes
    TreeNode
  99. def treeChildren: Seq[LogicalPlan]

    Permalink

    All the nodes that will be used to generate tree string.

    All the nodes that will be used to generate tree string.

    For example:

    WholeStageCodegen +-- SortMergeJoin |-- InputAdapter | +-- Sort +-- InputAdapter +-- Sort

    the treeChildren of WholeStageCodegen will be Seq(Sort, Sort), it will generate a tree string like this:

    WholeStageCodegen : +- SortMergeJoin : :- INPUT : :- INPUT :- Sort :- Sort

    Attributes
    protected
    Definition Classes
    TreeNode
  100. def treeString: String

    Permalink

    Returns a string representation of the nodes in this tree

    Returns a string representation of the nodes in this tree

    Definition Classes
    TreeNode
  101. def validConstraints: Set[Expression]

    Permalink

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic.

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic. These constraints are then canonicalized and filtered automatically to contain only those attributes that appear in the outputSet.

    See Canonicalize for more details.

    Attributes
    protected
    Definition Classes
    QueryPlan
  102. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  103. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  105. def withNewChildren(newChildren: Seq[LogicalPlan]): LogicalPlan

    Permalink

    Returns a copy of this node with the children replaced.

    Returns a copy of this node with the children replaced. TODO: Validate somewhere (in debug mode?) that children are ordered correctly.

    Definition Classes
    TreeNode

Inherited from Serializable

Inherited from Serializable

Inherited from LeafNode

Inherited from LogicalPlan

Inherited from Logging

Inherited from QueryPlan[LogicalPlan]

Inherited from TreeNode[LogicalPlan]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped