emlex 0.1.0

A zero-cost S-expression mathematical DSL engine for Rust. Provides compile-time evaluation, AST preservation, optimization, and reverse DSL reconstruction.
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

// Increase recursion limit if testing extremely deep ASTs
#![recursion_limit = "256"]

use emlex::prelude::*;

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

    #[test]
    fn test_extreme_recursion_depth() {
        let x: f64 = 2.0;

        // Deeply nested AST structure to stress-test the TT-muncher recursion.
        // It recursively applies `exp` 10 times: exp(exp(exp...))
        let (_, result) = eml!(
            (eml (eml (eml (eml (eml (eml (eml (eml (eml (eml x 1) 1) 1) 1) 1) 1) 1) 1) 1) 1)
        );

        let expected = x
            .exp()
            .exp()
            .exp()
            .exp()
            .exp()
            .exp()
            .exp()
            .exp()
            .exp()
            .exp();

        assert_eq!(result, expected);
    }
}