Struct UnwindNode 

pub struct UnwindNode {
    pub input: Arc<LogicalPlan>,
    pub list_expr: Expr,
    pub alias: String,
    /* private fields */
}

Physical node for UNWIND — explodes a list expression into one row per element, binding each element to an alias variable.

The physical layer (UnwindExec in M13) evaluates list_expr per input row and emits one output row per list element (null/empty list → zero rows). The output extends the input schema with a single alias-named, alias-qualified column of the element type (nullable — elements may be null).

Fields

input: Arc<LogicalPlan>

Input plan.

list_expr: Expr

The list expression to iterate.

alias: String

The alias variable qualifier bound to each element (e.g. var_0).

Implementations

impl UnwindNode

pub fn new( input: Arc<LogicalPlan>, list_expr: Expr, alias: impl Into<String>, element_field: &Field, ) -> Self

Create an unwind node.

element_field is the unwound element’s column (its type comes from the list element type, resolved by the lowerer so this crate needs no graphforge-rel dependency). It is appended to the input schema qualified by alias and forced nullable (UNWIND elements may be null).

Trait Implementations

impl Clone for UnwindNode

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UnwindNode

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

Formats the value using the given formatter.

impl Eq for UnwindNode

impl Hash for UnwindNode

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 UnwindNode

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for UnwindNode

fn partial_cmp(&self, _other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for UnwindNode

impl UserDefinedLogicalNodeCore for UnwindNode

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>, ) -> DfResult<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 check_invariants( &self, _check: InvariantLevel, ) -> Result<(), DataFusionError>

Perform check of invariants for the extension node.

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 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

fn supports_limit_pushdown(&self) -> bool

Returns true if a limit can be safely pushed down through this UserDefinedLogicalNode node.