InsertIntoHadoopFsRelationCommand

Instance Constructors

new InsertIntoHadoopFsRelationCommand(outputPath: Path, staticPartitionKeys: TablePartitionSpec, customPartitionLocations: Map[TablePartitionSpec, String], partitionColumns: Seq[Attribute], bucketSpec: Option[BucketSpec], fileFormat: FileFormat, refreshFunction: (Seq[TablePartitionSpec]) ⇒ Unit, options: Map[String, String], query: LogicalPlan, mode: SaveMode, catalogTable: Option[CatalogTable])

staticPartitionKeys
partial partitioning spec for write. This defines the scope of partition overwrites: when the spec is empty, all partitions are overwritten. When it covers a prefix of the partition keys, only partitions matching the prefix are overwritten.
customPartitionLocations
mapping of partition specs to their custom locations. The caller should guarantee that exactly those table partitions falling under the specified static partition keys are contained in this map, and that no other partitions are.

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
lazy val allAttributes: AttributeSeq

Definition Classes
QueryPlan
def analyzed: Boolean

Definition Classes
LogicalPlan
def apply(number: Int): TreeNode[_]

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
val bucketSpec: Option[BucketSpec]
lazy val canonicalized: LogicalPlan

Definition Classes
LogicalPlan → QueryPlan
val catalogTable: Option[CatalogTable]
final def children: Seq[LogicalPlan]

Definition Classes
LeafNode → TreeNode
def childrenResolved: Boolean

Definition Classes
LogicalPlan
lazy val cleanArgs: Seq[Any]

Attributes
protected
Definition Classes
QueryPlan
def cleanExpression(e: Expression): Expression

Attributes
protected
Definition Classes
QueryPlan
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
def collectLeaves(): Seq[LogicalPlan]

Definition Classes
TreeNode
lazy val constraints: ExpressionSet

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

Definition Classes
TreeNode
val customPartitionLocations: Map[TablePartitionSpec, String]

mapping of partition specs to their custom locations.
mapping of partition specs to their custom locations. The caller should guarantee that exactly those table partitions falling under the specified static partition keys are contained in this map, and that no other partitions are.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def expressions: Seq[Expression]

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

Definition Classes
TreeNode
val fileFormat: FileFormat
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, verbose: Boolean, prefix: String): StringBuilder

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

Definition Classes
AnyRef → Any
def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
def hashCode(): Int

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

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

Attributes
protected
Definition Classes
InsertIntoHadoopFsRelationCommand → QueryPlan → TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isDebugEnabled: Boolean

Attributes
protected
Definition Classes
Logging
final def isInfoEnabled: Boolean

Attributes
protected
Definition Classes
Logging
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isStreaming: Boolean

Definition Classes
LogicalPlan
final def isTraceEnabled: Boolean

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

Attributes
protected
Definition Classes
TreeNode
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
def map[A](f: (LogicalPlan) ⇒ A): Seq[A]

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

Definition Classes
TreeNode
def mapExpressions(f: (Expression) ⇒ Expression): InsertIntoHadoopFsRelationCommand.this.type

Definition Classes
QueryPlan
def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

Attributes
protected
Definition Classes
TreeNode
def maxRows: Option[Long]

Definition Classes
LogicalPlan
def missingInput: AttributeSet

Definition Classes
QueryPlan
val mode: SaveMode
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
Command → QueryPlan
val outputPath: Path
def outputSet: AttributeSet

Definition Classes
QueryPlan
def p(number: Int): LogicalPlan

Definition Classes
TreeNode
val partitionColumns: Seq[Attribute]
def prettyJson: String

Definition Classes
TreeNode
def printSchema(): Unit

Definition Classes
QueryPlan
def producedAttributes: AttributeSet

Definition Classes
LeafNode → QueryPlan
val query: LogicalPlan
def references: AttributeSet

Definition Classes
QueryPlan
def refresh(): Unit

Definition Classes
LogicalPlan
val refreshFunction: (Seq[TablePartitionSpec]) ⇒ Unit
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 resolve(schema: StructType, resolver: Resolver): Seq[Attribute]

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 run(sparkSession: SparkSession): Seq[Row]

Definition Classes
InsertIntoHadoopFsRelationCommand → RunnableCommand
def sameResult(plan: LogicalPlan): Boolean

Definition Classes
QueryPlan
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
val staticPartitionKeys: TablePartitionSpec

partial partitioning spec for write.
partial partitioning spec for write. This defines the scope of partition overwrites: when the spec is empty, all partitions are overwritten. When it covers a prefix of the partition keys, only partitions matching the prefix are overwritten.
def statistics: Statistics

Definition Classes
LogicalPlan
def stringArgs: Iterator[Any]

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

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

Definition Classes
AnyRef
def toJSON: String

Definition Classes
TreeNode
def toString(): String

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

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

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

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

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

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

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

Definition Classes
TreeNode
def treeString(verbose: Boolean): String

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
def validConstraints: Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
def verboseString: String

Definition Classes
QueryPlan → TreeNode
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

Instance Constructors

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

lazy val allAttributes: AttributeSeq

def analyzed: Boolean

def apply(number: Int): TreeNode[_]

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

val bucketSpec: Option[BucketSpec]

lazy val canonicalized: LogicalPlan

val catalogTable: Option[CatalogTable]

final def children: Seq[LogicalPlan]

def childrenResolved: Boolean

lazy val cleanArgs: Seq[Any]

def cleanExpression(e: Expression): Expression

def clone(): AnyRef

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

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

def collectLeaves(): Seq[LogicalPlan]

lazy val constraints: ExpressionSet

lazy val containsChild: Set[TreeNode[_]]

val customPartitionLocations: Map[TablePartitionSpec, String]

final def eq(arg0: AnyRef): Boolean

final def expressions: Seq[Expression]

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

val fileFormat: FileFormat

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, verbose: Boolean, prefix: String): StringBuilder

final def getClass(): Class[_]

def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

def hashCode(): Int

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[LogicalPlan]

def inputSet: AttributeSet

final def isDebugEnabled: Boolean

final def isInfoEnabled: Boolean

final def isInstanceOf[T0]: Boolean

def isStreaming: Boolean

final def isTraceEnabled: Boolean

def jsonFields: List[JField]

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

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

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

def mapExpressions(f: (Expression) ⇒ Expression): InsertIntoHadoopFsRelationCommand.this.type

def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

def maxRows: Option[Long]

def missingInput: AttributeSet

val mode: SaveMode

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]

val outputPath: Path

def outputSet: AttributeSet