pub trait WindowExpr: Send + Sync + Debug {
Show 13 methods // Required methods fn as_any(&self) -> &dyn Any; fn field(&self) -> Result<Field>; fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>>; fn evaluate(&self, batch: &RecordBatch) -> Result<ArrayRef>; fn partition_by(&self) -> &[Arc<dyn PhysicalExpr>]; fn order_by(&self) -> &[PhysicalSortExpr]; fn get_window_frame(&self) -> &Arc<WindowFrame>; fn uses_bounded_memory(&self) -> bool; fn get_reverse_expr(&self) -> Option<Arc<dyn WindowExpr>>; // Provided methods fn name(&self) -> &str { ... } fn evaluate_args(&self, batch: &RecordBatch) -> Result<Vec<ArrayRef>> { ... } fn evaluate_stateful( &self, _partition_batches: &PartitionBatches, _window_agg_state: &mut PartitionWindowAggStates ) -> Result<()> { ... } fn order_by_columns(&self, batch: &RecordBatch) -> Result<Vec<SortColumn>> { ... }
}
Expand description

Common trait for window function implementations

Aggregate Window Expressions

These expressions take the form

OVER({ROWS | RANGE| GROUPS} BETWEEN UNBOUNDED PRECEDING AND ...)

For example, cumulative window frames uses PlainAggregateWindowExpr.

Non Aggregate Window Expressions

The expressions have the form

OVER({ROWS | RANGE| GROUPS} BETWEEN M {PRECEDING| FOLLOWING} AND ...)

For example, sliding window frames use SlidingAggregateWindowExpr.

Required Methods§

source

fn as_any(&self) -> &dyn Any

Returns the window expression as Any so that it can be downcast to a specific implementation.

source

fn field(&self) -> Result<Field>

The field of the final result of this window function.

source

fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>>

Expressions that are passed to the WindowAccumulator. Functions which take a single input argument, such as sum, return a single datafusion_expr::expr::Expr, others (e.g. cov) return many.

source

fn evaluate(&self, batch: &RecordBatch) -> Result<ArrayRef>

Evaluate the window function values against the batch

source

fn partition_by(&self) -> &[Arc<dyn PhysicalExpr>]

Expressions that’s from the window function’s partition by clause, empty if absent

source

fn order_by(&self) -> &[PhysicalSortExpr]

Expressions that’s from the window function’s order by clause, empty if absent

source

fn get_window_frame(&self) -> &Arc<WindowFrame>

Get the window frame of this WindowExpr.

source

fn uses_bounded_memory(&self) -> bool

Return a flag indicating whether this WindowExpr can run with bounded memory.

source

fn get_reverse_expr(&self) -> Option<Arc<dyn WindowExpr>>

Get the reverse expression of this WindowExpr.

Provided Methods§

source

fn name(&self) -> &str

Human readable name such as "MIN(c2)" or "RANK()". The default implementation returns placeholder text.

source

fn evaluate_args(&self, batch: &RecordBatch) -> Result<Vec<ArrayRef>>

Evaluate the window function arguments against the batch and return array ref, normally the resulting Vec is a single element one.

source

fn evaluate_stateful( &self, _partition_batches: &PartitionBatches, _window_agg_state: &mut PartitionWindowAggStates ) -> Result<()>

Evaluate the window function against the batch. This function facilitates stateful, bounded-memory implementations.

source

fn order_by_columns(&self, batch: &RecordBatch) -> Result<Vec<SortColumn>>

Get order by columns, empty if absent

Implementors§

source§

impl WindowExpr for BuiltInWindowExpr

source§

impl WindowExpr for PlainAggregateWindowExpr

peer based evaluation based on the fact that batch is pre-sorted given the sort columns and then per partition point we’ll evaluate the peer group (e.g. SUM or MAX gives the same results for peers) and concatenate the results.

source§

impl WindowExpr for SlidingAggregateWindowExpr

Incrementally update window function using the fact that batch is pre-sorted given the sort columns and then per partition point.

Evaluates the peer group (e.g. SUM or MAX gives the same results for peers) and concatenate the results.