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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#![forbid(unsafe_code)]
//! Property-based tests for the `Matrix` public API.
use approx::assert_abs_diff_eq;
use pastey::paste;
use proptest::{array, prelude::*};
use la_stack::prelude::*;
fn small_f64() -> impl Strategy<Value = f64> {
(-1000i16..=1000i16).prop_map(|x| f64::from(x) / 10.0)
}
fn small_nonzero_f64() -> impl Strategy<Value = f64> {
prop_oneof![(-1000i16..=-1i16), (1i16..=1000i16)].prop_map(|x| f64::from(x) / 10.0)
}
macro_rules! gen_matrix_proptests {
($d:literal) => {
paste! {
proptest! {
#![proptest_config(ProptestConfig::with_cases(64))]
#[test]
fn [<matrix_try_from_rows_views_and_get_roundtrip_ $d d>](
rows in array::[<uniform $d>](
array::[<uniform $d>](small_f64()),
),
) {
let m = Matrix::<$d>::try_from_rows(rows).unwrap();
prop_assert_eq!(m.as_rows(), &rows);
for r in 0..$d {
for c in 0..$d {
assert_abs_diff_eq!(m.get(r, c).unwrap(), rows[r][c], epsilon = 0.0);
assert_abs_diff_eq!(m.try_get(r, c).unwrap(), rows[r][c], epsilon = 0.0);
}
}
// Out-of-bounds is None.
prop_assert_eq!(m.get($d, 0), None);
prop_assert_eq!(m.get(0, $d), None);
let row_out_of_bounds = matches!(
m.try_get($d, 0),
Err(LaError::IndexOutOfBounds {
row,
col,
dim,
..
})
if row == $d && col == 0 && dim == $d
);
prop_assert!(row_out_of_bounds);
let col_out_of_bounds = matches!(
m.try_get(0, $d),
Err(LaError::IndexOutOfBounds {
row,
col,
dim,
..
})
if row == 0 && col == $d && dim == $d
);
prop_assert!(col_out_of_bounds);
prop_assert_eq!(m.into_rows(), rows);
}
#[test]
fn [<matrix_set_get_in_bounds_ $d d>](
r in 0usize..$d,
c in 0usize..$d,
v in small_f64(),
) {
let mut m = Matrix::<$d>::zero();
prop_assert_eq!(m.set(r, c, v), Ok(()));
assert_abs_diff_eq!(m.get(r, c).unwrap(), v, epsilon = 0.0);
prop_assert_eq!(m.set(r, c, -v), Ok(()));
assert_abs_diff_eq!(m.try_get(r, c).unwrap(), -v, epsilon = 0.0);
}
#[test]
fn [<matrix_set_out_of_bounds_preserves_matrix_ $d d>](
rows in array::[<uniform $d>](
array::[<uniform $d>](small_f64()),
),
v in small_f64(),
) {
let mut m = Matrix::<$d>::try_from_rows(rows).unwrap();
let original = m;
let row_out_of_bounds = matches!(
m.set($d, 0, v),
Err(LaError::IndexOutOfBounds {
row,
col,
dim,
..
})
if row == $d && col == 0 && dim == $d
);
prop_assert!(row_out_of_bounds);
prop_assert_eq!(m, original);
let col_out_of_bounds = matches!(
m.set(0, $d, v),
Err(LaError::IndexOutOfBounds {
row,
col,
dim,
..
})
if row == 0 && col == $d && dim == $d
);
prop_assert!(col_out_of_bounds);
prop_assert_eq!(m, original);
}
#[test]
fn [<matrix_inf_norm_matches_max_abs_row_sum_ $d d>](
rows in array::[<uniform $d>](
array::[<uniform $d>](small_f64()),
),
) {
let m = Matrix::<$d>::try_from_rows(rows).unwrap();
let expected = rows
.iter()
.map(|row| row.iter().map(|&x| x.abs()).sum::<f64>())
.fold(0.0f64, f64::max);
let actual = m.inf_norm().unwrap();
assert_abs_diff_eq!(actual, expected, epsilon = 0.0);
prop_assert!(actual >= 0.0);
}
#[test]
fn [<matrix_det_and_solve_for_diagonal_ $d d>](
diag in array::[<uniform $d>](small_nonzero_f64()),
b_arr in array::[<uniform $d>](small_f64()),
) {
// Diagonal matrix: det is product of diagonal, and solve is element-wise division.
let mut rows = [[0.0f64; $d]; $d];
for i in 0..$d {
rows[i][i] = diag[i];
}
let a = Matrix::<$d>::try_from_rows(rows).unwrap();
let det = a.det().unwrap();
let expected_det = {
let mut acc = 1.0;
for i in 0..$d {
acc *= diag[i];
}
acc
};
// The closed-form and LU paths evaluate the diagonal
// product in different orders, so we allow a few ULPs of
// relative error (floor 1e-12 for near-zero determinants).
let eps = expected_det.abs().mul_add(1e-12, 1e-12);
assert_abs_diff_eq!(det, expected_det, epsilon = eps);
let lu = a.lu(DEFAULT_SINGULAR_TOL).unwrap();
let b = Vector::<$d>::try_new(b_arr).unwrap();
let x = lu.solve(b).unwrap().into_array();
for i in 0..$d {
let expected_x = b_arr[i] / diag[i];
assert_abs_diff_eq!(x[i], expected_x, epsilon = 1e-12);
}
}
}
}
};
}
// Mirror delaunay-style multi-dimension tests.
gen_matrix_proptests!(1);
gen_matrix_proptests!(2);
gen_matrix_proptests!(3);
gen_matrix_proptests!(4);
gen_matrix_proptests!(5);
#[test]
fn zero_dimension_matrix_obeys_empty_product_and_bounds_contracts() {
let mut matrix = Matrix::<0>::try_from_rows([]).unwrap();
assert!(matrix.as_rows().is_empty());
assert_eq!(matrix.get(0, 0), None);
assert!(matches!(
matrix.try_get(0, 0),
Err(LaError::IndexOutOfBounds {
row: 0,
col: 0,
dim: 0,
..
})
));
assert!(matches!(
matrix.set(0, 0, 1.0),
Err(LaError::IndexOutOfBounds {
row: 0,
col: 0,
dim: 0,
..
})
));
assert_eq!(matrix.inf_norm(), Ok(0.0));
assert_eq!(matrix.det(), Ok(1.0));
assert!(
matrix
.lu(DEFAULT_SINGULAR_TOL)
.unwrap()
.solve(Vector::<0>::zero())
.unwrap()
.into_array()
.is_empty()
);
}