1 |
|
package jalview.math; |
2 |
|
|
3 |
|
import static org.testng.Assert.assertEquals; |
4 |
|
import static org.testng.Assert.assertNotSame; |
5 |
|
import static org.testng.Assert.assertNull; |
6 |
|
import static org.testng.Assert.assertTrue; |
7 |
|
import static org.testng.Assert.fail; |
8 |
|
|
9 |
|
import java.util.Arrays; |
10 |
|
import java.util.Random; |
11 |
|
|
12 |
|
import org.testng.annotations.Test; |
13 |
|
import org.testng.internal.junit.ArrayAsserts; |
14 |
|
|
|
|
| 82.2% |
Uncovered Elements: 47 (264) |
Complexity: 41 |
Complexity Density: 0.2 |
|
15 |
|
public class MatrixTest |
16 |
|
{ |
17 |
|
final static double DELTA = 0.000001d; |
18 |
|
|
|
|
| 0% |
Uncovered Elements: 10 (10) |
Complexity: 1 |
Complexity Density: 0.1 |
4-
|
|
19 |
0 |
@Test(groups = "Timing")... |
20 |
|
public void testPreMultiply_timing() |
21 |
|
{ |
22 |
0 |
int rows = 50; |
23 |
0 |
int cols = 100; |
24 |
0 |
double[][] d1 = new double[rows][cols]; |
25 |
0 |
double[][] d2 = new double[cols][rows]; |
26 |
0 |
Matrix m1 = new Matrix(d1); |
27 |
0 |
Matrix m2 = new Matrix(d2); |
28 |
0 |
long start = System.currentTimeMillis(); |
29 |
0 |
m1.preMultiply(m2); |
30 |
0 |
long elapsed = System.currentTimeMillis() - start; |
31 |
0 |
System.out.println(rows + "x" + cols |
32 |
|
+ " multiplications of double took " + elapsed + "ms"); |
33 |
|
} |
34 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (12) |
Complexity: 1 |
Complexity Density: 0.08 |
1PASS
|
|
35 |
1 |
@Test(groups = "Functional")... |
36 |
|
public void testPreMultiply() |
37 |
|
{ |
38 |
1 |
Matrix m1 = new Matrix(new double[][] { { 2, 3, 4 } }); |
39 |
1 |
Matrix m2 = new Matrix(new double[][] { { 5 }, { 6 }, { 7 } }); |
40 |
|
|
41 |
|
|
42 |
|
|
43 |
|
|
44 |
|
|
45 |
1 |
MatrixI m3 = m2.preMultiply(m1); |
46 |
1 |
assertEquals(m3.height(), 1); |
47 |
1 |
assertEquals(m3.width(), 1); |
48 |
1 |
assertEquals(m3.getValue(0, 0), 56d); |
49 |
|
|
50 |
|
|
51 |
|
|
52 |
|
|
53 |
1 |
m3 = m1.preMultiply(m2); |
54 |
1 |
assertEquals(m3.height(), 3); |
55 |
1 |
assertEquals(m3.width(), 3); |
56 |
1 |
assertEquals(Arrays.toString(m3.getRow(0)), "[10.0, 15.0, 20.0]"); |
57 |
1 |
assertEquals(Arrays.toString(m3.getRow(1)), "[12.0, 18.0, 24.0]"); |
58 |
1 |
assertEquals(Arrays.toString(m3.getRow(2)), "[14.0, 21.0, 28.0]"); |
59 |
|
} |
60 |
|
|
|
|
| 66.7% |
Uncovered Elements: 1 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1PASS
|
|
61 |
1 |
@Test(... |
62 |
|
groups = "Functional", |
63 |
|
expectedExceptions = { IllegalArgumentException.class }) |
64 |
|
public void testPreMultiply_tooManyColumns() |
65 |
|
{ |
66 |
1 |
Matrix m1 = new Matrix(new double[][] { { 2, 3, 4 }, { 3, 4, 5 } }); |
67 |
|
|
68 |
|
|
69 |
|
|
70 |
|
|
71 |
|
|
72 |
1 |
m1.preMultiply(m1); |
73 |
0 |
fail("Expected exception"); |
74 |
|
} |
75 |
|
|
|
|
| 66.7% |
Uncovered Elements: 1 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1PASS
|
|
76 |
1 |
@Test(... |
77 |
|
groups = "Functional", |
78 |
|
expectedExceptions = { IllegalArgumentException.class }) |
79 |
|
public void testPreMultiply_tooFewColumns() |
80 |
|
{ |
81 |
1 |
Matrix m1 = new Matrix(new double[][] { { 2, 3, 4 }, { 3, 4, 5 } }); |
82 |
|
|
83 |
|
|
84 |
|
|
85 |
|
|
86 |
|
|
87 |
1 |
m1.preMultiply(m1); |
88 |
0 |
fail("Expected exception"); |
89 |
|
} |
90 |
|
|
91 |
|
|
|
|
| 66.7% |
Uncovered Elements: 4 (12) |
Complexity: 5 |
Complexity Density: 0.83 |
|
92 |
1 |
private boolean matrixEquals(Matrix m1, Matrix m2) {... |
93 |
1 |
if (m1.width() != m2.width() || m1.height() != m2.height()) |
94 |
|
{ |
95 |
0 |
return false; |
96 |
|
} |
97 |
6 |
for (int i = 0; i < m1.height(); i++) |
98 |
|
{ |
99 |
5 |
if (!Arrays.equals(m1.getRow(i), m2.getRow(i))) |
100 |
|
{ |
101 |
0 |
return false; |
102 |
|
} |
103 |
|
} |
104 |
1 |
return true; |
105 |
|
} |
106 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (32) |
Complexity: 1 |
Complexity Density: 0.03 |
1PASS
|
|
107 |
1 |
@Test(groups = "Functional")... |
108 |
|
public void testPostMultiply() |
109 |
|
{ |
110 |
|
|
111 |
|
|
112 |
|
|
113 |
|
|
114 |
|
|
115 |
|
|
116 |
|
|
117 |
|
|
118 |
1 |
MatrixI m1 = new Matrix(new double[][] { { 2, 3 }, { 4, 5 } }); |
119 |
1 |
MatrixI m2 = new Matrix(new double[][] { { 10, 100 }, { 1000, 10000 } }); |
120 |
1 |
MatrixI m3 = m1.postMultiply(m2); |
121 |
1 |
assertEquals(Arrays.toString(m3.getRow(0)), "[3020.0, 30200.0]"); |
122 |
1 |
assertEquals(Arrays.toString(m3.getRow(1)), "[5040.0, 50400.0]"); |
123 |
|
|
124 |
|
|
125 |
|
|
126 |
|
|
127 |
1 |
m3 = m2.preMultiply(m1); |
128 |
1 |
assertEquals(Arrays.toString(m3.getRow(0)), "[3020.0, 30200.0]"); |
129 |
1 |
assertEquals(Arrays.toString(m3.getRow(1)), "[5040.0, 50400.0]"); |
130 |
|
|
131 |
|
|
132 |
|
|
133 |
|
|
134 |
|
|
135 |
|
|
136 |
1 |
m1 = new Matrix(new double[][] { { 2 }, { 3 } }); |
137 |
1 |
m2 = new Matrix(new double[][] { { 10, 100, 1000 } }); |
138 |
1 |
m3 = m1.postMultiply(m2); |
139 |
1 |
assertEquals(m3.height(), 2); |
140 |
1 |
assertEquals(m3.width(), 3); |
141 |
1 |
assertEquals(Arrays.toString(m3.getRow(0)), "[20.0, 200.0, 2000.0]"); |
142 |
1 |
assertEquals(Arrays.toString(m3.getRow(1)), "[30.0, 300.0, 3000.0]"); |
143 |
1 |
m3 = m2.preMultiply(m1); |
144 |
1 |
assertEquals(m3.height(), 2); |
145 |
1 |
assertEquals(m3.width(), 3); |
146 |
1 |
assertEquals(Arrays.toString(m3.getRow(0)), "[20.0, 200.0, 2000.0]"); |
147 |
1 |
assertEquals(Arrays.toString(m3.getRow(1)), "[30.0, 300.0, 3000.0]"); |
148 |
|
|
149 |
|
|
150 |
|
|
151 |
|
|
152 |
|
|
153 |
|
|
154 |
|
|
155 |
|
|
156 |
|
|
157 |
1 |
m1 = new Matrix(new double[][] { { 2, 3, 4 } }); |
158 |
1 |
m2 = new Matrix(new double[][] { { 5, 4 }, { 6, 3 }, { 7, 2 } }); |
159 |
1 |
m3 = m1.postMultiply(m2); |
160 |
1 |
assertEquals(m3.height(), 1); |
161 |
1 |
assertEquals(m3.width(), 2); |
162 |
1 |
assertEquals(m3.getRow(0)[0], 56d); |
163 |
1 |
assertEquals(m3.getRow(0)[1], 25d); |
164 |
|
|
165 |
|
|
166 |
|
|
167 |
|
|
168 |
1 |
m3 = m2.preMultiply(m1); |
169 |
1 |
assertEquals(m3.height(), 1); |
170 |
1 |
assertEquals(m3.width(), 2); |
171 |
1 |
assertEquals(m3.getRow(0)[0], 56d); |
172 |
1 |
assertEquals(m3.getRow(0)[1], 25d); |
173 |
|
} |
174 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (15) |
Complexity: 3 |
Complexity Density: 0.27 |
1PASS
|
|
175 |
1 |
@Test(groups = "Functional")... |
176 |
|
public void testCopy() |
177 |
|
{ |
178 |
1 |
Random r = new Random(); |
179 |
1 |
int rows = 5; |
180 |
1 |
int cols = 11; |
181 |
1 |
double[][] in = new double[rows][cols]; |
182 |
|
|
183 |
6 |
for (int i = 0; i < rows; i++) |
184 |
|
{ |
185 |
60 |
for (int j = 0; j < cols; j++) |
186 |
|
{ |
187 |
55 |
in[i][j] = r.nextDouble(); |
188 |
|
} |
189 |
|
} |
190 |
1 |
Matrix m1 = new Matrix(in); |
191 |
1 |
Matrix m2 = (Matrix) m1.copy(); |
192 |
1 |
assertNotSame(m1, m2); |
193 |
1 |
assertTrue(matrixEquals(m1, m2)); |
194 |
|
} |
195 |
|
|
196 |
|
|
197 |
|
|
198 |
|
|
199 |
|
@param |
200 |
|
|
|
|
| 0% |
Uncovered Elements: 14 (14) |
Complexity: 3 |
Complexity Density: 0.3 |
|
201 |
0 |
public static void main(String[] args) throws Exception... |
202 |
|
{ |
203 |
0 |
int n = Integer.parseInt(args[0]); |
204 |
0 |
double[][] in = new double[n][n]; |
205 |
|
|
206 |
0 |
for (int i = 0; i < n; i++) |
207 |
|
{ |
208 |
0 |
for (int j = 0; j < n; j++) |
209 |
|
{ |
210 |
0 |
in[i][j] = Math.random(); |
211 |
|
} |
212 |
|
} |
213 |
|
|
214 |
0 |
Matrix origmat = new Matrix(in); |
215 |
|
|
216 |
|
|
217 |
|
|
218 |
|
|
219 |
|
|
220 |
0 |
MatrixI trans = origmat.transpose(); |
221 |
|
|
222 |
|
|
223 |
|
|
224 |
|
|
225 |
0 |
MatrixI symm = trans.postMultiply(origmat); |
226 |
|
|
227 |
|
|
228 |
|
|
229 |
|
|
230 |
|
|
231 |
|
|
232 |
|
|
233 |
|
|
234 |
0 |
symm.tred(); |
235 |
|
|
236 |
|
|
237 |
|
|
238 |
|
|
239 |
|
|
240 |
|
|
241 |
|
|
242 |
|
|
243 |
|
|
244 |
|
|
245 |
|
|
246 |
|
|
247 |
|
|
248 |
|
|
249 |
|
|
250 |
0 |
symm.tqli(); |
251 |
|
|
252 |
|
|
253 |
|
|
254 |
|
|
255 |
|
|
256 |
|
|
257 |
|
|
258 |
|
|
259 |
|
|
260 |
|
|
261 |
|
|
262 |
|
|
263 |
|
|
264 |
|
|
265 |
|
|
266 |
|
|
267 |
|
|
268 |
|
|
269 |
|
|
270 |
|
|
271 |
|
|
272 |
|
|
273 |
|
|
274 |
|
} |
275 |
|
|
|
|
| 0% |
Uncovered Elements: 6 (6) |
Complexity: 1 |
Complexity Density: 0.17 |
1PASS
|
|
276 |
0 |
@Test(groups = "Timing")... |
277 |
|
public void testSign() |
278 |
|
{ |
279 |
0 |
assertEquals(Matrix.sign(-1, -2), -1d); |
280 |
0 |
assertEquals(Matrix.sign(-1, 2), 1d); |
281 |
0 |
assertEquals(Matrix.sign(-1, 0), 1d); |
282 |
0 |
assertEquals(Matrix.sign(1, -2), -1d); |
283 |
0 |
assertEquals(Matrix.sign(1, 2), 1d); |
284 |
0 |
assertEquals(Matrix.sign(1, 0), 1d); |
285 |
|
} |
286 |
|
|
287 |
|
|
288 |
|
|
289 |
|
|
290 |
|
@param |
291 |
|
@param |
292 |
|
@param |
293 |
|
|
294 |
|
@return |
295 |
|
|
|
|
| 89.5% |
Uncovered Elements: 2 (19) |
Complexity: 5 |
Complexity Density: 0.45 |
|
296 |
1 |
public double[][] getSparseValues(int rows, int cols, int occupancy)... |
297 |
|
{ |
298 |
1 |
Random r = new Random(1729); |
299 |
|
|
300 |
|
|
301 |
|
|
302 |
|
|
303 |
|
|
304 |
1 |
double[][] d = new double[rows][cols]; |
305 |
1 |
int m = 0; |
306 |
11 |
for (int i = 0; i < rows; i++) |
307 |
|
{ |
308 |
10 |
if (++m % occupancy == 0) |
309 |
|
{ |
310 |
0 |
d[i][i] = r.nextInt() % 13; |
311 |
|
} |
312 |
55 |
for (int j = 0; j < i; j++) |
313 |
|
{ |
314 |
45 |
if (++m % occupancy == 0) |
315 |
|
{ |
316 |
18 |
d[i][j] = r.nextInt() % 13; |
317 |
18 |
d[j][i] = d[i][j]; |
318 |
|
} |
319 |
|
} |
320 |
|
} |
321 |
1 |
return d; |
322 |
|
|
323 |
|
} |
324 |
|
|
325 |
|
|
326 |
|
|
327 |
|
|
328 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (17) |
Complexity: 3 |
Complexity Density: 0.23 |
1PASS
|
|
329 |
1 |
@Test(groups = "Functional")... |
330 |
|
public void testTred_reproducible() |
331 |
|
{ |
332 |
|
|
333 |
|
|
334 |
|
|
335 |
1 |
int rows = 10; |
336 |
1 |
int cols = rows; |
337 |
1 |
double[][] d = getSparseValues(rows, cols, 3); |
338 |
|
|
339 |
|
|
340 |
|
|
341 |
|
|
342 |
|
|
343 |
1 |
double[][] d1 = new double[rows][cols]; |
344 |
11 |
for (int row = 0; row < rows; row++) |
345 |
|
{ |
346 |
110 |
for (int col = 0; col < cols; col++) |
347 |
|
{ |
348 |
100 |
d1[row][col] = d[row][col]; |
349 |
|
} |
350 |
|
} |
351 |
1 |
Matrix m1 = new Matrix(d); |
352 |
1 |
Matrix m2 = new Matrix(d1); |
353 |
1 |
assertMatricesMatch(m1, m2); |
354 |
1 |
m1.tred(); |
355 |
1 |
m2.tred(); |
356 |
1 |
assertMatricesMatch(m1, m2); |
357 |
|
} |
358 |
|
|
|
|
| 72.7% |
Uncovered Elements: 6 (22) |
Complexity: 6 |
Complexity Density: 0.5 |
|
359 |
2 |
private void assertMatricesMatch(MatrixI m1, MatrixI m2)... |
360 |
|
{ |
361 |
2 |
if (m1.height() != m2.height()) |
362 |
|
{ |
363 |
0 |
fail("height mismatch"); |
364 |
|
} |
365 |
2 |
if (m1.width() != m2.width()) |
366 |
|
{ |
367 |
0 |
fail("width mismatch"); |
368 |
|
} |
369 |
22 |
for (int row = 0; row < m1.height(); row++) |
370 |
|
{ |
371 |
220 |
for (int col = 0; col < m1.width(); col++) |
372 |
|
{ |
373 |
200 |
double v2 = m2.getValue(row, col); |
374 |
200 |
double v1 = m1.getValue(row, col); |
375 |
200 |
if (Math.abs(v1 - v2) > DELTA) |
376 |
|
{ |
377 |
0 |
fail(String.format("At [%d, %d] %f != %f", row, col, v1, v2)); |
378 |
|
} |
379 |
|
} |
380 |
|
} |
381 |
2 |
ArrayAsserts.assertArrayEquals(m1.getD(), m2.getD(), 0.00001d); |
382 |
2 |
ArrayAsserts.assertArrayEquals(m1.getE(), m2.getE(), 0.00001d); |
383 |
|
} |
384 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 1 |
Complexity Density: 0.11 |
1PASS
|
|
385 |
1 |
@Test(groups = "Functional")... |
386 |
|
public void testFindMinMax() |
387 |
|
{ |
388 |
|
|
389 |
|
|
390 |
|
|
391 |
1 |
Matrix m = new Matrix(new double[][] { {} }); |
392 |
1 |
assertNull(m.findMinMax()); |
393 |
|
|
394 |
|
|
395 |
|
|
396 |
|
|
397 |
1 |
double[][] vals = new double[2][]; |
398 |
1 |
vals[0] = new double[] {7d, 1d, -2.3d}; |
399 |
1 |
vals[1] = new double[] {-12d, 94.3d, -102.34d}; |
400 |
1 |
m = new Matrix(vals); |
401 |
1 |
double[] minMax = m.findMinMax(); |
402 |
1 |
assertEquals(minMax[0], -102.34d); |
403 |
1 |
assertEquals(minMax[1], 94.3d); |
404 |
|
} |
405 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (28) |
Complexity: 5 |
Complexity Density: 0.25 |
1PASS
|
|
406 |
1 |
@Test(groups = { "Functional", "Timing" })... |
407 |
|
public void testFindMinMax_timing() |
408 |
|
{ |
409 |
1 |
Random r = new Random(); |
410 |
1 |
int size = 1000; |
411 |
1 |
double[][] vals = new double[size][size]; |
412 |
1 |
double max = -Double.MAX_VALUE; |
413 |
1 |
double min = Double.MAX_VALUE; |
414 |
1001 |
for (int i = 0; i < size; i++) |
415 |
|
{ |
416 |
1000 |
vals[i] = new double[size]; |
417 |
1001000 |
for (int j = 0; j < size; j++) |
418 |
|
{ |
419 |
|
|
420 |
1000000 |
double d = r.nextLong(); |
421 |
1000000 |
if (d > max) |
422 |
|
{ |
423 |
21 |
max = d; |
424 |
|
} |
425 |
1000000 |
if (d < min) |
426 |
|
{ |
427 |
16 |
min = d; |
428 |
|
} |
429 |
1000000 |
vals[i][j] = d; |
430 |
|
} |
431 |
|
} |
432 |
1 |
Matrix m = new Matrix(vals); |
433 |
1 |
long now = System.currentTimeMillis(); |
434 |
1 |
double[] minMax = m.findMinMax(); |
435 |
1 |
System.out.println(String.format("findMinMax for %d x %d took %dms", |
436 |
|
size, size, (System.currentTimeMillis() - now))); |
437 |
1 |
assertEquals(minMax[0], min); |
438 |
1 |
assertEquals(minMax[1], max); |
439 |
|
} |
440 |
|
|
441 |
|
|
442 |
|
|
443 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (15) |
Complexity: 1 |
Complexity Density: 0.07 |
1PASS
|
|
444 |
1 |
@Test(groups = "Functional")... |
445 |
|
public void testReverseRange_maxToZero() |
446 |
|
{ |
447 |
1 |
Matrix m1 = new Matrix( |
448 |
|
new double[][] { { 2, 3.5, 4 }, { -3.4, 4, 15 } }); |
449 |
|
|
450 |
|
|
451 |
|
|
452 |
|
|
453 |
1 |
m1.reverseRange(true); |
454 |
1 |
assertEquals(m1.getValue(0, 0), 13d, DELTA); |
455 |
1 |
assertEquals(m1.getValue(0, 1), 11.5d, DELTA); |
456 |
1 |
assertEquals(m1.getValue(0, 2), 11d, DELTA); |
457 |
1 |
assertEquals(m1.getValue(1, 0), 18.4d, DELTA); |
458 |
1 |
assertEquals(m1.getValue(1, 1), 11d, DELTA); |
459 |
1 |
assertEquals(m1.getValue(1, 2), 0d, DELTA); |
460 |
|
|
461 |
|
|
462 |
|
|
463 |
|
|
464 |
1 |
m1.reverseRange(true); |
465 |
1 |
assertEquals(m1.getValue(0, 0), 5.4d, DELTA); |
466 |
1 |
assertEquals(m1.getValue(0, 1), 6.9d, DELTA); |
467 |
1 |
assertEquals(m1.getValue(0, 2), 7.4d, DELTA); |
468 |
1 |
assertEquals(m1.getValue(1, 0), 0d, DELTA); |
469 |
1 |
assertEquals(m1.getValue(1, 1), 7.4d, DELTA); |
470 |
1 |
assertEquals(m1.getValue(1, 2), 18.4d, DELTA); |
471 |
|
} |
472 |
|
|
473 |
|
|
474 |
|
|
475 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (15) |
Complexity: 1 |
Complexity Density: 0.07 |
1PASS
|
|
476 |
1 |
@Test(groups = "Functional")... |
477 |
|
public void testReverseRange_swapMinMax() |
478 |
|
{ |
479 |
1 |
Matrix m1 = new Matrix( |
480 |
|
new double[][] { { 2, 3.5, 4 }, { -3.4, 4, 15 } }); |
481 |
|
|
482 |
|
|
483 |
|
|
484 |
|
|
485 |
|
|
486 |
|
|
487 |
1 |
m1.reverseRange(false); |
488 |
1 |
assertEquals(m1.getValue(0, 0), 9.6d, DELTA); |
489 |
1 |
assertEquals(m1.getValue(0, 1), 8.1d, DELTA); |
490 |
1 |
assertEquals(m1.getValue(0, 2), 7.6d, DELTA); |
491 |
1 |
assertEquals(m1.getValue(1, 0), 15d, DELTA); |
492 |
1 |
assertEquals(m1.getValue(1, 1), 7.6d, DELTA); |
493 |
1 |
assertEquals(m1.getValue(1, 2), -3.4d, DELTA); |
494 |
|
|
495 |
|
|
496 |
|
|
497 |
|
|
498 |
1 |
m1.reverseRange(false); |
499 |
1 |
assertEquals(m1.getValue(0, 0), 2d, DELTA); |
500 |
1 |
assertEquals(m1.getValue(0, 1), 3.5d, DELTA); |
501 |
1 |
assertEquals(m1.getValue(0, 2), 4d, DELTA); |
502 |
1 |
assertEquals(m1.getValue(1, 0), -3.4d, DELTA); |
503 |
1 |
assertEquals(m1.getValue(1, 1), 4d, DELTA); |
504 |
1 |
assertEquals(m1.getValue(1, 2), 15d, DELTA); |
505 |
|
} |
506 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 1 |
Complexity Density: 0.12 |
1PASS
|
|
507 |
1 |
@Test(groups = "Functional")... |
508 |
|
public void testMultiply() |
509 |
|
{ |
510 |
1 |
Matrix m = new Matrix(new double[][] { { 2, 3.5, 4 }, { -3.4, 4, 15 } }); |
511 |
1 |
m.multiply(2d); |
512 |
1 |
assertEquals(m.getValue(0, 0), 4d, DELTA); |
513 |
1 |
assertEquals(m.getValue(0, 1), 7d, DELTA); |
514 |
1 |
assertEquals(m.getValue(0, 2), 8d, DELTA); |
515 |
1 |
assertEquals(m.getValue(1, 0), -6.8d, DELTA); |
516 |
1 |
assertEquals(m.getValue(1, 1), 8d, DELTA); |
517 |
1 |
assertEquals(m.getValue(1, 2), 30d, DELTA); |
518 |
|
} |
519 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 1 |
Complexity Density: 0.17 |
1PASS
|
|
520 |
1 |
@Test(groups = "Functional")... |
521 |
|
public void testConstructor() |
522 |
|
{ |
523 |
1 |
double[][] values = new double[][] { { 1, 2, 3 }, { 4, 5, 6 } }; |
524 |
1 |
Matrix m = new Matrix(values); |
525 |
1 |
assertEquals(m.getValue(0, 0), 1d, DELTA); |
526 |
|
|
527 |
|
|
528 |
|
|
529 |
|
|
530 |
1 |
assertNotSame(values[0], m.getRow(0)); |
531 |
1 |
values[0][0] = -1d; |
532 |
1 |
assertEquals(m.getValue(0, 0), 1d, DELTA); |
533 |
|
} |
534 |
|
} |