Struct MergeSortLogicalPlan

pub struct MergeSortLogicalPlan {
    pub expr: Vec<Expr>,
    pub input: Arc<LogicalPlan>,
    pub fetch: Option<usize>,
}

MergeSort Logical Plan, have same field as Sort, but indicate it is a merge sort, which assume each input partition is a sorted stream, and will use SortPreserveingMergeExec to merge them into a single sorted stream.

Fields

expr: Vec<Expr>

input: Arc<LogicalPlan>

fetch: Option<usize>

Implementations

impl MergeSortLogicalPlan

pub fn new( input: Arc<LogicalPlan>, expr: Vec<Expr>, fetch: Option<usize>, ) -> Self

pub fn name() -> &'static str

pub fn into_logical_plan(self) -> LogicalPlan

Create a [LogicalPlan::Extension] node from this merge sort plan

pub fn into_sort(self) -> LogicalPlan

Convert self to a [Sort] logical plan with same input and expressions

Trait Implementations

impl Clone for MergeSortLogicalPlan

fn clone(&self) -> MergeSortLogicalPlan

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MergeSortLogicalPlan

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for MergeSortLogicalPlan

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for MergeSortLogicalPlan

fn eq(&self, other: &MergeSortLogicalPlan) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl UserDefinedLogicalNodeCore for MergeSortLogicalPlan

fn name(&self) -> &str

Return the plan’s name.

fn inputs(&self) -> Vec<&LogicalPlan>

Return the logical plan’s inputs.

fn schema(&self) -> &DFSchemaRef

Return the output schema of this logical plan node.

fn expressions(&self) -> Vec<Expr>

Returns all expressions in the current logical plan node. This should not include expressions of any inputs (aka non-recursively). These expressions are used for optimizer passes and rewrites.

fn fmt_for_explain(&self, f: &mut Formatter<'_>) -> Result

Write a single line, human readable string to f for use in explain plan.

fn with_exprs_and_inputs( &self, exprs: Vec<Expr>, inputs: Vec<LogicalPlan>, ) -> Result<Self>

Create a new UserDefinedLogicalNode with the specified children and expressions. This function is used during optimization when the plan is being rewritten and a new instance of the UserDefinedLogicalNode must be created.

fn prevent_predicate_push_down_columns(&self) -> HashSet<String>

A list of output columns (e.g. the names of columns in self.schema()) for which predicates can not be pushed below this node without changing the output.

fn from_template(&self, exprs: &[Expr], inputs: &[LogicalPlan]) -> Self

👎Deprecated since 39.0.0: use with_exprs_and_inputs instead

fn necessary_children_exprs( &self, _output_columns: &[usize], ) -> Option<Vec<Vec<usize>>>

Returns the necessary input columns for this node required to compute the columns in the output schema

impl Eq for MergeSortLogicalPlan

impl StructuralPartialEq for MergeSortLogicalPlan