LogisticRegressionExpr

Instance Constructors

new LogisticRegressionExpr(genotypes: Expression, phenotypes: Expression, covariates: Expression, test: 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
def apply(number: Int): TreeNode[_]

Definition Classes
TreeNode
def argString: 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
LogisticRegressionExpr → ExpectsInputTypes → Expression
def children: Seq[Expression]

Definition Classes
LogisticRegressionExpr → TreeNode
def childrenResolved: Boolean

Definition Classes
Expression
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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
lazy val containsChild: Set[TreeNode[_]]

Definition Classes
TreeNode
val covariates: Expression
def dataType: DataType

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

Short hand for generating quaternary evaluation code.
Short hand for generating quaternary evaluation code. If either of the sub-expressions is null, the result of this computation is assumed to be null.
f
accepts four variable names and returns Java code to compute the output.

Attributes
protected
Definition Classes
QuaternaryExpression
lazy val deterministic: Boolean

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

Definition Classes
LogisticRegressionExpr → Expression
final def eq(arg0: AnyRef): Boolean

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

Default behavior of evaluation according to the default nullability of QuaternaryExpression.
Default behavior of evaluation according to the default nullability of QuaternaryExpression. If subclass of QuaternaryExpression override nullable, probably should also override this.

Definition Classes
QuaternaryExpression → Expression
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 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
QuaternaryExpression → 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], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

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

Definition Classes
LogisticRegressionExpr → 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
lazy val matrixUDT: MatrixUDT
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 nullSafeCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, String) ⇒ String): ExprCode

Short hand for generating quaternary evaluation code.
Short hand for generating quaternary evaluation code. If either of the sub-expressions is null, the result of this computation is assumed to be null.
f
function that accepts the 4 non-null evaluation result names of children and returns Java code to compute the output.

Attributes
protected
Definition Classes
QuaternaryExpression
def nullSafeEval(genotypes: Any, phenotypes: Any, covariates: Any, test: Any): Any

Called by default eval implementation.
Called by default eval implementation. If subclass of QuaternaryExpression keep the default nullability, they can override this method to save null-check code. If we need full control of evaluation process, we should override eval.

Attributes
protected
Definition Classes
LogisticRegressionExpr → QuaternaryExpression
def nullable: Boolean

Definition Classes
QuaternaryExpression → 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
val phenotypes: Expression
def prettyJson: String

Definition Classes
TreeNode
def prettyName: String

Definition Classes
LogisticRegressionExpr → 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: 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
val test: Expression
lazy val testStr: String
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(verbose: Boolean, addSuffix: Boolean): String

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
final def verboseString: String

Definition Classes
Expression → TreeNode
def verboseStringWithSuffix: 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[Expression]): Expression

Definition Classes
TreeNode

Related Docs: object LogisticRegressionExpr | package expressions

case class LogisticRegressionExpr(genotypes: Expression, phenotypes: Expression, covariates: Expression, test: Expression) extends QuaternaryExpression with ImplicitCastInputTypes with Product with Serializable

Instance Constructors

new LogisticRegressionExpr(genotypes: Expression, phenotypes: Expression, covariates: Expression, test: Expression)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: Expression

def checkInputDataTypes(): TypeCheckResult

def children: Seq[Expression]

def childrenResolved: Boolean

def clone(): AnyRef

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

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

def collectLeaves(): Seq[Expression]

lazy val containsChild: Set[TreeNode[_]]

val covariates: Expression

def dataType: DataType

def defineCodeGen(ctx: CodegenContext, ev: ExprCode, f: (String, String, String, 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 finalize(): Unit

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], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

val genotypes: Expression

final def getClass(): Class[_]

def hashCode(): Int

def innerChildren: Seq[TreeNode[_]]

def inputTypes: Seq[DataType]

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]

lazy val matrixUDT: MatrixUDT

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, String, String) ⇒ String): ExprCode

def nullSafeEval(genotypes: Any, phenotypes: Any, covariates: Any, test: Any): Any

def nullable: Boolean

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def p(number: Int): Expression

val phenotypes: Expression

def prettyJson: String

def prettyName: String

def references: AttributeSet

lazy val resolved: Boolean

def semanticEquals(other: Expression): Boolean

def semanticHash(): Int

def simpleString: String

def sql: String

def stringArgs: Iterator[Any]

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

val test: Expression

lazy val testStr: String

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