CreateTableUsing

Instance Constructors

new CreateTableUsing(tableIdent: TableIdentifier, userSpecifiedSchema: Option[StructType], provider: String, temporary: Boolean, options: Map[String, String], allowExisting: Boolean, managedIfNoPath: Boolean)

allowExisting
If it is true, we will do nothing when the table already exists. If it is false, an exception will be thrown

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
val allowExisting: Boolean

If it is true, we will do nothing when the table already exists.
If it is true, we will do nothing when the table already exists. If it is false, an exception will be thrown
def analyzed: Boolean

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

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
def children: Seq[LogicalPlan]

Definition Classes
CreateTableUsing → TreeNode
def childrenResolved: Boolean

Definition Classes
LogicalPlan
lazy val cleanArgs: Seq[Any]

Attributes
protected
Definition Classes
LogicalPlan
def clone(): AnyRef

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

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

Definition Classes
TreeNode
lazy val containsChild: Set[TreeNode[_]]

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

Definition Classes
AnyRef
def expressions: Seq[Expression]

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

Definition Classes
TreeNode
def finalize(): Unit

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

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

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

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

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

Attributes
protected
Definition Classes
TreeNode
final def getClass(): Class[_]

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

Attributes
protected
Definition Classes
TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
def log: Logger

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

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

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

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

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

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

Attributes
protected
Definition Classes
Logging
def logName: String

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

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

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

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

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

Definition Classes
TreeNode
val managedIfNoPath: Boolean
def map[A](f: (LogicalPlan) ⇒ A): Seq[A]

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

Definition Classes
TreeNode
def missingInput: AttributeSet

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

Definition Classes
AnyRef
def nodeName: String

Definition Classes
TreeNode
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numberedTreeString: String

Definition Classes
TreeNode
val options: Map[String, String]
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

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

Definition Classes
CreateTableUsing → QueryPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
def printSchema(): Unit

Definition Classes
QueryPlan
val provider: String
def references: AttributeSet

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

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

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

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

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

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

Definition Classes
LogicalPlan
lazy val resolved: Boolean

Definition Classes
LogicalPlan
def sameResult(plan: LogicalPlan): Boolean

Definition Classes
LogicalPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
QueryPlan → TreeNode
def statePrefix: String

Attributes
protected
Definition Classes
LogicalPlan → QueryPlan
def statistics: Statistics

Definition Classes
LogicalPlan
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val tableIdent: TableIdentifier
val temporary: Boolean
def toString(): String

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

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

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

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

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

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

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

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
val userSpecifiedSchema: Option[StructType]
final def wait(): Unit

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

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

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

Definition Classes
TreeNode

Related Doc: package datasources

case class CreateTableUsing(tableIdent: TableIdentifier, userSpecifiedSchema: Option[StructType], provider: String, temporary: Boolean, options: Map[String, String], allowExisting: Boolean, managedIfNoPath: Boolean) extends LogicalPlan with Command with Product with Serializable

Instance Constructors

new CreateTableUsing(tableIdent: TableIdentifier, userSpecifiedSchema: Option[StructType], provider: String, temporary: Boolean, options: Map[String, String], allowExisting: Boolean, managedIfNoPath: Boolean)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val allowExisting: Boolean

def analyzed: Boolean

def apply(number: Int): LogicalPlan

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

def children: Seq[LogicalPlan]

def childrenResolved: Boolean

lazy val cleanArgs: Seq[Any]

def clone(): AnyRef

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

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

lazy val containsChild: Set[TreeNode[_]]

final def eq(arg0: AnyRef): Boolean

def expressions: Seq[Expression]

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

def finalize(): Unit

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

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

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

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

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder): StringBuilder

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): LogicalPlan

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

def log: Logger

def logDebug(msg: ⇒ String, throwable: Throwable): Unit

def logDebug(msg: ⇒ String): Unit

def logError(msg: ⇒ String, throwable: Throwable): Unit

def logError(msg: ⇒ String): Unit

def logInfo(msg: ⇒ String, throwable: Throwable): Unit

def logInfo(msg: ⇒ String): Unit

def logName: String

def logTrace(msg: ⇒ String, throwable: Throwable): Unit

def logTrace(msg: ⇒ String): Unit

def logWarning(msg: ⇒ String, throwable: Throwable): Unit

def logWarning(msg: ⇒ String): Unit

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

val managedIfNoPath: Boolean

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

def mapChildren(f: (LogicalPlan) ⇒ LogicalPlan): LogicalPlan

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

val options: Map[String, String]

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def output: Seq[Attribute]

def outputSet: AttributeSet

def printSchema(): Unit

val provider: String

def references: AttributeSet

def resolve(nameParts: Seq[String], input: Seq[Attribute], resolver: Resolver): Option[NamedExpression]

def resolve(nameParts: Seq[String], resolver: Resolver): Option[NamedExpression]

def resolveChildren(nameParts: Seq[String], resolver: Resolver): Option[NamedExpression]

def resolveExpressions(r: PartialFunction[Expression, Expression]): LogicalPlan

def resolveOperators(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

def resolveQuoted(name: String, resolver: Resolver): Option[NamedExpression]

lazy val resolved: Boolean

def sameResult(plan: LogicalPlan): Boolean

lazy val schema: StructType

def schemaString: String

def simpleString: String

def statePrefix: String

def statistics: Statistics

def stringArgs: Iterator[Any]