toasty 0.2.0

An async ORM for Rust supporting SQL and NoSQL databases
Documentation
use toasty_core::stmt::{self, Project};

use super::Simplify;

impl Simplify<'_> {
    pub(super) fn simplify_expr_project(
        &mut self,
        expr: &mut stmt::ExprProject,
    ) -> Option<stmt::Expr> {
        // Constant evaluation: if the base is an Expr::Value, we can evaluate
        // the projection at compile time.
        //
        // Examples:
        //   - `project(Value::I64(42), [])` → `Value::I64(42)`
        //   - `project(Value::Record([1, 2, 3]), [0])` → `Value::I64(1)`
        //
        // Note: This only handles Expr::Value, not Expr::Record or Expr::List.
        // Those variants represent expressions that will be evaluated later,
        // not constant values that can be folded now.
        if let stmt::Expr::Value(value) = &*expr.base {
            // Use the value's project method to follow the projection path
            if let Some(result) = value.project(&expr.projection) {
                return Some(result);
            }
        }

        // Handle projections through records (embedded fields lower to records of columns).
        // After lowering, embedded field references become records where each field is a column.
        // Uses `entry` to support arbitrary-depth projections (e.g., [1, 1] for nested embedded).
        // Examples:
        //   project([street_col, city_col, zip_col], [1]) → city_col
        //   project([name_col, record([street_col, city_col])], [1, 1]) → city_col
        if let stmt::Expr::Record(_) = &*expr.base
            && let Some(entry) = expr.base.entry(&expr.projection)
        {
            return Some(entry.to_expr());
        }

        // Project into Match: distribute the projection into each arm's expression.
        // Example: project(Match(d, [1 => Record([d, a]), 2 => Record([d, n])]), [0])
        //        → Match(d, [1 => project(Record([d, a]), [0]), 2 => project(Record([d, n]), [0])])
        //        → Match(d, [1 => d, 2 => d])   (after recursive simplification)
        if let stmt::Expr::Match(match_expr) = &mut *expr.base {
            for arm in &mut match_expr.arms {
                arm.expr = stmt::Expr::project(arm.expr.take(), expr.projection.clone());
            }
            *match_expr.else_expr =
                stmt::Expr::project(match_expr.else_expr.take(), expr.projection.clone());
            return Some(expr.base.take());
        }

        None
    }
}