case class DropView(viewName: QName, ifExists: Boolean, nodeLocation: Option[NodeLocation]) extends DDL with Product with Serializable

Linear Supertypes
Serializable, DDL, LeafPlan, LogicalPlan, SQLSig, Product, Equals, TreeNode[LogicalPlan], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DropView
  2. Serializable
  3. DDL
  4. LeafPlan
  5. LogicalPlan
  6. SQLSig
  7. Product
  8. Equals
  9. TreeNode
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DropView(viewName: QName, ifExists: Boolean, nodeLocation: Option[NodeLocation])

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def children: Seq[LogicalPlan]

    All child nodes of this plan node

    All child nodes of this plan node

    Definition Classes
    LeafPlanLogicalPlanTreeNode
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  7. 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
  8. def copyInstance(newArgs: Seq[AnyRef]): DropView.this.type
    Attributes
    protected
    Definition Classes
    LogicalPlan
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def expressions: Seq[Expression]

    Expressions associated to this LogicalPlan node

    Expressions associated to this LogicalPlan node

    Definition Classes
    LogicalPlan
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  12. val ifExists: Boolean
  13. def inputAttributes: Seq[Attribute]
    Definition Classes
    LeafPlanLogicalPlan
  14. def inputExpressions: List[Expression]

    List all input expressions to the plan

    List all input expressions to the plan

    Definition Classes
    LogicalPlan
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def mapChildren(f: (LogicalPlan) => LogicalPlan): LogicalPlan
    Definition Classes
    LogicalPlan
  17. def modelName: String
    Definition Classes
    LogicalPlan
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. val nodeLocation: Option[NodeLocation]

    returns

    the code location in the SQL text if available

    Definition Classes
    DropViewTreeNode
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  22. def outputAttributes: Seq[Attribute]
    Definition Classes
    DDLLogicalPlan
  23. def pp: String
    Definition Classes
    LogicalPlan
  24. def productElementNames: Iterator[String]
    Definition Classes
    Product
  25. lazy val resolved: Boolean
    Definition Classes
    LogicalPlan
  26. def resolvedChildren: Boolean
    Definition Classes
    LogicalPlan
  27. def sig(config: QuerySignatureConfig): String
    Definition Classes
    DropViewSQLSig
  28. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  29. 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
  30. def transformChildExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan

    Transform only child expressions

    Transform only child expressions

    Definition Classes
    LogicalPlan
  31. def transformChildren(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Transform child node only once

    Transform child node only once

    Definition Classes
    LogicalPlan
  32. def transformChildrenOnce(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

    Apply transformOnce for all child nodes.

    Apply transformOnce for all child nodes.

    Definition Classes
    LogicalPlan
  33. def transformExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan

    Recursively transform all nested expressions

    Recursively transform all nested expressions

    Definition Classes
    LogicalPlan
  34. 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
  35. def transformUp(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan
    Definition Classes
    LogicalPlan
  36. def transformUpExpressions(rule: PartialFunction[Expression, Expression]): LogicalPlan

    Depth-first transformation of expression

    Depth-first transformation of expression

    Definition Classes
    LogicalPlan
  37. 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
  38. 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
  39. 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
  40. def traverseExpressions[U](rule: PartialFunction[Expression, U]): Unit
    Definition Classes
    LogicalPlan
  41. 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
  42. def unresolvedExpressions: Seq[Expression]
    Definition Classes
    LogicalPlan
  43. val viewName: QName
  44. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  45. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  46. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Serializable

Inherited from DDL

Inherited from LeafPlan

Inherited from LogicalPlan

Inherited from SQLSig

Inherited from Product

Inherited from Equals

Inherited from TreeNode[LogicalPlan]

Inherited from AnyRef

Inherited from Any

Ungrouped