fn optimize_children(&mut self, plan: &LogicalPlan) -> Result<LogicalPlan> {
        let new_exprs = utils::expressions(&plan);
        let new_inputs = utils::inputs(&plan)
            .into_iter()
            .map(|plan| self.optimize(plan))
            .collect::<Result<Vec<_>>>()?;

        utils::from_plan(plan, &new_exprs, &new_inputs)
    }
/// Convenience rule for writing optimizers: recursively invoke
/// optimize on plan's children and then return a node of the same
/// type. Useful for optimizer rules which want to leave the type
/// of plan unchanged but still apply to the children.
Convenience rule for writing optimizers: recursively invoke
optimize on plan's children and then return a node of the same
type. Useful for optimizer rules which want to leave the type
of plan unchanged but still apply to the children.
Convenience rule for writing optimizers : recursively invoke optimize on plan ' s children and then return a node of the same type . Useful for optimizer rules which want to leave the type of plan unchanged but still apply to the children .
fn optimize_children(&mut self, plan: &LogicalPlan) -> Result<LogicalPlan> {
        let new_exprs = utils::expressions(&plan);
        let new_inputs = utils::inputs(&plan)
            .into_iter()
            .map(|plan| self.optimize(plan))
            .collect::<Result<Vec<_>>>()?;
        utils::from_plan(plan, &new_exprs, &new_inputs)
    }
fn optimize_children ( & mut self , plan : & LogicalPlan ) -> Result < LogicalPlan > { let new_exprs = utils :: expressions ( & plan ) ; let new_inputs = utils :: inputs ( & plan ) . into_iter ( ) . map ( | plan | self . optimize ( plan ) ) . collect :: < Result < Vec < _ > > > ( ) ? ; utils :: from_plan ( plan , & new_exprs , & new_inputs ) }
Convenience rule for writing optimizers: recursively invoke
optimize on plan's children and then return a node of the same
type.
Convenience rule for writing optimizers : recursively invoke optimize on plan ' s children and then return a node of the same type .
&mut self
plan
&LogicalPlan
&mut self
plan
&LogicalPlan