Class/Object

org.apache.spark.sql.catalyst.expressions.aggregate

ApproximatePercentile

Related Docs: object ApproximatePercentile | package aggregate

Permalink

case class ApproximatePercentile(child: Expression, percentageExpression: Expression, accuracyExpression: Expression, mutableAggBufferOffset: Int, inputAggBufferOffset: Int) extends TypedImperativeAggregate[PercentileDigest] with ImplicitCastInputTypes with Product with Serializable

The ApproximatePercentile function returns the approximate percentile(s) of a column at the given percentage(s). A percentile is a watermark value below which a given percentage of the column values fall. For example, the percentile of column col at percentage 50% is the median of column col.

This function supports partial aggregation.

child

child expression that can produce column value with child.eval(inputRow)

percentageExpression

Expression that represents a single percentage value or an array of percentage values. Each percentage value must be between 0.0 and 1.0.

accuracyExpression

Integer literal expression of approximation accuracy. Higher value yields better accuracy, the default value is DEFAULT_PERCENTILE_ACCURACY.

Annotations
@ExpressionDescription()
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ApproximatePercentile
  2. Serializable
  3. Serializable
  4. ImplicitCastInputTypes
  5. ExpectsInputTypes
  6. TypedImperativeAggregate
  7. ImperativeAggregate
  8. CodegenFallback
  9. AggregateFunction
  10. Expression
  11. TreeNode
  12. Product
  13. Equals
  14. AnyRef
  15. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ApproximatePercentile(child: Expression, percentageExpression: Expression)

    Permalink
  2. new ApproximatePercentile(child: Expression, percentageExpression: Expression, accuracyExpression: Expression)

    Permalink
  3. new ApproximatePercentile(child: Expression, percentageExpression: Expression, accuracyExpression: Expression, mutableAggBufferOffset: Int, inputAggBufferOffset: Int)

    Permalink

    child

    child expression that can produce column value with child.eval(inputRow)

    percentageExpression

    Expression that represents a single percentage value or an array of percentage values. Each percentage value must be between 0.0 and 1.0.

    accuracyExpression

    Integer literal expression of approximation accuracy. Higher value yields better accuracy, the default value is DEFAULT_PERCENTILE_ACCURACY.

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val accuracyExpression: Expression

    Permalink

    Integer literal expression of approximation accuracy.

    Integer literal expression of approximation accuracy. Higher value yields better accuracy, the default value is DEFAULT_PERCENTILE_ACCURACY.

  5. final lazy val aggBufferAttributes: Seq[AttributeReference]

    Permalink

    Attributes of fields in aggBufferSchema.

    Attributes of fields in aggBufferSchema.

    Definition Classes
    TypedImperativeAggregateAggregateFunction
  6. final def aggBufferSchema: StructType

    Permalink

    The schema of the aggregation buffer.

    The schema of the aggregation buffer.

    Definition Classes
    TypedImperativeAggregateAggregateFunction
  7. def apply(number: Int): TreeNode[_]

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    Note that this cannot return BaseType because logical plan's plan node might return physical plan for innerChildren, e.g. in-memory relation logical plan node has a reference to the physical plan node it is referencing.

    Definition Classes
    TreeNode
  8. def argString: String

    Permalink

    Returns a string representing the arguments to this node, minus any children

    Returns a string representing the arguments to this node, minus any children

    Definition Classes
    TreeNode
  9. def asCode: String

    Permalink

    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.

    Definition Classes
    TreeNode
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. lazy val canonicalized: Expression

    Permalink

    Returns an expression where a best effort attempt has been made to transform this in a way that preserves the result but removes cosmetic variations (case sensitivity, ordering for commutative operations, etc.) See Canonicalize for more details.

    Returns an expression where a best effort attempt has been made to transform this in a way that preserves the result but removes cosmetic variations (case sensitivity, ordering for commutative operations, etc.) See Canonicalize for more details.

    deterministic expressions where this.canonicalized == other.canonicalized will always evaluate to the same result.

    Definition Classes
    Expression
  12. def checkInputDataTypes(): TypeCheckResult

    Permalink

    Checks the input data types, returns TypeCheckResult.success if it's valid, or returns a TypeCheckResult with an error message if invalid.

    Checks the input data types, returns TypeCheckResult.success if it's valid, or returns a TypeCheckResult with an error message if invalid. Note: it's not valid to call this method until childrenResolved == true.

    Definition Classes
    ApproximatePercentileExpectsInputTypesExpression
  13. val child: Expression

    Permalink

    child expression that can produce column value with child.eval(inputRow)

  14. def children: Seq[Expression]

    Permalink

    Returns a Seq of the children of this node.

    Returns a Seq of the children of this node. Children should not change. Immutability required for containsChild optimization

    Definition Classes
    ApproximatePercentileTreeNode
  15. def childrenResolved: Boolean

    Permalink

    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.

    Definition Classes
    Expression
  16. def clone(): AnyRef

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

    Permalink

    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.

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

    Permalink

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

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

    Permalink

    Returns a Seq containing the leaves in this tree.

    Returns a Seq containing the leaves in this tree.

    Definition Classes
    TreeNode
  20. lazy val containsChild: Set[TreeNode[_]]

    Permalink
    Definition Classes
    TreeNode
  21. def createAggregationBuffer(): PercentileDigest

    Permalink

    Creates an empty aggregation buffer object.

    Creates an empty aggregation buffer object. This is called before processing each key group (group by key).

    returns

    an aggregation buffer object

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  22. def dataType: DataType

    Permalink

    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).

    Definition Classes
    ApproximatePercentileExpression
  23. def defaultResult: Option[Literal]

    Permalink

    Result of the aggregate function when the input is empty.

    Result of the aggregate function when the input is empty. This is currently only used for the proper rewriting of distinct aggregate functions.

    Definition Classes
    AggregateFunction
  24. def deserialize(bytes: Array[Byte]): PercentileDigest

    Permalink

    De-serializes the serialized format Array[Byte], and produces aggregation buffer object T

    De-serializes the serialized format Array[Byte], and produces aggregation buffer object T

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  25. def deterministic: Boolean

    Permalink

    Returns true when the current expression always return the same result for fixed inputs from children.

    Returns true when the current expression always return the same result for fixed inputs from children.

    Note that this means that an expression should be considered as non-deterministic if: - it relies on some mutable internal state, or - it relies on some implicit input that is not part of the children expression list. - it has non-deterministic child or children.

    An example would be SparkPartitionID that relies on the partition id returned by TaskContext. By default leaf expressions are deterministic as Nil.forall(_.deterministic) returns true.

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

    Permalink

    Returns Java source code that can be compiled to evaluate this expression.

    Returns Java source code that can be compiled to evaluate this expression. The default behavior is to call the eval method of the expression. Concrete expression implementations should override this to do actual code generation.

    ctx

    a CodegenContext

    ev

    an ExprCode with unique terms.

    returns

    an ExprCode containing the Java source code to generate the given expression

    Attributes
    protected
    Definition Classes
    CodegenFallbackExpression
  27. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  28. def eval(buffer: PercentileDigest): Any

    Permalink

    Generates the final aggregation result value for current key group with the aggregation buffer object.

    Generates the final aggregation result value for current key group with the aggregation buffer object.

    buffer

    aggregation buffer object.

    returns

    The aggregation result of current key group

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  29. final def eval(buffer: InternalRow): Any

    Permalink

    Returns the result of evaluating this expression on a given input Row

    Returns the result of evaluating this expression on a given input Row

    Definition Classes
    TypedImperativeAggregateExpression
  30. def fastEquals(other: TreeNode[_]): Boolean

    Permalink

    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 generating case class equals methods

    Definition Classes
    TreeNode
  31. def finalize(): Unit

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

    Permalink

    Find the first TreeNode that satisfies the condition specified by f.

    Find the first TreeNode that satisfies the condition specified by f. The condition is recursively applied to this node and all of its children (pre-order).

    Definition Classes
    TreeNode
  33. def flatArguments: Iterator[Any]

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

    Permalink

    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.

    Definition Classes
    TreeNode
  35. final def foldable: Boolean

    Permalink

    An aggregate function is not foldable.

    An aggregate function is not foldable.

    Definition Classes
    AggregateFunctionExpression
  36. def foreach(f: (Expression) ⇒ Unit): Unit

    Permalink

    Runs the given function on this node and then recursively on children.

    Runs the given function on this node and then recursively on children.

    f

    the function to be applied to each node in the tree.

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

    Permalink

    Runs the given function recursively on children then on this node.

    Runs the given function recursively on children then on this node.

    f

    the function to be applied to each node in the tree.

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

    Permalink

    Returns an ExprCode, that contains the Java source code to generate the result of evaluating the expression on an input row.

    Returns an ExprCode, that contains the Java source code to generate the result of evaluating the expression on an input row.

    ctx

    a CodegenContext

    returns

    ExprCode

    Definition Classes
    Expression
  39. def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String = "", addSuffix: Boolean = false): StringBuilder

    Permalink

    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.

    The i-th element in lastChildren indicates whether the ancestor of the current node at depth i + 1 is the last child of its own parent node. The depth of the root node is 0, and lastChildren for the root node should be empty.

    Note that this traversal (numbering) order must be the same as getNodeNumbered.

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

    Permalink
    Definition Classes
    AnyRef → Any
  41. def hashCode(): Int

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  42. final def initialize(buffer: InternalRow): Unit

    Permalink

    Initializes the mutable aggregation buffer located in mutableAggBuffer.

    Initializes the mutable aggregation buffer located in mutableAggBuffer.

    Use fieldNumber + mutableAggBufferOffset to access fields of mutableAggBuffer.

    Definition Classes
    TypedImperativeAggregateImperativeAggregate
  43. def innerChildren: Seq[TreeNode[_]]

    Permalink

    All the nodes that should be shown as a inner nested tree of this node.

    All the nodes that should be shown as a inner nested tree of this node. For example, this can be used to show sub-queries.

    Attributes
    protected
    Definition Classes
    TreeNode
  44. final lazy val inputAggBufferAttributes: Seq[AttributeReference]

    Permalink

    Attributes of fields in input aggregation buffers (immutable aggregation buffers that are merged with mutable aggregation buffers in the merge() function or merge expressions).

    Attributes of fields in input aggregation buffers (immutable aggregation buffers that are merged with mutable aggregation buffers in the merge() function or merge expressions). These attributes are created automatically by cloning the aggBufferAttributes.

    Definition Classes
    TypedImperativeAggregateAggregateFunction
  45. val inputAggBufferOffset: Int

    Permalink

    The offset of this function's start buffer value in the underlying shared input aggregation buffer.

    The offset of this function's start buffer value in the underlying shared input aggregation buffer. An input aggregation buffer is used when we merge two aggregation buffers together in the update() function and is immutable (we merge an input aggregation buffer and a mutable aggregation buffer and then store the new buffer values to the mutable aggregation buffer).

    An input aggregation buffer may contain extra fields, such as grouping keys, at its start, so mutableAggBufferOffset and inputAggBufferOffset are often different.

    For example, say we have a grouping expression, key, and two aggregate functions, avg(x) and avg(y). In the shared input aggregation buffer, the position of the first buffer value of avg(x) will be 1 and the position of the first buffer value of avg(y) will be 3 (position 0 is used for the value of key):

    avg(x) inputAggBufferOffset = 1
             |
             v
    +--------+--------+--------+--------+--------+
    |  key   |  sum1  | count1 |  sum2  | count2 |
    +--------+--------+--------+--------+--------+
                               ^
                               |
                 avg(y) inputAggBufferOffset = 3
    Definition Classes
    ApproximatePercentileImperativeAggregate
  46. def inputTypes: Seq[AbstractDataType]

    Permalink

    Expected input types from child expressions.

    Expected input types from child expressions. The i-th position in the returned seq indicates the type requirement for the i-th child.

    The possible values at each position are: 1. a specific data type, e.g. LongType, StringType. 2. a non-leaf abstract data type, e.g. NumericType, IntegralType, FractionalType.

    Definition Classes
    ApproximatePercentileExpectsInputTypes
  47. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  48. def jsonFields: List[JField]

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

    Permalink

    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.

    newArgs

    the new product arguments.

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

    Permalink

    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.

    f

    the function to be applied.

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

    Permalink

    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.

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

    Permalink

    Efficient alternative to productIterator.map(f).toArray.

    Efficient alternative to productIterator.map(f).toArray.

    Attributes
    protected
    Definition Classes
    TreeNode
  53. def merge(buffer: PercentileDigest, other: PercentileDigest): PercentileDigest

    Permalink

    Merges an input aggregation object into aggregation buffer object and returns a new buffer object.

    Merges an input aggregation object into aggregation buffer object and returns a new buffer object. For performance, the function may do in-place merge and return it instead of constructing new buffer object.

    This is typically called when doing PartialMerge or Final mode aggregation.

    buffer

    the aggregation buffer object used to store the aggregation result.

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  54. final def merge(buffer: InternalRow, inputBuffer: InternalRow): Unit

    Permalink

    Combines new intermediate results from the inputAggBuffer with the existing intermediate results in the mutableAggBuffer.

    Combines new intermediate results from the inputAggBuffer with the existing intermediate results in the mutableAggBuffer.

    Use fieldNumber + mutableAggBufferOffset to access fields of mutableAggBuffer. Use fieldNumber + inputAggBufferOffset to access fields of inputAggBuffer.

    Definition Classes
    TypedImperativeAggregateImperativeAggregate
  55. val mutableAggBufferOffset: Int

    Permalink

    The offset of this function's first buffer value in the underlying shared mutable aggregation buffer.

    The offset of this function's first buffer value in the underlying shared mutable aggregation buffer.

    For example, we have two aggregate functions avg(x) and avg(y), which share the same aggregation buffer. In this shared buffer, the position of the first buffer value of avg(x) will be 0 and the position of the first buffer value of avg(y) will be 2:

    avg(x) mutableAggBufferOffset = 0
            |
            v
            +--------+--------+--------+--------+
            |  sum1  | count1 |  sum2  | count2 |
            +--------+--------+--------+--------+
                              ^
                              |
               avg(y) mutableAggBufferOffset = 2
    Definition Classes
    ApproximatePercentileImperativeAggregate
  56. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  57. def nodeName: String

    Permalink

    Returns the name of this type of TreeNode.

    Returns the name of this type of TreeNode. Defaults to the class name. Note that we remove the "Exec" suffix for physical operators here.

    Definition Classes
    TreeNode
  58. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  59. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  60. def nullable: Boolean

    Permalink
    Definition Classes
    ApproximatePercentileExpression
  61. def numberedTreeString: String

    Permalink

    Returns a string representation of the nodes in this tree, where each operator is numbered.

    Returns a string representation of the nodes in this tree, where each operator is numbered. The numbers can be used with TreeNode.apply to easily access specific subtrees.

    The numbers are based on depth-first traversal of the tree (with innerChildren traversed first before children).

    Definition Classes
    TreeNode
  62. val origin: Origin

    Permalink
    Definition Classes
    TreeNode
  63. def otherCopyArgs: Seq[AnyRef]

    Permalink

    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

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

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    This is a variant of apply that returns the node as BaseType (if the type matches).

    Definition Classes
    TreeNode
  65. val percentageExpression: Expression

    Permalink

    Expression that represents a single percentage value or an array of percentage values.

    Expression that represents a single percentage value or an array of percentage values. Each percentage value must be between 0.0 and 1.0.

  66. def prettyJson: String

    Permalink
    Definition Classes
    TreeNode
  67. def prettyName: String

    Permalink

    Returns a user-facing string representation of this expression's name.

    Returns a user-facing string representation of this expression's name. This should usually match the name of the function in SQL.

    Definition Classes
    ApproximatePercentileExpression
  68. def references: AttributeSet

    Permalink
    Definition Classes
    Expression
  69. lazy val resolved: Boolean

    Permalink

    Returns true if this expression and all its children have been resolved to a specific schema and input data types checking passed, and false if it still contains any unresolved placeholders or has data types mismatch.

    Returns true if this expression and all its children have been resolved to a specific schema and input data types checking passed, and false if it still contains any unresolved placeholders or has data types mismatch. Implementations of expressions should override this if the resolution of this type of expression involves more than just the resolution of its children and type checking.

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

    Permalink

    Returns true when two expressions will always compute the same result, even if they differ cosmetically (i.e.

    Returns true when two expressions will always compute the same result, even if they differ cosmetically (i.e. capitalization of names in attributes may be different).

    See Canonicalize for more details.

    Definition Classes
    Expression
  71. def semanticHash(): Int

    Permalink

    Returns a hashCode for the calculation performed by this expression.

    Returns a hashCode for the calculation performed by this expression. Unlike the standard hashCode, an attempt has been made to eliminate cosmetic differences.

    See Canonicalize for more details.

    Definition Classes
    Expression
  72. def serialize(obj: PercentileDigest): Array[Byte]

    Permalink

    Serializes the aggregation buffer object T to Array[Byte]

    Serializes the aggregation buffer object T to Array[Byte]

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  73. final def serializeAggregateBufferInPlace(buffer: InternalRow): Unit

    Permalink

    In-place replaces the aggregation buffer object stored at buffer's index mutableAggBufferOffset, with SparkSQL internally supported underlying storage format (BinaryType).

    In-place replaces the aggregation buffer object stored at buffer's index mutableAggBufferOffset, with SparkSQL internally supported underlying storage format (BinaryType).

    This is only called when doing Partial or PartialMerge mode aggregation, before the framework shuffle out aggregate buffers.

    Definition Classes
    TypedImperativeAggregate
  74. def simpleString: String

    Permalink

    ONE line description of this node.

    ONE line description of this node.

    Definition Classes
    ExpressionTreeNode
  75. def sql(isDistinct: Boolean): String

    Permalink
    Definition Classes
    AggregateFunction
  76. def sql: String

    Permalink

    Returns SQL representation of this expression.

    Returns SQL representation of this expression. For expressions extending NonSQLExpression, this method may return an arbitrary user facing string.

    Definition Classes
    Expression
  77. def stringArgs: Iterator[Any]

    Permalink

    The arguments that should be included in the arg string.

    The arguments that should be included in the arg string. Defaults to the productIterator.

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

    Permalink
    Definition Classes
    AnyRef
  79. def toAggString(isDistinct: Boolean): String

    Permalink

    String representation used in explain plans.

    String representation used in explain plans.

    Definition Classes
    AggregateFunction
  80. def toAggregateExpression(isDistinct: Boolean): AggregateExpression

    Permalink

    Wraps this AggregateFunction in an AggregateExpression and set isDistinct field of the AggregateExpression to the given value because AggregateExpression is the container of an AggregateFunction, aggregation mode, and the flag indicating if this aggregation is distinct aggregation or not.

    Wraps this AggregateFunction in an AggregateExpression and set isDistinct field of the AggregateExpression to the given value because AggregateExpression is the container of an AggregateFunction, aggregation mode, and the flag indicating if this aggregation is distinct aggregation or not. An AggregateFunction should not be used without being wrapped in an AggregateExpression.

    Definition Classes
    AggregateFunction
  81. def toAggregateExpression(): AggregateExpression

    Permalink

    Wraps this AggregateFunction in an AggregateExpression because AggregateExpression is the container of an AggregateFunction, aggregation mode, and the flag indicating if this aggregation is distinct aggregation or not.

    Wraps this AggregateFunction in an AggregateExpression because AggregateExpression is the container of an AggregateFunction, aggregation mode, and the flag indicating if this aggregation is distinct aggregation or not. An AggregateFunction should not be used without being wrapped in an AggregateExpression.

    Definition Classes
    AggregateFunction
  82. def toJSON: String

    Permalink
    Definition Classes
    TreeNode
  83. def toString(): String

    Permalink
    Definition Classes
    ExpressionTreeNode → AnyRef → Any
  84. def transform(rule: PartialFunction[Expression, Expression]): Expression

    Permalink

    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.

    rule

    the function use to transform this nodes children

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

    Permalink

    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.

    rule

    the function used to transform this nodes children

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

    Permalink

    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.

    rule

    the function use to transform this nodes children

    Definition Classes
    TreeNode
  87. def treeString(verbose: Boolean, addSuffix: Boolean = false): String

    Permalink
    Definition Classes
    TreeNode
  88. def treeString: String

    Permalink

    Returns a string representation of the nodes in this tree

    Returns a string representation of the nodes in this tree

    Definition Classes
    TreeNode
  89. def update(buffer: PercentileDigest, inputRow: InternalRow): PercentileDigest

    Permalink

    Updates the aggregation buffer object with an input row and returns a new buffer object.

    Updates the aggregation buffer object with an input row and returns a new buffer object. For performance, the function may do in-place update and return it instead of constructing new buffer object.

    This is typically called when doing Partial or Complete mode aggregation.

    buffer

    The aggregation buffer object.

    Definition Classes
    ApproximatePercentileTypedImperativeAggregate
  90. final def update(buffer: InternalRow, input: InternalRow): Unit

    Permalink

    Updates its aggregation buffer, located in mutableAggBuffer, based on the given inputRow.

    Updates its aggregation buffer, located in mutableAggBuffer, based on the given inputRow.

    Use fieldNumber + mutableAggBufferOffset to access fields of mutableAggBuffer.

    Definition Classes
    TypedImperativeAggregateImperativeAggregate
  91. final def verboseString: String

    Permalink

    ONE line description of this node with more information

    ONE line description of this node with more information

    Definition Classes
    ExpressionTreeNode
  92. def verboseStringWithSuffix: String

    Permalink

    ONE line description of this node with some suffix information

    ONE line description of this node with some suffix information

    Definition Classes
    TreeNode
  93. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  94. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  95. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  96. def withNewChildren(newChildren: Seq[Expression]): Expression

    Permalink

    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.

    Definition Classes
    TreeNode
  97. def withNewInputAggBufferOffset(newOffset: Int): ApproximatePercentile

    Permalink

    Returns a copy of this ImperativeAggregate with an updated mutableAggBufferOffset.

    Returns a copy of this ImperativeAggregate with an updated mutableAggBufferOffset. This new copy's attributes may have different ids than the original.

    Definition Classes
    ApproximatePercentileImperativeAggregate
  98. def withNewMutableAggBufferOffset(newOffset: Int): ApproximatePercentile

    Permalink

    Returns a copy of this ImperativeAggregate with an updated mutableAggBufferOffset.

    Returns a copy of this ImperativeAggregate with an updated mutableAggBufferOffset. This new copy's attributes may have different ids than the original.

    Definition Classes
    ApproximatePercentileImperativeAggregate

Inherited from Serializable

Inherited from Serializable

Inherited from ImplicitCastInputTypes

Inherited from ExpectsInputTypes

Inherited from ImperativeAggregate

Inherited from CodegenFallback

Inherited from AggregateFunction

Inherited from Expression

Inherited from TreeNode[Expression]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped