rssn-advanced 0.1.2

//! Algebraic identity patterns used by the heuristic engine.
//!
//! The `heuristic_review §1` audit found the previous engine "performed
//! a recursive traversal" without doing any actual pattern matching.
//! This module fills that gap: each pattern is a single
//! `try_apply(builder, kind, children) -> Option<DagNodeId>` that
//! returns `Some(replacement)` when its rule fires, `None` otherwise.
//!
//! Every replacement goes through `DagBuilder::*` constructors, which
//! call `DedupMap::get_or_insert` — so even aggressive rewriting
//! preserves the hash-cons invariant (`heuristic_review §1`).

// `0.0` and `1.0` have exact `f64` representations; the strict-equality
// lint is misleading for the identity rules in this file.
#![allow(clippy::float_cmp)]

use crate::dag::builder::DagBuilder;
use crate::dag::node::DagNodeId;
use crate::dag::symbol::{OpKind, SymbolKind};

/// Reusable type for pattern application results.
pub type PatternResult = Option<DagNodeId>;

/// Returns the `f64` constant a node represents, or `None` for
/// non-constant nodes.
fn constant_value(builder: &DagBuilder, id: DagNodeId) -> Option<f64> {
    builder.arena().get(id).and_then(|n| {
        if let SymbolKind::Constant(v) = n.kind {
            Some(v)
        } else {
            None
        }
    })
}

/// `x + 0 → x` and `0 + x → x`.
#[must_use]
pub fn add_zero(builder: &DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lhs = children[0];
    let rhs = children[1];
    if matches!(constant_value(builder, lhs), Some(v) if v == 0.0) {
        return Some(rhs);
    }
    if matches!(constant_value(builder, rhs), Some(v) if v == 0.0) {
        return Some(lhs);
    }
    None
}

/// `x - 0 → x` and `x - x → 0`.
pub fn sub_identity(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lhs = children[0];
    let rhs = children[1];
    if matches!(constant_value(builder, rhs), Some(v) if v == 0.0) {
        return Some(lhs);
    }
    if lhs == rhs {
        return Some(builder.constant(0.0));
    }
    None
}

/// `x * 0 → 0` (only when the other operand is a known finite constant),
/// `x * 1 → x`, `1 * x → x`.
///
/// The `x * 0` rule is guarded: IEEE-754 defines `NaN * 0 = NaN` and
/// `Inf * 0 = NaN`. Folding symbolically to `0` for an unknown `x` would
/// produce wrong results when `x` evaluates to NaN or Infinity at runtime.
/// The guard requires the non-zero operand to be a concrete finite constant,
/// which is always safe. `constant_fold` handles the fully-constant case.
pub fn mul_identity(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lhs = children[0];
    let rhs = children[1];

    let lhs_val = constant_value(builder, lhs);
    let rhs_val = constant_value(builder, rhs);

    // `0 * x → 0` only when x is a known finite value.
    if matches!(lhs_val, Some(v) if v == 0.0) && matches!(rhs_val, Some(r) if r.is_finite()) {
        return Some(builder.constant(0.0));
    }
    // `x * 0 → 0` only when x is a known finite value.
    if matches!(rhs_val, Some(v) if v == 0.0) && matches!(lhs_val, Some(l) if l.is_finite()) {
        return Some(builder.constant(0.0));
    }
    if matches!(lhs_val, Some(v) if v == 1.0) {
        return Some(rhs);
    }
    if matches!(rhs_val, Some(v) if v == 1.0) {
        return Some(lhs);
    }
    None
}

/// `x / 1 → x`, `0 / x → 0`, `x / x → 1` (only when `x` is a constant
/// known not to be zero — the symbolic case is generally unsafe).
pub fn div_identity(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lhs = children[0];
    let rhs = children[1];

    if matches!(constant_value(builder, rhs), Some(v) if v == 1.0) {
        return Some(lhs);
    }
    if matches!(constant_value(builder, lhs), Some(v) if v == 0.0) {
        return Some(builder.constant(0.0));
    }
    // x / x → 1 only when we can prove x ≠ 0. The safe approximation:
    // both sides are the same id AND that id is a non-zero constant.
    if lhs == rhs
        && let Some(v) = constant_value(builder, lhs)
        && v != 0.0
    {
        return Some(builder.constant(1.0));
    }
    None
}

