CompressExpression

Instance Constructors

new CompressExpression(codecName: String, conf: HadoopConfiguration, _child: Expression)

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
val _child: Expression
def apply(number: Int): TreeNode[_]

Definition Classes
TreeNode
def argString(maxFields: Int): String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
lazy val canonicalized: Expression

Definition Classes
Expression
def checkInputDataTypes(): TypeCheckResult

Definition Classes
ExpectsInputTypes → Expression
def child: Expression

Definition Classes
CompressExpression → UnaryExpression
final def children: Seq[Expression]

Definition Classes
UnaryExpression → TreeNode
def childrenResolved: Boolean

Definition Classes
Expression
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
val codecName: String
def collect[B](pf: PartialFunction[Expression, B]): Seq[B]

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

Definition Classes
TreeNode
def collectLeaves(): Seq[Expression]

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

Definition Classes
TreeNode
def dataType: DataType

Definition Classes
CompressExpression → Expression
def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String) ⇒ String): ExprCode

Attributes
protected
Definition Classes
UnaryExpression
lazy val deterministic: Boolean

Definition Classes
CompressExpression → Expression
def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode

Attributes
protected
Definition Classes
CompressExpression → Expression
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def eval(input: InternalRow): Any

Definition Classes
UnaryExpression → Expression
def fastEquals(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def find(f: (Expression) ⇒ Boolean): Option[Expression]

Definition Classes
TreeNode
def flatArguments: Iterator[Any]

Attributes
protected
Definition Classes
Expression
def flatMap[A](f: (Expression) ⇒ TraversableOnce[A]): Seq[A]

Definition Classes
TreeNode
def foldable: Boolean

Definition Classes
UnaryExpression → Expression
def foreach(f: (Expression) ⇒ Unit): Unit

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

Definition Classes
TreeNode
def genCode(ctx: CodegenContext): ExprCode

Definition Classes
Expression
def generateTreeString(depth: Int, lastChildren: Seq[Boolean], append: (String) ⇒ Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int): Unit

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

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

Definition Classes
TreeNode → AnyRef → Any
def innerChildren: Seq[TreeNode[_]]

Attributes
protected
Definition Classes
TreeNode
def inputTypes: Seq[BinaryType]

Definition Classes
CompressExpression → ExpectsInputTypes
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def jsonFields: List[JField]

Attributes
protected
Definition Classes
TreeNode
def makeCopy(newArgs: Array[AnyRef]): Expression

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

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

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

Attributes
protected
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
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String) ⇒ String): ExprCode

Attributes
protected
Definition Classes
UnaryExpression
def nullSafeEval(input: Any): Any

Attributes
protected
Definition Classes
CompressExpression → UnaryExpression
def nullable: Boolean

Definition Classes
UnaryExpression → Expression
def numberedTreeString: String

Definition Classes
TreeNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

Attributes
protected
Definition Classes
TreeNode
def p(number: Int): Expression

Definition Classes
TreeNode
def prettyJson: String

Definition Classes
TreeNode
def prettyName: String

Definition Classes
CompressExpression → Expression
def references: AttributeSet

Definition Classes
Expression
lazy val resolved: Boolean

Definition Classes
Expression
def semanticEquals(other: Expression): Boolean

Definition Classes
Expression
def semanticHash(): Int

Definition Classes
Expression
def simpleString(maxFields: Int): String

Definition Classes
Expression → TreeNode
def sql: String

Definition Classes
Expression
def stringArgs: Iterator[Any]

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

Definition Classes
AnyRef
def toJSON: String

Definition Classes
TreeNode
def toString(): String

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

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

Definition Classes
TreeNode
def transformUp(rule: PartialFunction[Expression, Expression]): Expression

Definition Classes
TreeNode
def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int): Unit

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
final def verboseString(maxFields: Int): String

Definition Classes
Expression → TreeNode
def verboseStringWithSuffix(maxFields: Int): String

Definition Classes
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[Expression]): Expression

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 Docs: object CompressExpression | package utils

case class CompressExpression(codecName: String, conf: HadoopConfiguration, _child: Expression) extends UnaryExpression with ExpectsInputTypes with Product with Serializable

Instance Constructors

new CompressExpression(codecName: String, conf: HadoopConfiguration, _child: Expression)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val _child: Expression

def apply(number: Int): TreeNode[_]

def argString(maxFields: Int): String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: Expression

def checkInputDataTypes(): TypeCheckResult

def child: Expression

final def children: Seq[Expression]

def childrenResolved: Boolean

def clone(): AnyRef

val codecName: String

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

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

def collectLeaves(): Seq[Expression]

val conf: HadoopConfiguration

lazy val containsChild: Set[TreeNode[_]]

def dataType: DataType

def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String) ⇒ String): ExprCode

lazy val deterministic: Boolean

def doGenCode(ctx: CodegenContext, ev: ExprCode): ExprCode

final def eq(arg0: AnyRef): Boolean

def eval(input: InternalRow): Any

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

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

def flatArguments: Iterator[Any]

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

def foldable: Boolean

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

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

def genCode(ctx: CodegenContext): ExprCode

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], append: (String) ⇒ Unit, verbose: Boolean, prefix: String, addSuffix: Boolean, maxFields: Int): Unit

final def getClass(): Class[_]

def hashCode(): Int

def innerChildren: Seq[TreeNode[_]]

def inputTypes: Seq[BinaryType]

final def isInstanceOf[T0]: Boolean

def jsonFields: List[JField]

def makeCopy(newArgs: Array[AnyRef]): Expression

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

def mapChildren(f: (Expression) ⇒ Expression): Expression

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

final def ne(arg0: AnyRef): Boolean

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String) ⇒ String): ExprCode

def nullSafeEval(input: Any): Any

def nullable: Boolean

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def p(number: Int): Expression

def prettyJson: String

def prettyName: String

def references: AttributeSet

lazy val resolved: Boolean

def semanticEquals(other: Expression): Boolean

def semanticHash(): Int

def simpleString(maxFields: Int): String

def sql: String

def stringArgs: Iterator[Any]

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

def toJSON: String

def toString(): String

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

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

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

def treeString(append: (String) ⇒ Unit, verbose: Boolean, addSuffix: Boolean, maxFields: Int): Unit

def treeString(verbose: Boolean, addSuffix: Boolean, maxFields: Int): String

def treeString: String