sleef 0.3.3

Math functions for SIMD vectors
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
112
113
114

use super::*;

fn gen_input<const N: usize>(
    rng: &mut rand::rngs::ThreadRng,
    range: core::ops::RangeInclusive<f32>,
) -> F32x<N> {
    let mut arr = [0.; N];
    for reference in arr.iter_mut() {
        *reference = crate::f32::gen_input(rng, range.clone());
    }
    arr.into()
}

pub fn test_f_f<const N: usize>(
    f_tested: fn(F32x<N>) -> F32x<N>,
    f_sample: fn(rug::Float) -> rug::Float,
    range: core::ops::RangeInclusive<f32>,
    ulp_ex: f32,
) {
    test_c_f_f(f_tested, f_sample, range, |ulp, _, _| {
        (ulp <= ulp_ex, format!("ULP: {ulp} > {ulp_ex}"))
    })
}

pub fn test_c_f_f<const N: usize>(
    f_tested: fn(F32x<N>) -> F32x<N>,
    f_sample: fn(rug::Float) -> rug::Float,
    range: core::ops::RangeInclusive<f32>,
    cf: impl Fn(f32, f32, &rug::Float) -> (bool, String),
) {
    let mut rng = rand::thread_rng();
    for n in 0..crate::TEST_REPEAT_FAST {
        let in_fx = gen_input(&mut rng, range.clone());
        let out_fx = f_tested(in_fx);
        for i in 0..N {
            let input = in_fx[i];
            let output = out_fx[i];
            let expected = f_sample(rug::Float::with_val(crate::f32::PRECF32, input));
            if expected.is_nan() && output.is_nan() {
                continue;
            }
            let ulp = crate::f32::count_ulp(output, &expected);
            let (b, fault_string) = cf(ulp, output, &expected);
            assert!(
                b,
                "Iteration: {n}, Position: {i}, Input: {input:e}, Output: {output}, Expected: {expected}, {}",
                fault_string
            );
        }
    }
}

pub fn test_f_ff<const N: usize>(
    fun_fx: fn(F32x<N>) -> (F32x<N>, F32x<N>),
    fun_f: fn(rug::Float) -> (rug::Float, rug::Float),
    range: core::ops::RangeInclusive<f32>,
    ulp_ex: f32,
) {
    let mut rng = rand::thread_rng();
    for n in 0..crate::TEST_REPEAT_FAST {
        let in_fx = gen_input(&mut rng, range.clone());
        let (out_fx1, out_fx2) = fun_fx(in_fx);
        for i in 0..N {
            let input = in_fx[i];
            let output1 = out_fx1[i];
            let output2 = out_fx2[i];
            let (expected1, expected2) = fun_f(rug::Float::with_val(crate::f32::PRECF32, input));
            if (expected1.is_nan() && output1.is_nan()) || (expected2.is_nan() && output2.is_nan())
            {
                continue;
            }
            let ulp1 = crate::f32::count_ulp(output1, &expected1);
            let ulp2 = crate::f32::count_ulp(output2, &expected2);
            assert!(
                ulp1 <= ulp_ex && ulp2 <= ulp_ex,
                    "Iteration: {n}, Position: {i}, Input: {input:e}, Output: ({output1}, {output2}), Expected: ({expected1}, {expected2}), ULP: ({ulp1}, {ulp2}) > {}",
                    ulp_ex
            );
        }
    }
}

pub fn test_ff_f<const N: usize>(
    fun_fx: fn(F32x<N>, F32x<N>) -> F32x<N>,
    fun_f: fn(rug::Float, &rug::Float) -> rug::Float,
    range1: core::ops::RangeInclusive<f32>,
    range2: core::ops::RangeInclusive<f32>,
    ulp_ex: f32,
) {
    let mut rng = rand::thread_rng();
    for n in 0..crate::TEST_REPEAT_FAST {
        let in_fx1 = gen_input(&mut rng, range1.clone());
        let in_fx2 = gen_input(&mut rng, range2.clone());
        let out_fx = fun_fx(in_fx1, in_fx2);
        for i in 0..N {
            let input1 = in_fx1[i];
            let input2 = in_fx2[i];
            let output = out_fx[i];
            let expected = fun_f(
                rug::Float::with_val(crate::f32::PRECF32, input1),
                &rug::Float::with_val(crate::f32::PRECF32, input2),
            );
            if expected.is_nan() && output.is_nan() {
                continue;
            }
            let ulp = crate::f32::count_ulp(output, &expected);
            assert!(
                ulp <= ulp_ex,
                "Iteration: {n}, Position: {i}, Input: ({input1:e}, {input2:e}), Output: {output}, Expected: {expected}, ULP: {ulp} > {}",
                ulp_ex
            );
        }
    }
}