/// `x ^ 0 → 1`, `x ^ 1 → x`, `1 ^ x → 1`, `0 ^ x → 0` (for x > 0).
pub fn pow_identity(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lhs = children[0];
    let rhs = children[1];

    let lhs_val = constant_value(builder, lhs);
    let rhs_val = constant_value(builder, rhs);

    if matches!(rhs_val, Some(v) if v == 0.0) {
        return Some(builder.constant(1.0));
    }
    if matches!(rhs_val, Some(v) if v == 1.0) {
        return Some(lhs);
    }
    if matches!(lhs_val, Some(v) if v == 1.0) {
        return Some(builder.constant(1.0));
    }
    if let (Some(base), Some(exp)) = (lhs_val, rhs_val)
        && base == 0.0
        && exp > 0.0
    {
        return Some(builder.constant(0.0));
    }
    None
}

/// `--x → x`.
#[must_use]
pub fn neg_double(builder: &DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 1 {
        return None;
    }
    let child = builder.arena().get(children[0])?;
    if child.kind == SymbolKind::Operator(OpKind::Neg) {
        let inner = child.children.as_slice();
        if inner.len() == 1 {
            return Some(inner[0]);
        }
    }
    None
}

/// Constant folding: when all children of a binary operator are constants,
/// evaluate at compile time and return the result as a new constant node.
///
/// Handles `+`, `-`, `*`, `/` (guarded against zero), and `^`.
pub fn constant_fold(
    builder: &mut DagBuilder,
    kind: SymbolKind,
    children: &[DagNodeId],
) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let lv = constant_value(builder, children[0])?;
    let rv = constant_value(builder, children[1])?;
    let result = match kind {
        SymbolKind::Operator(OpKind::Add) => lv + rv,
        SymbolKind::Operator(OpKind::Sub) => lv - rv,
        SymbolKind::Operator(OpKind::Mul) => lv * rv,
        SymbolKind::Operator(OpKind::Div) => {
            if rv == 0.0 {
                return None;
            }
            lv / rv
        }
        SymbolKind::Operator(OpKind::Pow) => lv.powf(rv),
        _ => return None,
    };
    Some(builder.constant(result))
}

/// Constant merging in products: `(c1 * x) * c2 → (c1*c2) * x`.
///
/// This catches the common pattern that arises after repeated symbolic
/// substitution, where coefficients pile up around a variable.
pub fn mul_coef_merge(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let (lhs, rhs) = (children[0], children[1]);

    // Case: `(c1 * x) * c2`
    if let Some(c2) = constant_value(builder, rhs)
        && let Some(lhs_node) = builder.arena().get(lhs)
        && lhs_node.kind == SymbolKind::Operator(OpKind::Mul)
        && lhs_node.children.len() == 2
    {
        let inner = lhs_node.children.as_slice().to_owned();
        if let Some(c1) = constant_value(builder, inner[0]) {
            let merged = builder.constant(c1 * c2);
            return Some(builder.mul(merged, inner[1]));
        }
        if let Some(c1) = constant_value(builder, inner[1]) {
            let merged = builder.constant(c1 * c2);
            return Some(builder.mul(inner[0], merged));
        }
    }

    // Case: `c1 * (x * c2)`
    if let Some(c1) = constant_value(builder, lhs)
        && let Some(rhs_node) = builder.arena().get(rhs)
        && rhs_node.kind == SymbolKind::Operator(OpKind::Mul)
        && rhs_node.children.len() == 2
    {
        let inner = rhs_node.children.as_slice().to_owned();
        if let Some(c2) = constant_value(builder, inner[0]) {
            let merged = builder.constant(c1 * c2);
            return Some(builder.mul(merged, inner[1]));
        }
        if let Some(c2) = constant_value(builder, inner[1]) {
            let merged = builder.constant(c1 * c2);
            return Some(builder.mul(inner[0], merged));
        }
    }

    None
}

