1 /* matrix/test_source.c
3 * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or (at
8 * your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
20 void FUNCTION (test, func) (void);
21 void FUNCTION (test, trap) (void);
22 void FUNCTION (test, text) (void);
23 void FUNCTION (test, binary) (void);
25 #define TEST(expr,desc) gsl_test((expr), NAME(gsl_matrix) desc " M=%d, N=%d", M, N)
28 FUNCTION (test, func) (void)
30 TYPE (gsl_vector) * v;
34 TYPE (gsl_matrix) * m = FUNCTION (gsl_matrix, alloc) (M, N);
36 gsl_test (m->data == 0, NAME (gsl_matrix) "_alloc returns valid pointer");
37 gsl_test (m->size1 != M, NAME (gsl_matrix) "_alloc returns valid size1");
38 gsl_test (m->size2 != N, NAME (gsl_matrix) "_alloc returns valid size2");
39 gsl_test (m->tda != N, NAME (gsl_matrix) "_alloc returns valid tda");
41 for (i = 0; i < M; i++)
43 for (j = 0; j < N; j++)
46 FUNCTION (gsl_matrix, set) (m, i, j, (BASE) k);
53 for (i = 0; i < M; i++)
55 for (j = 0; j < N; j++)
58 if (m->data[i * N + j] != (BASE) k)
63 gsl_test (status, NAME (gsl_matrix) "_set writes into array");
69 for (i = 0; i < M; i++)
71 for (j = 0; j < N; j++)
74 if (FUNCTION (gsl_matrix, get) (m, i, j) != (BASE) k)
78 gsl_test (status, NAME (gsl_matrix) "_get reads from array");
82 FUNCTION (gsl_matrix, free) (m); /* free whatever is in m */
84 m = FUNCTION (gsl_matrix, calloc) (M, N);
85 v = FUNCTION (gsl_vector, calloc) (N);
88 int status = (FUNCTION(gsl_matrix,isnull)(m) != 1);
89 TEST (status, "_isnull" DESC " on calloc matrix");
91 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
92 TEST (status, "_ispos" DESC " on calloc matrix");
94 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
95 TEST (status, "_isneg" DESC " on calloc matrix");
97 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 1);
98 TEST (status, "_isnonneg" DESC " on calloc matrix");
103 for (i = 0; i < M; i++)
105 for (j = 0; j < N; j++)
108 FUNCTION (gsl_matrix, set) (m, i, j, (BASE) k);
116 for (i = 0; i < M; i++)
118 FUNCTION (gsl_matrix, get_row) (v, m, i);
120 for (j = 0; j < N; j++)
123 if (v->data[j] != (BASE) k)
128 gsl_test (status, NAME (gsl_matrix) "_get_row extracts row");
132 BASE exp_max = FUNCTION(gsl_matrix, get) (m, 0, 0);
133 BASE exp_min = FUNCTION(gsl_matrix, get) (m, 0, 0);
134 size_t exp_imax = 0, exp_jmax = 0, exp_imin = 0, exp_jmin = 0;
136 for (i = 0; i < M; i++)
138 for (j = 0; j < N; j++)
140 BASE k = FUNCTION(gsl_matrix, get) (m, i, j);
142 exp_max = FUNCTION(gsl_matrix, get) (m, i, j);
147 exp_min = FUNCTION(gsl_matrix, get) (m, i, j);
155 BASE max = FUNCTION(gsl_matrix, max) (m) ;
157 gsl_test (max != exp_max, NAME(gsl_matrix) "_max returns correct maximum value");
161 BASE min = FUNCTION(gsl_matrix, min) (m) ;
163 gsl_test (min != exp_min, NAME(gsl_matrix) "_min returns correct minimum value");
168 FUNCTION(gsl_matrix, minmax) (m, &min, &max);
170 gsl_test (max != exp_max, NAME(gsl_matrix) "_minmax returns correct maximum value");
171 gsl_test (min != exp_min, NAME(gsl_matrix) "_minmax returns correct minimum value");
177 FUNCTION(gsl_matrix, max_index) (m, &imax, &jmax) ;
179 gsl_test (imax != exp_imax, NAME(gsl_matrix) "_max_index returns correct maximum i");
180 gsl_test (jmax != exp_jmax, NAME(gsl_matrix) "_max_index returns correct maximum j");
185 FUNCTION(gsl_matrix, min_index) (m, &imin, &jmin) ;
187 gsl_test (imin != exp_imin, NAME(gsl_matrix) "_min_index returns correct minimum i");
188 gsl_test (jmin != exp_jmin, NAME(gsl_matrix) "_min_index returns correct minimum j");
192 size_t imin, jmin, imax, jmax;
194 FUNCTION(gsl_matrix, minmax_index) (m, &imin, &jmin, &imax, &jmax);
196 gsl_test (imax != exp_imax, NAME(gsl_matrix) "_minmax_index returns correct maximum i");
197 gsl_test (jmax != exp_jmax, NAME(gsl_matrix) "_minmax_index returns correct maximum j");
199 gsl_test (imin != exp_imin, NAME(gsl_matrix) "_minmax_index returns correct minimum i");
200 gsl_test (jmin != exp_jmin, NAME(gsl_matrix) "_minmax_index returns correct minimum j");
204 FUNCTION(gsl_matrix,set)(m, 2, 3, GSL_NAN);
205 exp_min = GSL_NAN; exp_max = GSL_NAN;
206 exp_imin = 2; exp_jmin = 3;
207 exp_imax = 2; exp_jmax = 3;
210 BASE max = FUNCTION(gsl_matrix, max) (m) ;
212 gsl_test_abs (max,exp_max, 0, NAME(gsl_matrix) "_max returns correct maximum value for NaN");
216 BASE min = FUNCTION(gsl_matrix, min) (m) ;
218 gsl_test_abs (min, exp_min, 0, NAME(gsl_matrix) "_min returns correct minimum value for NaN");
223 FUNCTION(gsl_matrix, minmax) (m, &min, &max);
225 gsl_test_abs (max, exp_max, 0, NAME(gsl_matrix) "_minmax returns correct maximum value for NaN");
226 gsl_test_abs (min, exp_min, 0, NAME(gsl_matrix) "_minmax returns correct minimum value for NaN");
232 FUNCTION(gsl_matrix, max_index) (m, &imax, &jmax) ;
234 gsl_test (imax != exp_imax, NAME(gsl_matrix) "_max_index returns correct maximum i for NaN");
235 gsl_test (jmax != exp_jmax, NAME(gsl_matrix) "_max_index returns correct maximum j for NaN");
240 FUNCTION(gsl_matrix, min_index) (m, &imin, &jmin) ;
242 gsl_test (imin != exp_imin, NAME(gsl_matrix) "_min_index returns correct minimum i for NaN");
243 gsl_test (jmin != exp_jmin, NAME(gsl_matrix) "_min_index returns correct minimum j for NaN");
247 size_t imin, jmin, imax, jmax;
249 FUNCTION(gsl_matrix, minmax_index) (m, &imin, &jmin, &imax, &jmax);
251 gsl_test (imax != exp_imax, NAME(gsl_matrix) "_minmax_index returns correct maximum i for NaN");
252 gsl_test (jmax != exp_jmax, NAME(gsl_matrix) "_minmax_index returns correct maximum j for NaN");
254 gsl_test (imin != exp_imin, NAME(gsl_matrix) "_minmax_index returns correct minimum i for NaN");
255 gsl_test (jmin != exp_jmin, NAME(gsl_matrix) "_minmax_index returns correct minimum j for NaN");
263 for (i = 0; i < M; i++)
265 for (j = 0; j < N; j++)
267 FUNCTION (gsl_matrix, set) (m, i, j, (ATOMIC) 0);
272 status = (FUNCTION(gsl_matrix,isnull)(m) != 1);
273 TEST (status, "_isnull" DESC " on null matrix") ;
275 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
276 TEST (status, "_ispos" DESC " on null matrix") ;
278 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
279 TEST (status, "_isneg" DESC " on null matrix") ;
281 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 1);
282 TEST (status, "_isnonneg" DESC " on null matrix") ;
287 for (i = 0; i < M; i++)
289 for (j = 0; j < N; j++)
292 FUNCTION (gsl_matrix, set) (m, i, j, (ATOMIC) (k % 10));
297 status = (FUNCTION(gsl_matrix,isnull)(m) != 0);
298 TEST (status, "_isnull" DESC " on non-negative matrix") ;
300 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
301 TEST (status, "_ispos" DESC " on non-negative matrix") ;
303 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
304 TEST (status, "_isneg" DESC " on non-negative matrix") ;
306 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 1);
307 TEST (status, "_isnonneg" DESC " on non-negative matrix") ;
312 for (i = 0; i < M; i++)
314 for (j = 0; j < N; j++)
316 ATOMIC mij = ((++k) % 10) - (ATOMIC) 5;
317 FUNCTION (gsl_matrix, set) (m, i, j, mij);
322 status = (FUNCTION(gsl_matrix,isnull)(m) != 0);
323 TEST (status, "_isnull" DESC " on mixed matrix") ;
325 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
326 TEST (status, "_ispos" DESC " on mixed matrix") ;
328 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
329 TEST (status, "_isneg" DESC " on mixed matrix") ;
331 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 0);
332 TEST (status, "_isnonneg" DESC " on mixed matrix") ;
336 for (i = 0; i < M; i++)
338 for (j = 0; j < N; j++)
341 FUNCTION (gsl_matrix, set) (m, i, j, -(ATOMIC) (k % 10));
346 status = (FUNCTION(gsl_matrix,isnull)(m) != 0);
347 TEST (status, "_isnull" DESC " on non-positive matrix") ;
349 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
350 TEST (status, "_ispos" DESC " on non-positive matrix") ;
352 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
353 TEST (status, "_isneg" DESC " on non-positive matrix") ;
355 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 0);
356 TEST (status, "_isnonneg" DESC " on non-positive matrix") ;
361 for (i = 0; i < M; i++)
363 for (j = 0; j < N; j++)
366 FUNCTION (gsl_matrix, set) (m, i, j, (ATOMIC) (k % 10 + 1));
371 status = (FUNCTION(gsl_matrix,isnull)(m) != 0);
372 TEST (status, "_isnull" DESC " on positive matrix") ;
374 status = (FUNCTION(gsl_matrix,ispos)(m) != 1);
375 TEST (status, "_ispos" DESC " on positive matrix") ;
377 status = (FUNCTION(gsl_matrix,isneg)(m) != 0);
378 TEST (status, "_isneg" DESC " on positive matrix") ;
380 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 1);
381 TEST (status, "_isnonneg" DESC " on positive matrix") ;
384 #if (!defined(UNSIGNED) && !defined(BASE_CHAR))
386 for (i = 0; i < M; i++)
388 for (j = 0; j < N; j++)
391 FUNCTION (gsl_matrix, set) (m, i, j, -(ATOMIC) (k % 10 + 1));
396 status = (FUNCTION(gsl_matrix,isnull)(m) != 0);
397 TEST (status, "_isnull" DESC " on negative matrix") ;
399 status = (FUNCTION(gsl_matrix,ispos)(m) != 0);
400 TEST (status, "_ispos" DESC " on negative matrix") ;
402 status = (FUNCTION(gsl_matrix,isneg)(m) != 1);
403 TEST (status, "_isneg" DESC " on negative matrix") ;
405 status = (FUNCTION(gsl_matrix,isnonneg)(m) != 0);
406 TEST (status, "_isnonneg" DESC " on negative matrix") ;
411 TYPE (gsl_matrix) * a = FUNCTION (gsl_matrix, calloc) (M, N);
412 TYPE (gsl_matrix) * b = FUNCTION (gsl_matrix, calloc) (M, N);
414 for (i = 0; i < M; i++)
416 for (j = 0; j < N; j++)
418 FUNCTION (gsl_matrix, set) (a, i, j, (BASE)(3 + i + 5 * j));
419 FUNCTION (gsl_matrix, set) (b, i, j, (BASE)(3 + 2 * i + 4 * j));
423 FUNCTION(gsl_matrix, memcpy) (m, a);
424 FUNCTION(gsl_matrix, add) (m, b);
429 for (i = 0; i < M; i++)
431 for (j = 0; j < N; j++)
433 BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
434 BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
435 BASE y = FUNCTION(gsl_matrix,get) (b,i,j);
441 gsl_test (status, NAME (gsl_matrix) "_add matrix addition");
445 FUNCTION(gsl_matrix, memcpy) (m, a);
446 FUNCTION(gsl_matrix, sub) (m, b);
451 for (i = 0; i < M; i++)
453 for (j = 0; j < N; j++)
455 BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
456 BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
457 BASE y = FUNCTION(gsl_matrix,get) (b,i,j);
463 gsl_test (status, NAME (gsl_matrix) "_sub matrix subtraction");
466 FUNCTION(gsl_matrix, memcpy) (m, a);
467 FUNCTION(gsl_matrix, mul_elements) (m, b);
472 for (i = 0; i < M; i++)
474 for (j = 0; j < N; j++)
476 BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
477 BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
478 BASE y = FUNCTION(gsl_matrix,get) (b,i,j);
484 gsl_test (status, NAME (gsl_matrix) "_mul_elements multiplication");
487 FUNCTION(gsl_matrix, memcpy) (m, a);
488 FUNCTION(gsl_matrix, div_elements) (m, b);
493 for (i = 0; i < M; i++)
495 for (j = 0; j < N; j++)
497 BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
498 BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
499 BASE y = FUNCTION(gsl_matrix,get) (b,i,j);
501 if (fabs(r - z) > 2 * GSL_FLT_EPSILON * fabs(z))
505 gsl_test (status, NAME (gsl_matrix) "_div_elements division");
509 FUNCTION(gsl_matrix, free) (a);
510 FUNCTION(gsl_matrix, free) (b);
514 FUNCTION (gsl_matrix, free) (m);
515 FUNCTION (gsl_vector, free) (v);
518 #if !(USES_LONGDOUBLE && !HAVE_PRINTF_LONGDOUBLE)
520 FUNCTION (test, text) (void)
522 TYPE (gsl_matrix) * m = FUNCTION (gsl_matrix, alloc) (M, N);
528 FILE *f = fopen ("test.txt", "w");
530 for (i = 0; i < M; i++)
532 for (j = 0; j < N; j++)
535 FUNCTION (gsl_matrix, set) (m, i, j, (BASE) k);
539 FUNCTION (gsl_matrix, fprintf) (f, m, OUT_FORMAT);
544 FILE *f = fopen ("test.txt", "r");
545 TYPE (gsl_matrix) * mm = FUNCTION (gsl_matrix, alloc) (M, N);
548 FUNCTION (gsl_matrix, fscanf) (f, mm);
550 for (i = 0; i < M; i++)
552 for (j = 0; j < N; j++)
555 if (mm->data[i * N + j] != (BASE) k)
560 gsl_test (status, NAME (gsl_matrix) "_fprintf and fscanf");
563 FUNCTION (gsl_matrix, free) (mm);
566 FUNCTION (gsl_matrix, free) (m);
571 FUNCTION (test, binary) (void)
573 TYPE (gsl_matrix) * m = FUNCTION (gsl_matrix, calloc) (M, N);
579 FILE *f = fopen ("test.dat", "wb");
581 for (i = 0; i < M; i++)
583 for (j = 0; j < N; j++)
586 FUNCTION (gsl_matrix, set) (m, i, j, (BASE) k);
590 FUNCTION (gsl_matrix, fwrite) (f, m);
595 FILE *f = fopen ("test.dat", "rb");
596 TYPE (gsl_matrix) * mm = FUNCTION (gsl_matrix, alloc) (M, N);
599 FUNCTION (gsl_matrix, fread) (f, mm);
601 for (i = 0; i < M; i++)
603 for (j = 0; j < N; j++)
606 if (mm->data[i * N + j] != (BASE) k)
611 gsl_test (status, NAME (gsl_matrix) "_write and read");
614 FUNCTION (gsl_matrix, free) (mm);
617 FUNCTION (gsl_matrix, free) (m);
621 FUNCTION (test, trap) (void)
623 TYPE (gsl_matrix) * m = FUNCTION (gsl_matrix, alloc) (M, N);
629 FUNCTION (gsl_matrix, set) (m, M + 1, 0, (BASE) 1.2);
631 NAME (gsl_matrix) "_set traps 1st index above upper bound");
634 FUNCTION (gsl_matrix, set) (m, 0, N + 1, (BASE) 1.2);
636 NAME (gsl_matrix) "_set traps 2nd index above upper bound");
639 FUNCTION (gsl_matrix, set) (m, M, 0, (BASE) 1.2);
641 NAME (gsl_matrix) "_set traps 1st index at upper bound");
644 FUNCTION (gsl_matrix, set) (m, 0, N, (BASE) 1.2);
646 NAME (gsl_matrix) "_set traps 2nd index at upper bound");
649 x = FUNCTION (gsl_matrix, get) (m, i - 1, 0);
651 NAME (gsl_matrix) "_get traps 1st index below lower bound");
653 NAME (gsl_matrix) "_get returns zero for 1st index below lower bound");
656 x = FUNCTION (gsl_matrix, get) (m, 0, j - 1);
658 NAME (gsl_matrix) "_get traps 2nd index below lower bound");
660 NAME (gsl_matrix) "_get returns zero for 2nd index below lower bound");
663 x = FUNCTION (gsl_matrix, get) (m, M + 1, 0);
665 NAME (gsl_matrix) "_get traps 1st index above upper bound");
667 NAME (gsl_matrix) "_get returns zero for 1st index above upper bound");
670 x = FUNCTION (gsl_matrix, get) (m, 0, N + 1);
672 NAME (gsl_matrix) "_get traps 2nd index above upper bound");
674 NAME (gsl_matrix) "_get returns zero for 2nd index above upper bound");
677 x = FUNCTION (gsl_matrix, get) (m, M, 0);
679 NAME (gsl_matrix) "_get traps 1st index at upper bound");
681 NAME (gsl_matrix) "_get returns zero for 1st index at upper bound");
684 x = FUNCTION (gsl_matrix, get) (m, 0, N);
686 NAME (gsl_matrix) "_get traps 2nd index at upper bound");
688 NAME (gsl_matrix) "_get returns zero for 2nd index at upper bound");
690 FUNCTION (gsl_matrix, free) (m);