NonRecursivePlans

abstract def canEqual(that: Any): Boolean

abstract def children: Seq[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

lazy val allAttributes: AttributeSeq

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

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: SparkPlan

lazy val cleanArgs: Seq[Any]

def cleanExpression(e: Expression): Expression

def clone(): AnyRef

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

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

def collectLeaves(): Seq[SparkPlan]

lazy val constraints: ExpressionSet

lazy val containsChild: Set[TreeNode[_]]

def doExecute(): RDD[InternalRow]

def doExecuteBroadcast[T](): Broadcast[T]

def doPrepare(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def execute(): RDD[InternalRow]

final def executeBroadcast[T](): Broadcast[T]

def executeCollect(): Array[InternalRow]

def executeCollectPublic(): Array[Row]

final def executeQuery[T](query: ⇒ T): T

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

def executeToIterator(): Iterator[InternalRow]

final 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, 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[QueryPlan[_]]

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

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 longMetric(name: String): SQLMetric

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

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

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

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

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

def metadata: Map[String, String]

def metrics: Map[String, SQLMetric]

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

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

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

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

def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): Predicate

def nodeName: String

final var nonCodeGeneratedPlanCalls: Int

Variable to disallow recursive generation so will mark the case of non-codegenerated case and throw back exception to use CodegenSparkFallback.

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def outputOrdering: Seq[SortOrder]

def outputPartitioning: Partitioning

def outputSet: AttributeSet

def p(number: Int): SparkPlan

final def prepare(): Unit

def prepareSubqueries(): Unit

def prettyJson: String

def printSchema(): Unit

def producedAttributes: AttributeSet

def productIterator: Iterator[Any]

def productPrefix: String

def references: AttributeSet

def requiredChildDistribution: Seq[Distribution]

def requiredChildOrdering: Seq[Seq[SortOrder]]

def resetMetrics(): Unit

def sameResult(plan: SparkPlan): Boolean

lazy val schema: StructType

def schemaString: String

def simpleString: String

def sparkContext: SparkContext

final val sqlContext: SQLContext

def statePrefix: String

def stringArgs: Iterator[Any]

val subexpressionEliminationEnabled: Boolean

def subqueries: Seq[SparkPlan]

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

def toJSON: String

def toString(): String

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

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

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

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

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

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

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

def treeString(verbose: Boolean): String

def treeString: String

def validConstraints: Set[Expression]

def verboseString: String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def waitForSubqueries(): Unit

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