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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
|
// test_array.cc -- test driver for array.hh classes
// $Id$
#include <assert.h>
#include <stdio.h>
#include <math.h>
#include "jt/stdc.h"
#include "jt/util++.hh"
#include "jt/array.hh"
//
// prototypes for non-class functions defined in this file
//
void test_array1d_double(bool print_flag);
void test_array2d_float(bool print_flag);
void test_array3d_double(bool print_flag);
void test_array4d_double(bool print_flag);
//*****************************************************************************
//
// Usage:
// test_array [ print ]
// If an argument is supplied (it doesn't matter what it is), then
// the array indices will be printed as they're tested.
//
int main(int argc, const char* const argv[])
{
const bool print_flag = (argc > 1);
test_array1d_double(print_flag);
test_array2d_float(print_flag);
test_array3d_double(print_flag);
test_array4d_double(print_flag);
}
//*****************************************************************************
//
// This function tests the array1d<double> class.
//
void test_array1d_double(bool print_flag)
{
const int min_i = 11; const int max_i = 13;
const double delta = 1.0/7.0;
const double change_value = 144.025036146;
printf("\ntesting array1d<double>...\n");
printf("constructing...\n");
array1d<double> A(min_i, max_i);
assert(A.min_i() == min_i); assert(A.max_i() == max_i);
assert(A.N_i() == jtutil::how_many_in_range(min_i,max_i));
printf("assigning values...\n");
#define VALUE_1D(ix) \
double(1000.0 + ix + delta)
for (int i = min_i ; i <= max_i ; ++i)
{
if (print_flag)
then printf(" assigning %d\n", i);
A(i) = VALUE_1D(i);
}
printf("checking N-D vs 1-D addresses...\n");
int sub = 0;
const double* array_ptr = A.get_array();
for (int i = min_i ; i <= max_i ; ++i)
{
if (print_flag)
then printf(" checking %d\n", i);
assert( &A(i) == &array_ptr[sub++] );
}
assert(sub == A.N_array());
printf("checking which things change when we assign an array element...\n");
double sumsq_of_diff = 0.0;
for (int i = min_i ; i <= max_i ; ++i)
{
if (print_flag)
then printf(" changing %d\n", i);
double save_a = A(i);
A(i) = change_value;
for (int ii = min_i ; ii <= max_i ; ++ii)
{
if (print_flag)
then printf(" checking %d\n", ii);
double should_be = (ii == i) ? change_value : VALUE_1D(ii);
assert( fuzzy<double>::EQ(A(ii), should_be) );
double diff = A(ii) - should_be;
sumsq_of_diff += diff*diff;
}
A(i) = save_a;
}
double RMS_diff = sqrt(sumsq_of_diff / A.N_array());
printf("==> everything looks ok (RMS_diff=%.3g)\n", RMS_diff);
}
//*****************************************************************************
//
// This function tests the array2d<float> class.
//
void test_array2d_float(bool print_flag)
{
const int min_i = 11; const int max_i = 13;
const int min_j = 21; const int max_j = 24;
const float delta = 1.0/7.0;
const float change_value = 144.025036146;
printf("\ntesting array2d<float>...\n");
printf("constructing...\n");
array2d<float> A(min_i,max_i, min_j,max_j);
assert(A.min_i() == min_i); assert(A.max_i() == max_i);
assert(A.min_j() == min_j); assert(A.max_j() == max_j);
assert(A.N_i() == jtutil::how_many_in_range(min_i,max_i));
assert(A.N_j() == jtutil::how_many_in_range(min_j,max_j));
printf("assigning values...\n");
#define VALUE_2D(ix,jx) \
float(1000.0 + 10.0*jx + ix + delta)
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
if (print_flag)
then printf(" assigning %d %d\n", i, j);
A(i,j) = VALUE_2D(i,j);
}
}
printf("checking N-D vs 1-D addresses...\n");
int sub = 0;
const float* array_ptr = A.get_array();
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
if (print_flag)
then printf(" checking %d %d\n", i, j);
assert( &A(i,j) == &array_ptr[sub++] );
}
}
assert(sub == A.N_array());
printf("checking which things change when we assign an array element...\n");
double sumsq_of_diff = 0.0;
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
if (print_flag)
then printf(" changing %d %d\n", i, j);
float save_a = A(i,j);
A(i,j) = change_value;
for (int ii = min_i ; ii <= max_i ; ++ii)
{
for (int jj = min_j ; jj <= max_j ; ++jj)
{
if (print_flag)
then printf(" checking %d %d\n", ii, jj);
float should_be = ((ii == i) && (jj == j))
? change_value : VALUE_2D(ii,jj);
assert( fuzzy<float>::EQ(A(ii,jj), should_be) );
double diff = A(ii,jj) - should_be;
sumsq_of_diff += diff*diff;
}
}
A(i,j) = save_a;
}
}
float RMS_diff = sqrt(sumsq_of_diff / A.N_array());
printf("==> everything looks ok (RMS_diff=%.3g)\n", double(RMS_diff));
}
//*****************************************************************************
//
// This function tests the array3d<double> class.
//
void test_array3d_double(bool print_flag)
{
const int min_i = 11; const int max_i = 13;
const int min_j = 21; const int max_j = 24;
const int min_k = 31; const int max_k = 35;
const double delta = 1.0/7.0;
const double change_value = 144.025036146;
printf("\ntesting array3d<double>...\n");
printf("constructing...\n");
array3d<double> A(min_i,max_i, min_j,max_j, min_k,max_k);
assert(A.min_i() == min_i); assert(A.max_i() == max_i);
assert(A.min_j() == min_j); assert(A.max_j() == max_j);
assert(A.min_k() == min_k); assert(A.max_k() == max_k);
assert(A.N_i() == jtutil::how_many_in_range(min_i,max_i));
assert(A.N_j() == jtutil::how_many_in_range(min_j,max_j));
assert(A.N_k() == jtutil::how_many_in_range(min_k,max_k));
printf("assigning values...\n");
#define VALUE_3D(ix,jx,kx) \
double(1000.0 + 100.0*kx + 10.0*jx + ix + delta)
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
if (print_flag)
then printf(" assigning %d %d %d\n", i, j, k);
A(i,j,k) = VALUE_3D(i,j,k);
}
}
}
printf("checking N-D vs 1-D addresses...\n");
int sub = 0;
const double* array_ptr = A.get_array();
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
if (print_flag)
then printf(" checking %d %d %d\n", i, j, k);
assert( &A(i,j,k) == &array_ptr[sub++] );
}
}
}
assert(sub == A.N_array());
printf("checking which things change when we assign an array element...\n");
double sumsq_of_diff = 0.0;
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
if (print_flag)
then printf(" changing %d %d %d\n", i, j, k);
double save_a = A(i,j,k);
A(i,j,k) = change_value;
for (int ii = min_i ; ii <= max_i ; ++ii)
{
for (int jj = min_j ; jj <= max_j ; ++jj)
{
for (int kk = min_k ; kk <= max_k ; ++kk)
{
if (print_flag)
then printf(" checking %d %d %d\n", ii, jj, kk);
double should_be = ((ii == i) && (jj == j) && (kk == k))
? change_value : VALUE_3D(ii,jj,kk);
assert( fuzzy<double>::EQ(A(ii,jj,kk), should_be) );
double diff = A(ii,jj,kk) - should_be;
sumsq_of_diff += diff*diff;
}
}
}
A(i,j,k) = save_a;
}
}
}
double RMS_diff = sqrt(sumsq_of_diff / A.N_array());
printf("==> everything looks ok (RMS_diff=%.3g)\n", RMS_diff);
}
//*****************************************************************************
//
// This function tests the array4d<double> class.
//
void test_array4d_double(bool print_flag)
{
const int min_i = 11; const int max_i = 13;
const int min_j = 21; const int max_j = 24;
const int min_k = 31; const int max_k = 35;
const int min_l = 41; const int max_l = 46;
const double delta = 1.0/7.0;
const double change_value = 144.025036146;
printf("\ntesting array4d<double>...\n");
printf("constructing...\n");
array4d<double> A(min_i,max_i, min_j,max_j, min_k,max_k, min_l,max_l);
assert(A.min_i() == min_i); assert(A.max_i() == max_i);
assert(A.min_j() == min_j); assert(A.max_j() == max_j);
assert(A.min_k() == min_k); assert(A.max_k() == max_k);
assert(A.min_l() == min_l); assert(A.max_l() == max_l);
assert(A.N_i() == jtutil::how_many_in_range(min_i,max_i));
assert(A.N_j() == jtutil::how_many_in_range(min_j,max_j));
assert(A.N_k() == jtutil::how_many_in_range(min_k,max_k));
assert(A.N_l() == jtutil::how_many_in_range(min_l,max_l));
printf("assigning values...\n");
#define VALUE_4D(ix,jx,kx,lx) \
double(10000.0 + 1000.0*kx + 100.0*jx + 10.0*ix + lx + delta)
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
for (int l = min_l ; l <= max_l ; ++l)
{
if (print_flag)
then printf(" assigning %d %d %d %d\n", i, j, k, l);
A(i,j,k,l) = VALUE_4D(i,j,k,l);
}
}
}
}
printf("checking N-D vs 1-D addresses...\n");
int sub = 0;
const double* array_ptr = A.get_array();
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
for (int l = min_l ; l <= max_l ; ++l)
{
if (print_flag)
then printf(" checking %d %d %d %d\n", i, j, k, l);
assert( &A(i,j,k,l) == &array_ptr[sub++] );
}
}
}
}
assert(sub == A.N_array());
printf("checking which things change when we assign an array element...\n");
double sumsq_of_diff = 0.0;
for (int i = min_i ; i <= max_i ; ++i)
{
for (int j = min_j ; j <= max_j ; ++j)
{
for (int k = min_k ; k <= max_k ; ++k)
{
for (int l = min_l ; l <= max_l ; ++l)
{
if (print_flag)
then printf(" changing %d %d %d %d\n", i, j, k, l);
double save_a = A(i,j,k,l);
A(i,j,k,l) = change_value;
for (int ii = min_i ; ii <= max_i ; ++ii)
{
for (int jj = min_j ; jj <= max_j ; ++jj)
{
for (int kk = min_k ; kk <= max_k ; ++kk)
{
for (int ll = min_l ; ll <= max_l ; ++ll)
{
if (print_flag)
then printf(" checking %d %d %d %d\n", ii, jj, kk, ll);
double should_be = ((ii == i) && (jj == j)
&& (kk == k) && (ll == l))
? change_value : VALUE_4D(ii,jj,kk,ll);
assert( fuzzy<double>::EQ(A(ii,jj,kk,ll), should_be) );
double diff = A(ii,jj,kk,ll) - should_be;
sumsq_of_diff += diff*diff;
}
}
}
}
A(i,j,k,l) = save_a;
}
}
}
}
double RMS_diff = sqrt(sumsq_of_diff / A.N_array());
printf("==> everything looks ok (RMS_diff=%.3g)\n", RMS_diff);
}
|
