Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
RepartitionExec in datafusion::physical_plan::repartition - Rust
[go: Go Back, main page]

pub struct RepartitionExec { /* private fields */ }
Expand description

The repartition operator maps N input partitions to M output partitions based on a partitioning scheme. No guarantees are made about the order of the resulting partitions.

Implementations§

Input execution plan

Partitioning scheme to use

Create a new RepartitionExec

Trait Implementations§

Formats the value using the given formatter. Read more

Return a reference to Any that can be used for downcasting

Get the schema for this execution plan

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.

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).
Returns a new plan where all children were replaced by new plans.
Specifies the output partitioning scheme of this plan
If the output of this operator within each partition is sorted, returns Some(keys) with the description of how it was sorted. Read more
Returns false if this operator’s implementation may reorder rows within or between partitions. Read more
Get the EquivalenceProperties within the plan
creates an iterator
Return a snapshot of the set of Metrics for this ExecutionPlan. Read more
Format this ExecutionPlan to f in the specified type. Read more
Returns the global output statistics for this ExecutionPlan node.
Specifies the data distribution requirements for all the children for this operator, By default it’s [Distribution::UnspecifiedDistribution] for each child,
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
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

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.