Struct Rewriter 

struct Rewriter<'a> {
    apply_order: ApplyOrder,
    rule: &'a dyn OptimizerRule,
    config: &'a dyn OptimizerConfig,
}

Recursively rewrites LogicalPlans

Fields

apply_order: ApplyOrder

rule: &'a dyn OptimizerRule

config: &'a dyn OptimizerConfig

Implementations

impl<'a> Rewriter<'a>

fn new( apply_order: ApplyOrder, rule: &'a dyn OptimizerRule, config: &'a dyn OptimizerConfig, ) -> Self

Trait Implementations

impl TreeNodeRewriter for Rewriter<'_>

type Node = LogicalPlan

The node type which is rewritable.

fn f_down(&mut self, node: LogicalPlan) -> Result<Transformed<LogicalPlan>>

Invoked while traversing down the tree before any children are rewritten. Default implementation returns the node as is and continues recursion.

fn f_up(&mut self, node: LogicalPlan) -> Result<Transformed<LogicalPlan>>

Invoked while traversing up the tree after all children have been rewritten. Default implementation returns the node as is and continues recursion.