Struct Simplifier 

struct Simplifier<'a, S> {
    info: &'a S,
}

Simplifies Exprs by applying algebraic transformation rules

Example transformations that are applied:

• expr = true and expr != false to expr when expr is of boolean type
• expr = false and expr != true to !expr when expr is of boolean type
• true = true and false = false to true
• false = true and true = false to false
• !!expr to expr
• expr = null and expr != null to null

Fields

info: &'a S

Implementations

impl<'a, S> Simplifier<'a, S>

pub fn new(info: &'a S) -> Self

Trait Implementations

impl<S: SimplifyInfo> TreeNodeRewriter for Simplifier<'_, S>

fn f_up(&mut self, expr: Expr) -> Result<Transformed<Expr>>

rewrite the expression simplifying any constant expressions

type Node = Expr

The node type which is rewritable.

fn f_down(&mut self, expr: Self::Node) -> Result<Transformed<Expr>>

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