Interim

Instance Constructors

new Interim(outputFunction: InterimOutput, subgraph: String, component: String, port: String, subPath: String, numRows: Int, child: LogicalPlan, detailedStats: Boolean = false)

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 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
final lazy val canonicalized: LogicalPlan

Definition Classes
QueryPlan
val child: LogicalPlan

Definition Classes
Interim → UnaryNode
final def children: Seq[LogicalPlan]

Definition Classes
UnaryNode → TreeNode
def childrenResolved: Boolean

Definition Classes
LogicalPlan
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @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
val component: String
def conf: SQLConf

Definition Classes
QueryPlan
lazy val constraints: ExpressionSet

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

Definition Classes
TreeNode
val detailedStats: Boolean
def doCanonicalize(): LogicalPlan

Attributes
protected
Definition Classes
QueryPlan
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
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, addSuffix: Boolean): StringBuilder

Definition Classes
TreeNode
def getAliasedConstraints(projectList: Seq[NamedExpression]): Set[Expression]

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

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

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

Attributes
protected
Definition Classes
Logging
def initializeLogIfNecessary(isInterpreter: Boolean): Unit

Attributes
protected
Definition Classes
Logging
def innerChildren: Seq[QueryPlan[_]]

Attributes
protected
Definition Classes
QueryPlan → TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def invalidateStatsCache(): Unit

Definition Classes
LogicalPlanStats
def isCanonicalizedPlan: Boolean

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

Definition Classes
Any
def isStreaming: Boolean

Definition Classes
LogicalPlan
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): Interim.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
Interim → LogicalPlan
def maxRowsPerPartition: Option[Long]

Definition Classes
LogicalPlan
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
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
val numRows: Int
def numberedTreeString: String

Definition Classes
TreeNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

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

Definition Classes
Interim → QueryPlan
val outputFunction: InterimOutput
def outputSet: AttributeSet

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

Definition Classes
TreeNode
val port: String
def prettyJson: String

Definition Classes
TreeNode
def printSchema(): Unit

Definition Classes
QueryPlan
def producedAttributes: AttributeSet

Definition Classes
QueryPlan
def references: AttributeSet

Definition Classes
QueryPlan
def refresh(): Unit

Definition Classes
LogicalPlan
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 resolveQuoted(name: String, resolver: Resolver): Option[NamedExpression]

Definition Classes
LogicalPlan
lazy val resolved: Boolean

Definition Classes
LogicalPlan
final def sameResult(other: LogicalPlan): Boolean

Definition Classes
QueryPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
final def semanticHash(): Int

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
QueryPlan → TreeNode
def statePrefix: String

Attributes
protected
Definition Classes
LogicalPlan → QueryPlan
def stats: Statistics

Definition Classes
LogicalPlanStats
var statsCache: Option[Statistics]

Attributes
protected
Definition Classes
LogicalPlanStats
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
val subPath: String
val subgraph: String
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]): Interim.this.type

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

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

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

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

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

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
def validConstraints: Set[Expression]

Attributes
protected
Definition Classes
UnaryNode → QueryPlanConstraints
def verboseString: String

Definition Classes
QueryPlan → TreeNode
def verboseStringWithSuffix: String

Definition Classes
LogicalPlan → TreeNode
final def wait(arg0: Long, arg1: Int): Unit

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

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

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

Definition Classes
TreeNode

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package sql

case class Interim(outputFunction: InterimOutput, subgraph: String, component: String, port: String, subPath: String, numRows: Int, child: LogicalPlan, detailedStats: Boolean = false) extends UnaryNode with IgnoreCachedData with Product with Serializable

Instance Constructors

new Interim(outputFunction: InterimOutput, subgraph: String, component: String, port: String, subPath: String, numRows: Int, child: LogicalPlan, detailedStats: Boolean = false)

Value Members

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

final lazy val canonicalized: LogicalPlan

val child: LogicalPlan

final def children: Seq[LogicalPlan]

def childrenResolved: Boolean

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]

val component: String

def conf: SQLConf

lazy val constraints: ExpressionSet

lazy val containsChild: Set[TreeNode[_]]

val detailedStats: Boolean

def doCanonicalize(): LogicalPlan

final def eq(arg0: AnyRef): Boolean

final def expressions: Seq[Expression]

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

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, addSuffix: Boolean): StringBuilder

def getAliasedConstraints(projectList: Seq[NamedExpression]): Set[Expression]

final def getClass(): Class[_]

def hashCode(): Int

def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputSet: AttributeSet

final def invalidateStatsCache(): Unit

def isCanonicalizedPlan: Boolean

final def isInstanceOf[T0]: Boolean

def isStreaming: 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 makeCopy(newArgs: Array[AnyRef]): LogicalPlan

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

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

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

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

def maxRows: Option[Long]

def maxRowsPerPartition: Option[Long]

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

val numRows: Int

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def output: Seq[Attribute]

val outputFunction: InterimOutput

def outputSet: AttributeSet