pub trait AggregateExpr: Send + Sync + Debug + PartialEq<dyn Any> {
// Required methods
fn as_any(&self) -> &dyn Any;
fn field(&self) -> Result<Field>;
fn create_accumulator(&self) -> Result<Box<dyn Accumulator>>;
fn state_fields(&self) -> Result<Vec<Field>>;
fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>>;
// Provided methods
fn order_bys(&self) -> Option<&[PhysicalSortExpr]> { ... }
fn name(&self) -> &str { ... }
fn groups_accumulator_supported(&self) -> bool { ... }
fn create_groups_accumulator(&self) -> Result<Box<dyn GroupsAccumulator>> { ... }
fn reverse_expr(&self) -> Option<Arc<dyn AggregateExpr>> { ... }
fn create_sliding_accumulator(&self) -> Result<Box<dyn Accumulator>> { ... }
}
Expand description
An aggregate expression that:
- knows its resulting field
- knows how to create its accumulator
- knows its accumulator’s state’s field
- knows the expressions from whose its accumulator will receive values
Any implementation of this trait also needs to implement the
PartialEq<dyn Any>
to allows comparing equality between the
trait objects.
Required Methods§
sourcefn 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.
sourcefn 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
sourcefn 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
sourcefn 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.
Provided Methods§
sourcefn 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 this
sourcefn name(&self) -> &str
fn name(&self) -> &str
Human readable name such as "MIN(c2)"
. The default
implementation returns placeholder text.
sourcefn 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.
sourcefn 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.
For maximum performance, a GroupsAccumulator
should be
implemented in addition to Accumulator
.
sourcefn 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).
sourcefn create_sliding_accumulator(&self) -> Result<Box<dyn Accumulator>>
fn create_sliding_accumulator(&self) -> Result<Box<dyn Accumulator>>
Creates accumulator implementation that supports retract