pub struct CoalescePartitionsExec { /* private fields */ }
Expand description
Merge execution plan executes partitions in parallel and combines them into a single partition. No guarantees are made about the order of the resulting partition.
Implementations§
source§impl CoalescePartitionsExec
impl CoalescePartitionsExec
sourcepub fn new(input: Arc<dyn ExecutionPlan>) -> Self
pub fn new(input: Arc<dyn ExecutionPlan>) -> Self
Create a new CoalescePartitionsExec
sourcepub fn input(&self) -> &Arc<dyn ExecutionPlan>
pub fn input(&self) -> &Arc<dyn ExecutionPlan>
Input execution plan
Trait Implementations§
source§impl Debug for CoalescePartitionsExec
impl Debug for CoalescePartitionsExec
source§impl ExecutionPlan for CoalescePartitionsExec
impl ExecutionPlan for CoalescePartitionsExec
source§fn unbounded_output(&self, children: &[bool]) -> Result<bool>
fn unbounded_output(&self, children: &[bool]) -> Result<bool>
Specifies whether this plan generates an infinite stream of records. If the plan does not support pipelining, but it its input(s) are infinite, returns an error to indicate this.
source§fn output_partitioning(&self) -> Partitioning
fn output_partitioning(&self) -> Partitioning
Get the output partitioning of this plan
source§fn children(&self) -> Vec<Arc<dyn ExecutionPlan>> ⓘ
fn children(&self) -> Vec<Arc<dyn ExecutionPlan>> ⓘ
Get a list of child execution plans that provide the input for this plan. The returned list
will be empty for leaf nodes, will contain a single value for unary nodes, or two
values for binary nodes (such as joins).
source§fn output_ordering(&self) -> Option<&[PhysicalSortExpr]>
fn output_ordering(&self) -> Option<&[PhysicalSortExpr]>
If the output of this operator within each partition is sorted,
returns
Some(keys)
with the description of how it was sorted. Read moresource§fn equivalence_properties(&self) -> EquivalenceProperties
fn equivalence_properties(&self) -> EquivalenceProperties
Get the EquivalenceProperties within the plan
source§fn with_new_children(
self: Arc<Self>,
children: Vec<Arc<dyn ExecutionPlan>>
) -> Result<Arc<dyn ExecutionPlan>>
fn with_new_children( self: Arc<Self>, children: Vec<Arc<dyn ExecutionPlan>> ) -> Result<Arc<dyn ExecutionPlan>>
Returns a new plan where all children were replaced by new plans.
source§fn execute(
&self,
partition: usize,
context: Arc<TaskContext>
) -> Result<SendableRecordBatchStream>
fn execute( &self, partition: usize, context: Arc<TaskContext> ) -> Result<SendableRecordBatchStream>
creates an iterator
source§fn metrics(&self) -> Option<MetricsSet>
fn metrics(&self) -> Option<MetricsSet>
source§fn statistics(&self) -> Statistics
fn statistics(&self) -> Statistics
Returns the global output statistics for this
ExecutionPlan
node.source§fn required_input_distribution(&self) -> Vec<Distribution> ⓘ
fn required_input_distribution(&self) -> Vec<Distribution> ⓘ
Specifies the data distribution requirements for all the
children for this operator, By default it’s [Distribution::UnspecifiedDistribution] for each child,
source§fn required_input_ordering(&self) -> Vec<Option<&[PhysicalSortExpr]>> ⓘ
fn required_input_ordering(&self) -> Vec<Option<&[PhysicalSortExpr]>> ⓘ
Specifies the ordering requirements for all of the children
For each child, it’s the local ordering requirement within
each partition rather than the global ordering Read more
source§fn maintains_input_order(&self) -> Vec<bool> ⓘ
fn maintains_input_order(&self) -> Vec<bool> ⓘ
Returns
false
if this operator’s implementation may reorder
rows within or between partitions. Read moresource§fn benefits_from_input_partitioning(&self) -> bool
fn benefits_from_input_partitioning(&self) -> bool
Returns
true
if this operator would benefit from
partitioning its input (and thus from more parallelism). For
operators that do very little work the overhead of extra
parallelism may outweigh any benefits Read more