The narrowest possible type that is produced when this expression is evaluated.
The narrowest possible type that is produced when this expression is evaluated.
Returns the tree node at the specified number.
Returns the tree node at the specified number. Numbers for each node can be found in the numberedTreeString.
Returns a string representing the arguments to this node, minus any children
Returns a string representing the arguments to this node, minus any children
Returns a 'scala code' representation of this TreeNode
and its children.
Returns a 'scala code' representation of this TreeNode
and its children. Intended for use
when debugging where the prettier toString function is obfuscating the actual structure. In the
case of 'pure' TreeNodes
that only contain primitives and other TreeNodes, the result can be
pasted in the REPL to build an equivalent Tree.
Base should return the generic aggregate expression that this function is computing
Base should return the generic aggregate expression that this function is computing
Evaluation helper function for 2 Comparable children expressions.
Evaluation helper function for 2 Comparable children expressions. Those expressions are supposed to be in the same data type, and the return type should be Integer: Negative value: 1st argument less than 2nd argument Zero: 1st argument equals 2nd argument Positive value: 1st argument greater than 2nd argument
Either one of the expressions result is null, the evaluation result should be null.
Returns true if all the children of this expression have been resolved to a specific schema and false if any still contains any unresolved placeholders.
Returns true if all the children of this expression have been resolved to a specific schema and false if any still contains any unresolved placeholders.
Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.
Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.
Returns the DataType of the result of evaluating this expression.
Returns the DataType of the result of evaluating this expression. It is
invalid to query the dataType of an unresolved expression (i.e., when resolved
== false).
AggregateExpression.eval should never be invoked because AggregateExpression's are replaced with a physical aggregate operator at runtime.
AggregateExpression.eval should never be invoked because AggregateExpression's are replaced with a physical aggregate operator at runtime.
Evaluation helper function for 1 Fractional children expression.
Evaluation helper function for 1 Fractional children expression. if the expression result is null, the evaluation result should be null.
Evaluation helper function for 2 Fractional children expressions.
Evaluation helper function for 2 Fractional children expressions. Those expressions are supposed to be in the same data type, and also the return type. Either one of the expressions result is null, the evaluation result should be null.
Faster version of equality which short-circuits when two treeNodes are the same instance.
Faster version of equality which short-circuits when two treeNodes are the same instance.
We don't just override Object.Equals, as doing so prevents the scala compiler from from
generating case class equals
methods
Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.
Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.
Returns true when an expression is a candidate for static evaluation before the query is executed.
Returns true when an expression is a candidate for static evaluation before the query is executed.
The following conditions are used to determine suitability for constant folding:
Runs the given function on this node and then recursively on children.
Appends the string represent of this node and its children to the given StringBuilder.
Appends the string represent of this node and its children to the given StringBuilder.
Evaluation helper function for 1 Integral children expression.
Evaluation helper function for 1 Integral children expression. if the expression result is null, the evaluation result should be null.
Evaluation helper function for 2 Integral children expressions.
Evaluation helper function for 2 Integral children expressions. Those expressions are supposed to be in the same data type, and also the return type. Either one of the expressions result is null, the evaluation result should be null.
Creates a copy of this type of tree node after a transformation.
Creates a copy of this type of tree node after a transformation. Must be overridden by child classes that have constructor arguments that are not present in the productIterator.
the new product arguments.
Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.
Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.
the function to be applied.
Returns a copy of this node where f
has been applied to all the nodes children.
Returns a copy of this node where f
has been applied to all the nodes children.
A set of helper functions that return the correct descendant of scala.math.Numeric[T]
type
and do any casting necessary of child evaluation.
A set of helper functions that return the correct descendant of scala.math.Numeric[T]
type
and do any casting necessary of child evaluation.
Evaluation helper function for 2 Numeric children expressions.
Evaluation helper function for 2 Numeric children expressions. Those expressions are supposed to be in the same data type, and also the return type. Either one of the expressions result is null, the evaluation result should be null.
Creates a new instance that can be used to compute this aggregate expression for a group of input rows/
Creates a new instance that can be used to compute this aggregate expression for a group of input rows/
Returns the name of this type of TreeNode.
Returns the name of this type of TreeNode. Defaults to the class name.
Returns a string representation of the nodes in this tree, where each operator is numbered.
Args to the constructor that should be copied, but not transformed.
Args to the constructor that should be copied, but not transformed. These are appended to the transformed args automatically by makeCopy
Returns true
if this expression and all its children have been resolved to a specific schema
and false
if it still contains any unresolved placeholders.
Returns true
if this expression and all its children have been resolved to a specific schema
and false
if it still contains any unresolved placeholders. Implementations of expressions
should override this if the resolution of this type of expression involves more than just
the resolution of its children.
String representation of this node without any children
String representation of this node without any children
The arguments that should be included in the arg string.
The arguments that should be included in the arg string. Defaults to the productIterator
.
Returns a copy of this node where rule
has been recursively applied to the tree.
Returns a copy of this node where rule
has been recursively applied to the tree.
When rule
does not apply to a given node it is left unchanged.
Users should not expect a specific directionality. If a specific directionality is needed,
transformDown or transformUp should be used.
the function use to transform this nodes children
Returns a copy of this node where rule
has been recursively applied to all the children of
this node.
Returns a copy of this node where rule
has been recursively applied to all the children of
this node. When rule
does not apply to a given node it is left unchanged.
the function used to transform this nodes children
Returns a copy of this node where rule
has been recursively applied to it and all of its
children (pre-order).
Returns a copy of this node where rule
has been recursively applied to it and all of its
children (pre-order). When rule
does not apply to a given node it is left unchanged.
the function used to transform this nodes children
Returns a copy of this node where rule
has been recursively applied first to all of its
children and then itself (post-order).
Returns a copy of this node where rule
has been recursively applied first to all of its
children and then itself (post-order). When rule
does not apply to a given node, it is left
unchanged.
the function use to transform this nodes children
Returns a string representation of the nodes in this tree
Returns a string representation of the nodes in this tree
Returns a copy of this node with the children replaced.
Returns a copy of this node with the children replaced. TODO: Validate somewhere (in debug mode?) that children are ordered correctly.