LeftSemiJoinHash

Instance Constructors

new LeftSemiJoinHash(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: SparkPlan)

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
val buildKeys: Seq[Expression]
val buildPlan: SparkPlan
def buildRow(values: Seq[Any]): Row

Attributes
protected
Definition Classes
SparkPlan
lazy val buildSideKeyGenerator: Projection
def children: Seq[SparkPlan]

Definition Classes
BinaryNode
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
LeftSemiJoinHash → 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
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 left: SparkPlan

Definition Classes
LeftSemiJoinHash → BinaryNode
val leftKeys: Seq[Expression]
lazy val logger: Logger

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

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

Definition Classes
TreeNode
def mapChildren(f: (SparkPlan) ⇒ SparkPlan): LeftSemiJoinHash.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
def output: Seq[Attribute]

Definition Classes
LeftSemiJoinHash → 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
LeftSemiJoinHash → SparkPlan
def outputSet: Set[Attribute]

Definition Classes
QueryPlan
def printSchema(): Unit

Definition Classes
QueryPlan
def requiredChildDistribution: List[ClusteredDistribution]

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

Definition Classes
LeftSemiJoinHash → SparkPlan
val right: SparkPlan

Definition Classes
LeftSemiJoinHash → BinaryNode
val rightKeys: Seq[Expression]
def sameInstance(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def schemaString: String

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
TreeNode
lazy val streamSideKeyGenerator: () ⇒ MutableProjection
val streamedKeys: Seq[Expression]
val streamedPlan: SparkPlan
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]): LeftSemiJoinHash.this.type

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

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

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

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

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

Definition Classes
QueryPlan
def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): LeftSemiJoinHash.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]): LeftSemiJoinHash.this.type

Definition Classes
TreeNode

case class LeftSemiJoinHash(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: SparkPlan) extends SparkPlan with BinaryNode with Product with Serializable

Instance Constructors

new LeftSemiJoinHash(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: 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

val buildKeys: Seq[Expression]

val buildPlan: SparkPlan

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

lazy val buildSideKeyGenerator: Projection

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

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): SparkPlan

val id: Long

final def isInstanceOf[T0]: Boolean

val left: SparkPlan

val leftKeys: Seq[Expression]

lazy val logger: Logger

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

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

def mapChildren(f: (SparkPlan) ⇒ SparkPlan): LeftSemiJoinHash.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]

def output: Seq[Attribute]

def outputPartitioning: Partitioning

def outputSet: Set[Attribute]

def printSchema(): Unit

def requiredChildDistribution: List[ClusteredDistribution]

val right: SparkPlan

val rightKeys: Seq[Expression]

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

def schemaString: String

def simpleString: String

lazy val streamSideKeyGenerator: () ⇒ MutableProjection

val streamedKeys: Seq[Expression]

val streamedPlan: SparkPlan

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]): LeftSemiJoinHash.this.type

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

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

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

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

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

def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): LeftSemiJoinHash.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]): LeftSemiJoinHash.this.type

Inherited from Serializable

Inherited from Serializable