BinaryLocalNode

abstract def canEqual(that: Any): Boolean

abstract def close(): Unit

Closes the iterator and releases all resources.

abstract def fetch(): InternalRow

Returns the current tuple.

abstract def left: LocalNode

abstract def next(): Boolean

Advances the iterator to the next tuple.

abstract def open(): Unit

Initializes the iterator state.

abstract def output: Seq[Attribute]

abstract def productArity: Int

abstract def productElement(n: Int): Any

abstract def right: LocalNode

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]

Returns the content through the Iterator interface.

def canProcessSafeRows: Boolean

Specifies whether this operator is capable of processing Java-object-based Rows (i.e.

def canProcessUnsafeRows: Boolean

Specifies whether this operator is capable of processing UnsafeRows

def children: Seq[LocalNode]

def clone(): AnyRef

final def collect(): Seq[Row]

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

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

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

lazy val containsChild: Set[TreeNode[_]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def expressions: Seq[Expression]

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

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 hashCode(): Int

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

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 nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def outputSet: AttributeSet

def outputsUnsafeRows: Boolean

Specifies whether this operator outputs UnsafeRows

def prepare(): Unit

Called before open().

def printSchema(): Unit

def productIterator: Iterator[Any]

def productPrefix: String

def references: AttributeSet

lazy val schema: StructType

def schemaString: String

def simpleString: String

def statePrefix: String

def stringArgs: Iterator[Any]

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

def toString(): String

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

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

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

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

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

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

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

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

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