Function walk_ast

crates/papyrus/src/ast_optimization.rs:21–29

Walks through each expression in the abstract syntax tree, optimizing the AST where possible. A new, optimized AST is returned Which is then passed into the Miden generation logic.

(ast: Vec<Expr>, visitor: &mut V)

// Walks through each expression in the abstract syntax tree, optimizing the AST where possible. A new, optimized AST is returned
//Which is then passed into the Miden generation logic.
fn walk_ast<V: ExpressionVisitor>(ast: Vec<Expr>, visitor: &mut V) -> Vec<Expr> {
    let mut new_ast = vec![];
    for expr in ast {
        if let Some(expr) = walk_expr(expr, visitor) {
            new_ast.push(expr);
        }
    }
    new_ast
}

trait ExpressionVisitor {
    fn visit_expr(&mut self, expr: Expr) -> Option<Expr>;