pub struct SimplifyExpressions {}Expand description
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
Trait Implementations
sourceimpl Default for SimplifyExpressions
impl Default for SimplifyExpressions
sourcefn default() -> SimplifyExpressions
fn default() -> SimplifyExpressions
Returns the “default value” for a type. Read more
sourceimpl OptimizerRule for SimplifyExpressions
impl OptimizerRule for SimplifyExpressions
sourcefn optimize(
&self,
plan: &LogicalPlan,
optimizer_config: &mut OptimizerConfig
) -> Result<LogicalPlan>
fn optimize(
&self,
plan: &LogicalPlan,
optimizer_config: &mut OptimizerConfig
) -> Result<LogicalPlan>
Rewrite
plan to an optimized formAuto Trait Implementations
impl RefUnwindSafe for SimplifyExpressions
impl Send for SimplifyExpressions
impl Sync for SimplifyExpressions
impl Unpin for SimplifyExpressions
impl UnwindSafe for SimplifyExpressions
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more