SparkPlan

abstract def canEqual(that: Any): Boolean

abstract def children: Seq[SparkPlan]

abstract def doExecute(): RDD[InternalRow]

Overridden by concrete implementations of SparkPlan.

abstract def output: Seq[Attribute]

abstract def productArity: Int

abstract def productElement(n: Int): Any

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(number: Int): SparkPlan

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

def canProcessSafeRows: Boolean

Specifies whether this operator is capable of processing Java-object-based Rows (i.e.

def canProcessUnsafeRows: Boolean

Specifies whether this operator is capable of processing UnsafeRows

def clone(): AnyRef

val codegenEnabled: Boolean

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

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

lazy val containsChild: Set[TreeNode[_]]

def doPrepare(): Unit

Overridden by concrete implementations of SparkPlan.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def execute(): RDD[InternalRow]

Returns the result of this query as an RDD[InternalRow] by delegating to doExecute after adding query plan information to created RDDs for visualization.

def executeCollect(): Array[Row]

Runs this query returning the result as an array.

def executeTake(n: Int): Array[Row]

Runs this query returning the first n rows as an array.

def expressions: Seq[Expression]

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

def finalize(): Unit

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

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

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

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

def generateTreeString(depth: Int, builder: StringBuilder): StringBuilder

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): SparkPlan

def hashCode(): Int

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]): SparkPlan

Overridden make copy also propogates sqlContext to copied plan.

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

def mapChildren(f: (SparkPlan) ⇒ SparkPlan): SparkPlan

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

def newMutableProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): () ⇒ MutableProjection

def newNaturalAscendingOrdering(dataTypes: Seq[DataType]): Ordering[InternalRow]

Creates a row ordering for the given schema, in natural ascending order.

def newOrdering(order: Seq[SortOrder], inputSchema: Seq[Attribute]): Ordering[InternalRow]

def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): (InternalRow) ⇒ Boolean

def newProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): Projection

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def outputOrdering: Seq[SortOrder]

Specifies how data is ordered in each partition.

def outputPartitioning: Partitioning

Specifies how data is partitioned across different nodes in the cluster.

def outputSet: AttributeSet

def outputsUnsafeRows: Boolean

Specifies whether this operator outputs UnsafeRows

final def prepare(): Unit

Prepare a SparkPlan for execution.

def printSchema(): Unit

def productIterator: Iterator[Any]

def productPrefix: String

def references: AttributeSet

def requiredChildDistribution: Seq[Distribution]

Specifies any partition requirements on the input data for this operator.

def requiredChildOrdering: Seq[Seq[SortOrder]]

Specifies sort order for each partition requirements on the input data for this operator.

lazy val schema: StructType

def schemaString: String

def simpleString: String

def sparkContext: SparkContext

final val sqlContext: SQLContext

A handle to the SQL Context that was used to create this plan.

def statePrefix: String

def stringArgs: Iterator[Any]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def transform(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

def transformAllExpressions(rule: PartialFunction[Expression, Expression]): SparkPlan.this.type

def transformChildren(rule: PartialFunction[SparkPlan, SparkPlan], nextOperation: (SparkPlan, PartialFunction[SparkPlan, SparkPlan]) ⇒ SparkPlan): SparkPlan

def transformDown(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

def transformExpressions(rule: PartialFunction[Expression, Expression]): SparkPlan.this.type

def transformExpressionsDown(rule: PartialFunction[Expression, Expression]): SparkPlan.this.type

def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): SparkPlan.this.type

def transformUp(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

def treeString: String

val unsafeEnabled: Boolean

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withNewChildren(newChildren: Seq[SparkPlan]): SparkPlan