pub struct SimplifyExpressions {}
Expand description
Optimizer Pass that simplifies LogicalPlan
s 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§
Trait Implementations§
source§impl Default for SimplifyExpressions
impl Default for SimplifyExpressions
source§fn default() -> SimplifyExpressions
fn default() -> SimplifyExpressions
Returns the “default value” for a type. Read more
source§impl OptimizerRule for SimplifyExpressions
impl OptimizerRule for SimplifyExpressions
source§fn try_optimize(
&self,
plan: &LogicalPlan,
config: &dyn OptimizerConfig
) -> Result<Option<LogicalPlan>>
fn try_optimize( &self, plan: &LogicalPlan, config: &dyn OptimizerConfig ) -> Result<Option<LogicalPlan>>
Try and rewrite
plan
to an optimized form, returning None if the plan cannot be
optimized by this rule.source§fn apply_order(&self) -> Option<ApplyOrder>
fn apply_order(&self) -> Option<ApplyOrder>
How should the rule be applied by the optimizer? See comments on
ApplyOrder
for details. Read moreAuto Trait Implementations§
impl RefUnwindSafe for SimplifyExpressions
impl Send for SimplifyExpressions
impl Sync for SimplifyExpressions
impl Unpin for SimplifyExpressions
impl UnwindSafe for SimplifyExpressions
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more