sciforge 0.0.3

A comprehensive scientific computing library in pure Rust with zero dependencies
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

use sciforge::hub::prelude::*;

fn run_maths(name: &str, params: Vec<(&str, ParameterValue)>) -> RunOutput {
    let mut exp = Experiment::new(DomainType::Maths, name);
    for (k, v) in params {
        exp = exp.param(k, v);
    }
    ExperimentRunner::new()
        .run(&exp)
        .unwrap_or_else(|_| panic!("dispatch '{name}' failed"))
}

#[test]
fn legendre() {
    let o = run_maths("legendre", vec![("n", ParameterValue::Integer(0))]);
    match o {
        RunOutput::PolynomialOut(coeffs) => {
            assert!(!coeffs.is_empty(), "P0 should have coefficients");
            assert!((coeffs[0] - 1.0).abs() < 1e-8, "P0=[1], got {:?}", coeffs);
        }
        other => panic!("expected PolynomialOut, got {other:?}"),
    }
}

#[test]
fn chebyshev_t() {
    let o = run_maths("chebyshev_t", vec![("n", ParameterValue::Integer(0))]);
    match o {
        RunOutput::PolynomialOut(coeffs) => {
            assert!(!coeffs.is_empty(), "T0 should have coefficients");
            assert!((coeffs[0] - 1.0).abs() < 1e-8, "T0=[1], got {:?}", coeffs);
        }
        other => panic!("expected PolynomialOut, got {other:?}"),
    }
}

#[test]
fn polynomial_roots_real() {
    let out = run_maths(
        "polynomial_roots_real",
        vec![
            ("poly", ParameterValue::Polynomial(vec![1.0, 0.0, -1.0])),
            ("range_min", ParameterValue::Scalar(-10.0)),
            ("range_max", ParameterValue::Scalar(10.0)),
            ("subdivisions", ParameterValue::Integer(1000)),
            ("tol", ParameterValue::Scalar(1e-10)),
        ],
    );
    match out {
        RunOutput::Vector(v) => {
            assert!(!v.is_empty(), "x²-1 should have real roots");
        }
        _ => panic!("expected Vector output, got {out:?}"),
    }
}