/// Constant merging in sums: `(c1 + x) + c2 → x + (c1+c2)`.
pub fn add_coef_merge(builder: &mut DagBuilder, children: &[DagNodeId]) -> PatternResult {
    if children.len() != 2 {
        return None;
    }
    let (lhs, rhs) = (children[0], children[1]);

    // `(c1 + x) + c2`
    if let Some(c2) = constant_value(builder, rhs)
        && let Some(lhs_node) = builder.arena().get(lhs)
        && lhs_node.kind == SymbolKind::Operator(OpKind::Add)
        && lhs_node.children.len() == 2
    {
        let inner = lhs_node.children.as_slice().to_owned();
        if let Some(c1) = constant_value(builder, inner[0]) {
            let merged = builder.constant(c1 + c2);
            return Some(builder.add(inner[1], merged));
        }
        if let Some(c1) = constant_value(builder, inner[1]) {
            let merged = builder.constant(c1 + c2);
            return Some(builder.add(inner[0], merged));
        }
    }

    None
}

/// Dispatches to the appropriate pattern for `kind`. Returns
/// `Some(replacement_id)` when a pattern fires, else `None`.
///
/// All replacements go through `DagBuilder` and therefore preserve
/// structural deduplication. Patterns are ordered by expected frequency:
/// identity rules fire most often, constant folding next, then merging.
pub fn try_apply(
    builder: &mut DagBuilder,
    kind: SymbolKind,
    children: &[DagNodeId],
) -> PatternResult {
    // Identity rules.
    let identity = match kind {
        SymbolKind::Operator(OpKind::Add) => add_zero(builder, children),
        SymbolKind::Operator(OpKind::Sub) => sub_identity(builder, children),
        SymbolKind::Operator(OpKind::Mul) => mul_identity(builder, children),
        SymbolKind::Operator(OpKind::Div) => div_identity(builder, children),
        SymbolKind::Operator(OpKind::Pow) => pow_identity(builder, children),
        SymbolKind::Operator(OpKind::Neg) => neg_double(builder, children),
        _ => None,
    };
    if identity.is_some() {
        return identity;
    }

    // Constant folding: all-constant operands → single constant.
    let folded = constant_fold(builder, kind, children);
    if folded.is_some() {
        return folded;
    }

    // Constant merging: collapse nested products / sums.
    match kind {
        SymbolKind::Operator(OpKind::Mul) => mul_coef_merge(builder, children),
        SymbolKind::Operator(OpKind::Add) => add_coef_merge(builder, children),
        _ => None,
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn add_zero_folds() {
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let zero = b.constant(0.0);
        assert_eq!(add_zero(&b, &[x, zero]), Some(x));
        assert_eq!(add_zero(&b, &[zero, x]), Some(x));
        // No zero → no fold.
        let y = b.variable("y");
        assert_eq!(add_zero(&b, &[x, y]), None);
    }

    #[test]
    fn mul_identities_fire() {
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let zero = b.constant(0.0);
        let one = b.constant(1.0);
        let finite = b.constant(3.0);
        // finite * 0 → 0 (safe: 3.0 is a known finite constant)
        assert_eq!(mul_identity(&mut b, &[finite, zero]), Some(zero));
        // 0 * finite → 0 (safe)
        assert_eq!(mul_identity(&mut b, &[zero, finite]), Some(zero));
        // 1 * x → x
        assert_eq!(mul_identity(&mut b, &[one, x]), Some(x));
        // x * 1 → x
        assert_eq!(mul_identity(&mut b, &[x, one]), Some(x));
        // x * 0 → None (x is symbolic; NaN*0=NaN at runtime — don't fold)
        assert_eq!(
            mul_identity(&mut b, &[x, zero]),
            None,
            "symbolic * 0 must not fold — IEEE-754 NaN*0=NaN"
        );
        // 0 * x → None
        assert_eq!(
            mul_identity(&mut b, &[zero, x]),
            None,
            "0 * symbolic must not fold — IEEE-754 NaN*0=NaN"
        );
    }

    #[test]
    fn sub_x_minus_x_is_zero() {
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let result = sub_identity(&mut b, &[x, x]);
        assert!(result.is_some(), "x - x should fire");
        let result = result.expect("just asserted");
        assert_eq!(constant_value(&b, result), Some(0.0));
    }

    #[test]
    fn pow_zero_is_one() {
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let zero = b.constant(0.0);
        let result = pow_identity(&mut b, &[x, zero]);
        let id = result.expect("x^0 should fire");
        assert_eq!(constant_value(&b, id), Some(1.0));
    }

    #[test]
    fn neg_double_unwraps() {
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let neg_x = b.neg(x);
        let neg_neg_x = b.neg(neg_x);
        // try_apply on `Neg(Neg(x))` should unwrap to x.
        let result = neg_double(&b, &[neg_x]);
        assert_eq!(result, Some(x), "expected --x to unwrap to x");
        // Top-level dispatcher should pick the same pattern.
        assert_eq!(
            try_apply(&mut b, SymbolKind::Operator(OpKind::Neg), &[neg_x]),
            Some(x)
        );
        let _ = neg_neg_x;
    }

    #[test]
    fn constant_fold_add() {
        let mut b = DagBuilder::new();
        let c3 = b.constant(3.0);
        let c4 = b.constant(4.0);
        let result = constant_fold(&mut b, SymbolKind::Operator(OpKind::Add), &[c3, c4]);
        let id = result.expect("3 + 4 should fold");
        assert_eq!(constant_value(&b, id), Some(7.0));
    }

    #[test]
    fn constant_fold_div_by_zero_does_not_fold() {
        let mut b = DagBuilder::new();
        let c5 = b.constant(5.0);
        let c0 = b.constant(0.0);
        let result = constant_fold(&mut b, SymbolKind::Operator(OpKind::Div), &[c5, c0]);
        assert!(result.is_none(), "division by zero must not fold");
    }

    #[test]
    fn mul_coef_merge_folds_nested_constants() {
        // (3.0 * x) * 4.0  →  12.0 * x
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let c3 = b.constant(3.0);
        let inner = b.mul(c3, x);
        let c4 = b.constant(4.0);
        let result = mul_coef_merge(&mut b, &[inner, c4]);
        let id = result.expect("(3*x)*4 should merge to 12*x");
        let node = b.arena().get(id).expect("result node exists");
        assert_eq!(
            node.kind,
            SymbolKind::Operator(OpKind::Mul),
            "result is Mul"
        );
        // One child should be the constant 12.0.
        let child_vals: Vec<_> = node
            .children
            .as_slice()
            .iter()
            .filter_map(|c| constant_value(&b, *c))
            .collect();
        assert!(child_vals.iter().any(|&v| (v - 12.0).abs() < f64::EPSILON));
    }

    #[test]
    fn add_coef_merge_folds_nested_constants() {
        // (10.0 + x) + 5.0  →  x + 15.0
        let mut b = DagBuilder::new();
        let x = b.variable("x");
        let c10 = b.constant(10.0);
        let inner = b.add(c10, x);
        let c5 = b.constant(5.0);
        let result = add_coef_merge(&mut b, &[inner, c5]);
        let id = result.expect("(10+x)+5 should merge to x+15");
        let node = b.arena().get(id).expect("result node exists");
        assert_eq!(
            node.kind,
            SymbolKind::Operator(OpKind::Add),
            "result is Add"
        );
        let child_vals: Vec<_> = node
            .children
            .as_slice()
            .iter()
            .filter_map(|c| constant_value(&b, *c))
            .collect();
        assert!(child_vals.iter().any(|&v| (v - 15.0).abs() < f64::EPSILON));
    }
}