pub struct OrderSensitiveArrayAgg { /* private fields */ }
Expand description
Expression for a ARRAY_AGG(ORDER BY) aggregation. When aggregation works in multiple partitions aggregations are split into multiple partitions, then their results are merged. This aggregator is a version of ARRAY_AGG that can support producing intermediate aggregation (with necessary side information) and that can merge aggregations from multiple partitions.
Implementations§
source§impl OrderSensitiveArrayAgg
impl OrderSensitiveArrayAgg
sourcepub fn new(
expr: Arc<dyn PhysicalExpr>,
name: impl Into<String>,
input_data_type: DataType,
order_by_data_types: Vec<DataType>,
ordering_req: LexOrdering
) -> Self
pub fn new( expr: Arc<dyn PhysicalExpr>, name: impl Into<String>, input_data_type: DataType, order_by_data_types: Vec<DataType>, ordering_req: LexOrdering ) -> Self
Create a new OrderSensitiveArrayAgg
aggregate function
Trait Implementations§
source§impl AggregateExpr for OrderSensitiveArrayAgg
impl AggregateExpr for OrderSensitiveArrayAgg
source§fn as_any(&self) -> &dyn Any
fn as_any(&self) -> &dyn Any
Returns the aggregate expression as
Any
so that it can be
downcast to a specific implementation.source§fn create_accumulator(&self) -> Result<Box<dyn Accumulator>>
fn create_accumulator(&self) -> Result<Box<dyn Accumulator>>
the accumulator used to accumulate values from the expressions.
the accumulator expects the same number of arguments as
expressions
and must
return states with the same description as state_fields
source§fn state_fields(&self) -> Result<Vec<Field>>
fn state_fields(&self) -> Result<Vec<Field>>
the fields that encapsulate the Accumulator’s state
the number of fields here equals the number of states that the accumulator contains
source§fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>>
fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>>
expressions that are passed to the Accumulator.
Single-column aggregations such as
sum
return a single value, others (e.g. cov
) return many.source§fn order_bys(&self) -> Option<&[PhysicalSortExpr]>
fn order_bys(&self) -> Option<&[PhysicalSortExpr]>
Order by requirements for the aggregate function
By default it is
None
(there is no requirement)
Order-sensitive aggregators, such as FIRST_VALUE(x ORDER BY y)
should implement thissource§fn name(&self) -> &str
fn name(&self) -> &str
Human readable name such as
"MIN(c2)"
. The default
implementation returns placeholder text.source§fn groups_accumulator_supported(&self) -> bool
fn groups_accumulator_supported(&self) -> bool
If the aggregate expression has a specialized
GroupsAccumulator
implementation. If this returns true,
[Self::create_groups_accumulator
] will be called.source§fn create_groups_accumulator(&self) -> Result<Box<dyn GroupsAccumulator>>
fn create_groups_accumulator(&self) -> Result<Box<dyn GroupsAccumulator>>
Return a specialized
GroupsAccumulator
that manages state
for all groups. Read moresource§fn reverse_expr(&self) -> Option<Arc<dyn AggregateExpr>>
fn reverse_expr(&self) -> Option<Arc<dyn AggregateExpr>>
Construct an expression that calculates the aggregate in reverse.
Typically the “reverse” expression is itself (e.g. SUM, COUNT).
For aggregates that do not support calculation in reverse,
returns None (which is the default value).
source§fn create_sliding_accumulator(&self) -> Result<Box<dyn Accumulator>>
fn create_sliding_accumulator(&self) -> Result<Box<dyn Accumulator>>
Creates accumulator implementation that supports retract
source§impl Debug for OrderSensitiveArrayAgg
impl Debug for OrderSensitiveArrayAgg
Auto Trait Implementations§
impl !RefUnwindSafe for OrderSensitiveArrayAgg
impl Send for OrderSensitiveArrayAgg
impl Sync for OrderSensitiveArrayAgg
impl Unpin for OrderSensitiveArrayAgg
impl !UnwindSafe for OrderSensitiveArrayAgg
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more