ries 2.0.2

Find algebraic equations given their solution - Rust implementation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111

//! Shared match presentation fields for binding surfaces.

use crate::search::Match;
use crate::solver::{canonical_expression_key, solve_for_x_rhs_expression};
use crate::thresholds::EXACT_MATCH_TOLERANCE;

/// Presentation-ready fields derived from a search [`Match`].
///
/// Binding surfaces (WASM, Python) convert this into their own types with
/// trivial field copies, keeping derived-field logic in one place.
#[derive(Clone, Debug)]
pub struct MatchSummary {
    /// Left-hand side expression in infix notation
    pub lhs: String,
    /// Right-hand side expression in infix notation
    pub rhs: String,
    /// Left-hand side expression in postfix notation
    pub lhs_postfix: String,
    /// Right-hand side expression in postfix notation
    pub rhs_postfix: String,
    /// Solved `x = expression` in infix notation, when analytically solvable
    pub solve_for_x: Option<String>,
    /// Solved `x = expression` in postfix notation
    pub solve_for_x_postfix: Option<String>,
    /// Canonical key for deduplication
    pub canonical_key: String,
    /// Solved value of x
    pub x_value: f64,
    /// Error (x_value - target)
    pub error: f64,
    /// Complexity score
    pub complexity: u32,
    /// Number of operators in the equation
    pub operator_count: usize,
    /// Maximum tree depth of the equation
    pub tree_depth: usize,
    /// Whether this is an exact match
    pub is_exact: bool,
}

impl From<Match> for MatchSummary {
    fn from(m: Match) -> Self {
        Self::from_match(&m)
    }
}

impl MatchSummary {
    /// Build presentation fields from a search match.
    pub fn from_match(m: &Match) -> Self {
        let lhs_infix = m.lhs.expr.to_infix_or_postfix();
        let rhs_infix = m.rhs.expr.to_infix_or_postfix();

        let solved = solve_for_x_rhs_expression(&m.lhs.expr, &m.rhs.expr);
        let solve_for_x = solved
            .as_ref()
            .map(|e| format!("x = {}", e.to_infix_or_postfix()));
        let solve_for_x_postfix = solved.as_ref().map(|e| e.to_postfix());

        let canonical_key = canonical_expression_key(&m.lhs.expr)
            .zip(canonical_expression_key(&m.rhs.expr))
            .map(|(l, r)| format!("{l}={r}"))
            .unwrap_or_else(|| format!("{}={}", m.lhs.expr.to_postfix(), m.rhs.expr.to_postfix()));

        Self {
            lhs: lhs_infix,
            rhs: rhs_infix,
            lhs_postfix: m.lhs.expr.to_postfix(),
            rhs_postfix: m.rhs.expr.to_postfix(),
            solve_for_x,
            solve_for_x_postfix,
            canonical_key,
            x_value: m.x_value,
            error: m.error,
            complexity: m.complexity,
            operator_count: m.lhs.expr.operator_count() + m.rhs.expr.operator_count(),
            tree_depth: m.lhs.expr.tree_depth().max(m.rhs.expr.tree_depth()),
            is_exact: m.error.abs() < EXACT_MATCH_TOLERANCE,
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::expr::{EvaluatedExpr, Expression};
    use crate::symbol::NumType;

    fn make_match(lhs: &str, rhs: &str, error: f64) -> Match {
        let lhs_expr = Expression::parse(lhs).unwrap();
        let rhs_expr = Expression::parse(rhs).unwrap();
        let complexity = lhs_expr.complexity() + rhs_expr.complexity();
        Match {
            lhs: EvaluatedExpr::new(lhs_expr, 0.0, 1.0, NumType::Integer),
            rhs: EvaluatedExpr::new(rhs_expr, 0.0, 0.0, NumType::Integer),
            x_value: 2.5,
            error,
            complexity,
        }
    }

    #[test]
    fn match_summary_populates_core_fields() {
        let summary = MatchSummary::from_match(&make_match("x1+", "3", 0.0));
        assert_eq!(summary.lhs_postfix, "x1+");
        assert_eq!(summary.rhs_postfix, "3");
        assert!(summary.is_exact);
        assert!(summary.operator_count > 0);
        assert!(summary.tree_depth > 0);
        assert!(!summary.canonical_key.is_empty());
    }
}