BinaryHashJoinNode

Instance Constructors

new BinaryHashJoinNode(conf: SQLConf, leftKeys: Seq[Expression], rightKeys: Seq[Expression], buildSide: BuildSide, left: LocalNode, right: LocalNode)

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
def apply(number: Int): LocalNode

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def asIterator: Iterator[InternalRow]

Returns the content through the Iterator interface.
Returns the content through the Iterator interface.

Definition Classes
LocalNode
val buildSide: BuildSide

Definition Classes
BinaryHashJoinNode → HashJoinNode
def canProcessSafeRows: Boolean

Specifies whether this operator is capable of processing Java-object-based Rows (i.e.
Specifies whether this operator is capable of processing Java-object-based Rows (i.e. rows that are not UnsafeRows).

Definition Classes
LocalNode
def canProcessUnsafeRows: Boolean

Specifies whether this operator is capable of processing UnsafeRows
Specifies whether this operator is capable of processing UnsafeRows

Definition Classes
LocalNode
def children: Seq[LocalNode]

Definition Classes
BinaryLocalNode → TreeNode
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def close(): Unit

Closes the iterator and releases all resources.
Closes the iterator and releases all resources. It should be idempotent.
Implementations of this must also call the close() function of its children.

Definition Classes
BinaryHashJoinNode → LocalNode
final def collect(): Seq[Row]

Returns the content of the iterator from the beginning to the end in the form of a Scala Seq.
Returns the content of the iterator from the beginning to the end in the form of a Scala Seq.

Definition Classes
LocalNode
def collect[B](pf: PartialFunction[LocalNode, B]): Seq[B]

Definition Classes
TreeNode
def collectFirst[B](pf: PartialFunction[LocalNode, B]): Option[B]

Definition Classes
TreeNode
val conf: SQLConf
lazy val containsChild: Set[TreeNode[_]]

Definition Classes
TreeNode
def doOpen(): Unit

Custom open implementation to be overridden by subclasses.
Custom open implementation to be overridden by subclasses.

Attributes
protected
Definition Classes
BinaryHashJoinNode → HashJoinNode
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def expressions: Seq[Expression]

Definition Classes
QueryPlan
def fastEquals(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def fetch(): InternalRow

Definition Classes
HashJoinNode
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(f: (LocalNode) ⇒ Boolean): Option[LocalNode]

Definition Classes
TreeNode
def flatMap[A](f: (LocalNode) ⇒ TraversableOnce[A]): Seq[A]

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

Definition Classes
TreeNode
def foreachUp(f: (LocalNode) ⇒ Unit): Unit

Definition Classes
TreeNode
def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder): StringBuilder

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

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

Attributes
protected
Definition Classes
TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
val left: LocalNode

Definition Classes
BinaryHashJoinNode → BinaryLocalNode
val leftKeys: Seq[Expression]
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]): LocalNode

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

Definition Classes
TreeNode
def mapChildren(f: (LocalNode) ⇒ LocalNode): LocalNode

Definition Classes
TreeNode
def missingInput: AttributeSet

Definition Classes
QueryPlan
final def ne(arg0: AnyRef): Boolean

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

Attributes
protected
Definition Classes
LocalNode
def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): (InternalRow) ⇒ Boolean

Attributes
protected
Definition Classes
LocalNode
def newProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): Projection

Attributes
protected
Definition Classes
LocalNode
def next(): Boolean

Definition Classes
HashJoinNode
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 open(): Unit

Definition Classes
HashJoinNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

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

Definition Classes
BinaryHashJoinNode → QueryPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
def outputsUnsafeRows: Boolean

Specifies whether this operator outputs UnsafeRows
Specifies whether this operator outputs UnsafeRows

Definition Classes
LocalNode
def prepare(): Unit

Called before open().
Called before open(). Prepare can be used to reserve memory needed. It must NOT consume any input data.
Implementations of this must also call the prepare() function of its children.

Definition Classes
LocalNode
def printSchema(): Unit

Definition Classes
QueryPlan
def references: AttributeSet

Definition Classes
QueryPlan
val right: LocalNode

Definition Classes
BinaryHashJoinNode → BinaryLocalNode
val rightKeys: Seq[Expression]
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
QueryPlan → TreeNode
def statePrefix: String

Attributes
protected
Definition Classes
QueryPlan
val streamedKeys: Seq[Expression]

Attributes
protected
Definition Classes
BinaryHashJoinNode → HashJoinNode
val streamedNode: LocalNode

Attributes
protected
Definition Classes
BinaryHashJoinNode → HashJoinNode
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[LocalNode, LocalNode]): LocalNode

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

Definition Classes
QueryPlan
def transformChildren(rule: PartialFunction[LocalNode, LocalNode], nextOperation: (LocalNode, PartialFunction[LocalNode, LocalNode]) ⇒ LocalNode): LocalNode

Attributes
protected
Definition Classes
TreeNode
def transformDown(rule: PartialFunction[LocalNode, LocalNode]): LocalNode

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

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

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

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

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 withHashedRelation(hashedRelation: HashedRelation): Unit

Sets the HashedRelation used by this node.
Sets the HashedRelation used by this node. This method needs to be called after before the first next gets called.

Attributes
protected
Definition Classes
HashJoinNode
def withNewChildren(newChildren: Seq[LocalNode]): LocalNode

Definition Classes
TreeNode

Related Doc: package local

case class BinaryHashJoinNode(conf: SQLConf, leftKeys: Seq[Expression], rightKeys: Seq[Expression], buildSide: BuildSide, left: LocalNode, right: LocalNode) extends BinaryLocalNode with HashJoinNode with Product with Serializable

Instance Constructors

new BinaryHashJoinNode(conf: SQLConf, leftKeys: Seq[Expression], rightKeys: Seq[Expression], buildSide: BuildSide, left: LocalNode, right: LocalNode)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(number: Int): LocalNode

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

final def asIterator: Iterator[InternalRow]

val buildSide: BuildSide

def canProcessSafeRows: Boolean

def canProcessUnsafeRows: Boolean

def children: Seq[LocalNode]

def clone(): AnyRef

def close(): Unit

final def collect(): Seq[Row]

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

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

val conf: SQLConf

lazy val containsChild: Set[TreeNode[_]]

def doOpen(): Unit

final def eq(arg0: AnyRef): Boolean

def expressions: Seq[Expression]

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

def fetch(): InternalRow

def finalize(): Unit

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

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

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

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

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder): StringBuilder

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): LocalNode

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

val left: LocalNode

val leftKeys: Seq[Expression]

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

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

def mapChildren(f: (LocalNode) ⇒ LocalNode): LocalNode

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

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

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

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

def next(): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

def open(): Unit

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def output: Seq[Attribute]

def outputSet: AttributeSet

def outputsUnsafeRows: Boolean

def prepare(): Unit

def printSchema(): Unit

def references: AttributeSet

val right: LocalNode

val rightKeys: Seq[Expression]

lazy val schema: StructType