Generate

Instance Constructors

new Generate(generator: Generator, join: Boolean, outer: Boolean, child: SparkPlan)

join
when true, each output row is implicitly joined with the input tuple that produced it.
outer
when true, each input row will be output at least once, even if the output of the given generator is empty. outer has no effect when join is false.

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def apply(number: Int): SparkPlan

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buildRow(values: Seq[Any]): Row

Attributes
protected
Definition Classes
SparkPlan
val child: SparkPlan

Definition Classes
Generate → UnaryNode
def children: List[SparkPlan]

Definition Classes
UnaryNode
def clone(): AnyRef

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

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

Definition Classes
AnyRef
def execute(): RDD[Row]

Runs this query returning the result as an RDD.
Runs this query returning the result as an RDD.

Definition Classes
Generate → SparkPlan
def executeCollect(): Array[Row]

Runs this query returning the result as an array.
Runs this query returning the result as an array.

Definition Classes
SparkPlan
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 flatMap[A](f: (SparkPlan) ⇒ TraversableOnce[A]): Seq[A]

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

Definition Classes
TreeNode
def generateSchemaString(schema: StructType, prefix: String, builder: StringBuilder): StringBuilder

Attributes
protected
Definition Classes
QueryPlan
def generateSchemaString(schema: Seq[Attribute]): String

Attributes
protected
Definition Classes
QueryPlan
def generateTreeString(depth: Int, builder: StringBuilder): StringBuilder

Attributes
protected
Definition Classes
TreeNode
val generator: Generator
def generatorOutput: Seq[Attribute]

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

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

Attributes
protected
Definition Classes
TreeNode
val id: Long

Definition Classes
TreeNode
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val join: Boolean

when true, each output row is implicitly joined with the input tuple that produced it.
lazy val logger: Logger

Attributes
protected
Definition Classes
Logging
def makeCopy(newArgs: Array[AnyRef]): Generate.this.type

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

Definition Classes
TreeNode
def mapChildren(f: (SparkPlan) ⇒ SparkPlan): Generate.this.type

Definition Classes
TreeNode
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
def otherCopyArgs: Seq[AnyRef]

Attributes
protected
Definition Classes
TreeNode
val outer: Boolean

when true, each input row will be output at least once, even if the output of the given generator is empty.
when true, each input row will be output at least once, even if the output of the given generator is empty. outer has no effect when join is false.
def output: Seq[Attribute]

Definition Classes
Generate → QueryPlan
def outputPartitioning: Partitioning

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

Definition Classes
UnaryNode → SparkPlan
def outputSet: Set[Attribute]

Definition Classes
QueryPlan
def printSchema(): Unit

Definition Classes
QueryPlan
def requiredChildDistribution: Seq[Distribution]

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

Definition Classes
SparkPlan
def sameInstance(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def schemaString: String

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
TreeNode
def stringArgs: Iterator[Any]

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

Definition Classes
AnyRef
def toString(): String

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

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

Definition Classes
QueryPlan
def transformChildrenDown(rule: PartialFunction[SparkPlan, SparkPlan]): Generate.this.type

Definition Classes
TreeNode
def transformChildrenUp(rule: PartialFunction[SparkPlan, SparkPlan]): Generate.this.type

Definition Classes
TreeNode
def transformDown(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

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

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

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

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
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[SparkPlan]): Generate.this.type

Definition Classes
TreeNode

case class Generate(generator: Generator, join: Boolean, outer: Boolean, child: SparkPlan) extends SparkPlan with UnaryNode with Product with Serializable

Instance Constructors

new Generate(generator: Generator, join: Boolean, outer: Boolean, child: SparkPlan)

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply(number: Int): SparkPlan

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

def buildRow(values: Seq[Any]): Row

val child: SparkPlan

def children: List[SparkPlan]

def clone(): AnyRef

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

final def eq(arg0: AnyRef): Boolean

def execute(): RDD[Row]

def executeCollect(): Array[Row]

def expressions: Seq[Expression]

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

def finalize(): Unit

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

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

def generateSchemaString(schema: StructType, prefix: String, builder: StringBuilder): StringBuilder

def generateSchemaString(schema: Seq[Attribute]): String

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

val generator: Generator

def generatorOutput: Seq[Attribute]

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): SparkPlan

val id: Long

final def isInstanceOf[T0]: Boolean

val join: Boolean

lazy val logger: Logger

def makeCopy(newArgs: Array[AnyRef]): Generate.this.type

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

def mapChildren(f: (SparkPlan) ⇒ SparkPlan): Generate.this.type

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

def otherCopyArgs: Seq[AnyRef]

val outer: Boolean

def output: Seq[Attribute]

def outputPartitioning: Partitioning

def outputSet: Set[Attribute]

def printSchema(): Unit

def requiredChildDistribution: Seq[Distribution]

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

def schemaString: String

def simpleString: 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]): Generate.this.type

def transformChildrenDown(rule: PartialFunction[SparkPlan, SparkPlan]): Generate.this.type

def transformChildrenUp(rule: PartialFunction[SparkPlan, SparkPlan]): Generate.this.type

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

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

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

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

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

def treeString: String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withNewChildren(newChildren: Seq[SparkPlan]): Generate.this.type

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UnaryNode

Inherited from catalyst.trees.UnaryNode[SparkPlan]

Inherited from SparkPlan