xapphire 0.1.0

compute utility
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

use ndarray::prelude::*;
use num::Float;

const EPS: f64 = 1e-9;

pub fn arr2_eq(a: &Array<f64, Ix2>, b: &Array<f64, Ix2>) -> bool {
    if a.shape() != b.shape() {
        false
    } else {
        let (r, c) = (a.shape()[0], a.shape()[1]);
        for i in 0..r {
            for j in 0..c {
                if (a[[i, j]] - b[[i, j]]).abs() > EPS {
                    return false;
                }
            }
        }
        true
    }
}

pub fn arr1_eq(a: &Array<f64, Ix1>, b: &Array<f64, Ix1>) -> bool {
    if a.shape() != b.shape() {
        false
    } else {
        let r = a.shape()[0];
        for i in 0..r {
            if (a[i] - b[i]).abs() > EPS {
                dbg!(&a);
                dbg!(&b);
                dbg!((a[i] - b[i]).abs());
                return false;
            }
        }
        true
    }
}

pub fn arr2_eq_tol(a: &Array<f64, Ix2>, b: &Array<f64, Ix2>, tol: f64) -> bool {
    if a.shape() != b.shape() {
        false
    } else {
        let (r, c) = (a.shape()[0], a.shape()[1]);
        for i in 0..r {
            for j in 0..c {
                if (a[[i, j]] - b[[i, j]]).abs() > tol {
                    return false;
                }
            }
        }
        true
    }
}

pub fn arr1_eq_tol(a: &Array<f64, Ix1>, b: &Array<f64, Ix1>, tol: f64) -> bool {
    if a.shape() != b.shape() {
        false
    } else {
        let r = a.shape()[0];
        for i in 0..r {
            if (a[i] - b[i]).abs() > tol {
                dbg!(&a);
                dbg!(&b);
                dbg!((a[i] - b[i]).abs());
                return false;
            }
        }
        true
    }
}