Struct SimplifyExpressions

pub struct SimplifyExpressions {}

Optimizer Pass that simplifies LogicalPlans by rewriting Expr`s evaluating constants and applying algebraic simplifications

Introduction

It uses boolean algebra laws to simplify or reduce the number of terms in expressions.

Example:

Filter: b > 2 AND b > 2 is optimized to Filter: b > 2

Implementations

impl SimplifyExpressions

pub fn new() -> SimplifyExpressions

Trait Implementations

impl Debug for SimplifyExpressions

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

Formats the value using the given formatter.

impl Default for SimplifyExpressions

fn default() -> SimplifyExpressions

Returns the “default value” for a type.

impl OptimizerRule for SimplifyExpressions

fn rewrite( &self, plan: LogicalPlan, config: &dyn OptimizerConfig, ) -> Result<Transformed<LogicalPlan>, DataFusionError>

if supports_owned returns true, the Optimizer calls Self::rewrite instead of Self::try_optimize

fn name(&self) -> &str

A human readable name for this optimizer rule

fn apply_order(&self) -> Option<ApplyOrder>

How should the rule be applied by the optimizer? See comments on ApplyOrder for details.

fn supports_rewrite(&self) -> bool

Does this rule support rewriting owned plans (rather than by reference)?

fn try_optimize( &self, _plan: &LogicalPlan, _config: &dyn OptimizerConfig, ) -> Result<Option<LogicalPlan>, DataFusionError>

👎Deprecated since 40.0.0: please implement supports_rewrite and rewrite instead

Try and rewrite plan to an optimized form, returning None if the plan cannot be optimized by this rule.