forked from UCL/STIR
-
Notifications
You must be signed in to change notification settings - Fork 2
/
test_Array.cxx
1042 lines (931 loc) · 37.8 KB
/
test_Array.cxx
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
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright (C) 2000 PARAPET partners
Copyright (C) 2000-2011, Hammersmith Imanet Ltd
Copyright (C) 2013 Kris Thielemans
Copyright (C) 2013, 2020, 2023 University College London
This file is part of STIR.
SPDX-License-Identifier: Apache-2.0 AND License-ref-PARAPET-license
See STIR/LICENSE.txt for details
*/
/*!
\file
\ingroup test
\ingroup Array
\brief tests for the stir::Array class
\author Kris Thielemans
\author PARAPET project
*/
#ifndef NDEBUG
// set to high level of debugging
#ifdef _DEBUG
#undef _DEBUG
#endif
#define _DEBUG 2
#endif
#include "stir/Array.h"
#include "stir/make_array.h"
#include "stir/Coordinate2D.h"
#include "stir/Coordinate3D.h"
#include "stir/Coordinate4D.h"
#include "stir/convert_array.h"
#include "stir/Succeeded.h"
#include "stir/IO/write_data.h"
#include "stir/IO/read_data.h"
#include "stir/RunTests.h"
#include "stir/ArrayFunction.h"
#include "stir/array_index_functions.h"
#include <functional>
// for open_read/write_binary
#include "stir/utilities.h"
#include "stir/HighResWallClockTimer.h"
#include <stdio.h>
#include <fstream>
#include <sstream>
#include <boost/format.hpp>
#ifndef STIR_NO_NAMESPACES
using std::ofstream;
using std::ifstream;
using std::plus;
using std::cerr;
using std::endl;
#endif
START_NAMESPACE_STIR
namespace detail {
static Array<2,float> test_make_array()
{
return
make_array(make_1d_array(1.F,0.F,0.F),
make_1d_array(0.F,1.F,1.F),
make_1d_array(0.F,-2.F,2.F));
}
}
/*!
\brief Tests Array functionality
\ingroup test
\warning Running this will create and delete 2 files with names
output.flt and output.other. Existing files with these names will be overwritten.
*/
class ArrayTests : public RunTests
{
private:
// this function tests the next() function and compare it to using full_iterators
// sadly needs to be declared in the class for VC 6.0
template <int num_dimensions, class elemT>
void
run_tests_on_next(const Array<num_dimensions, elemT>& test)
{
// exit if empty array (as do..while() loop would fail)
if (test.size() == 0)
return;
BasicCoordinate<num_dimensions,elemT> index = get_min_indices(test);
typename Array<num_dimensions, elemT>::const_full_iterator iter = test.begin_all();
do
{
check(*iter == test[index], "test on next(): element out of sequence?");
++iter;
}
while (next(index, test) && (iter != test.end_all()));
check (iter == test.end_all(), "test on next() : did we cover all elements?");
}
// functions that runs IO tests for an array of arbitrary dimension
// sadly needs to be declared in the class for VC 6.0
template <int num_dimensions, typename elemT>
void run_IO_tests(const Array<num_dimensions, elemT>&t1)
{
std::fstream os;
std::fstream is;
run_IO_tests_with_file_args(os, is, t1);
FILE* ofptr;
FILE* ifptr;
run_IO_tests_with_file_args(ofptr, is, t1);
run_IO_tests_with_file_args(ofptr, ifptr, t1);
}
template <int num_dimensions, typename elemT,class OFSTREAM, class IFSTREAM>
void run_IO_tests_with_file_args(OFSTREAM& os, IFSTREAM& is, const Array<num_dimensions, elemT>&t1)
{
{
open_write_binary(os, "output.flt");
check(write_data(os,t1)==Succeeded::yes, "write_data could not write array");
close_file(os);
}
Array<num_dimensions,elemT> t2(t1.get_index_range());
{
open_read_binary(is, "output.flt");
check(read_data(is,t2)==Succeeded::yes, "read_data could not read from output.flt");
close_file(is);
}
check_if_equal(t1 ,t2, "test out/in" );
remove("output.flt");
{
open_write_binary(os, "output.flt");
const Array<num_dimensions, elemT> copy=t1;
check(write_data(os,t1,ByteOrder::swapped)==Succeeded::yes, "write_data could not write array with swapped byte order");
check_if_equal(t1 ,copy, "test out with byte-swapping didn't change the array" );
close_file(os);
}
{
open_read_binary(is, "output.flt");
check(read_data(is,t2,ByteOrder::swapped)==Succeeded::yes, "read_data could not read from output.flt");
close_file(is);
}
check_if_equal(t1 ,t2, "test out/in (swapped byte order)" );
remove("output.flt");
cerr <<"\tTests writing as shorts\n";
run_IO_tests_mixed(os, is, t1, NumericInfo<short>());
cerr <<"\tTests writing as floats\n";
run_IO_tests_mixed(os, is, t1, NumericInfo<float>());
cerr <<"\tTests writing as signed chars\n";
run_IO_tests_mixed(os, is, t1, NumericInfo<signed char>());
/* check on failed IO.
Note: needs to be after the others, as we would have to call os.clear()
for ostream to be able to write again, but that's not defined for FILE*.
*/
{
const Array<num_dimensions, elemT> copy=t1;
cerr << "\n\tYou should now see a warning that writing failed. That's by intention.\n";
check(write_data(os,t1,ByteOrder::swapped)!=Succeeded::yes, "write_data with swapped byte order should have failed");
check_if_equal(t1 ,copy, "test out with byte-swapping didn't change the array even with failed IO" );
}
}
//! function that runs IO tests with mixed types for array of arbitrary dimension
// sadly needs to be implemented in the class for VC 6.0
template <int num_dimensions, typename elemT, class OFSTREAM, class IFSTREAM, class output_type>
void run_IO_tests_mixed(OFSTREAM& os, IFSTREAM& is, const Array<num_dimensions, elemT>&orig, NumericInfo<output_type> output_type_info)
{
{
open_write_binary(os, "output.orig");
elemT scale(1);
check(write_data(os, orig, NumericInfo<elemT>(), scale)==Succeeded::yes, "write_data could not write array in original data type");
close_file(os);
check_if_equal(scale ,static_cast<elemT>(1), "test out/in: data written in original data type: scale factor should be 1" );
}
elemT scale(1);
bool write_data_ok;
{
ofstream os;
open_write_binary(os, "output.other");
write_data_ok=check(write_data(os,orig, output_type_info, scale)==Succeeded::yes, "write_data could not write array as other_type");
close_file(os);
}
if (write_data_ok)
{
// only do reading test if data was written
Array<num_dimensions,output_type> data_read_back(orig.get_index_range());
{
open_read_binary(is, "output.other");
check(read_data(is, data_read_back)==Succeeded::yes, "read_data could not read from output.other");
close_file(is);
remove("output.other");
}
// compare with convert()
{
float newscale = static_cast<float>(scale);
Array<num_dimensions,output_type> origconverted =
convert_array(newscale, orig, NumericInfo<output_type>());
check_if_equal(newscale ,scale, "test read_data <-> convert : scale factor ");
check_if_equal(origconverted ,data_read_back, "test read_data <-> convert : data");
}
// compare orig/scale with data_read_back
{
const Array<num_dimensions,elemT> orig_scaled(orig/scale);
this->check_array_equality_with_rounding(orig_scaled, data_read_back,
"test out/in: data written as other_type, read as other_type");
}
// compare data written as original, but read as other_type
{
Array<num_dimensions,output_type> data_read_back2(orig.get_index_range());
ifstream is;
open_read_binary(is, "output.orig");
elemT in_scale = 0;
check(read_data(is, data_read_back2, NumericInfo<elemT>(), in_scale)==Succeeded::yes, "read_data could not read from output.orig");
// compare orig/in_scale with data_read_back2
const Array<num_dimensions,elemT> orig_scaled(orig/in_scale);
this->check_array_equality_with_rounding(orig_scaled, data_read_back2,
"test out/in: data written as original_type, read as other_type");
}
} // end of if(write_data_ok)
remove("output.orig");
}
//! a special version of check_if_equal just for this class
/*! we check up to .5 if output_type is integer, and up to tolerance otherwise
*/
template <int num_dimensions, typename elemT, class output_type>
bool check_array_equality_with_rounding(const Array<num_dimensions,elemT>& orig, const Array<num_dimensions,output_type>& data_read_back, const char*const message)
{
NumericInfo<output_type> output_type_info;
bool test_failed=false;
typename Array<num_dimensions,elemT>::const_full_iterator diff_iter = orig.begin_all();
typename Array<num_dimensions,output_type>::const_full_iterator data_read_back_iter = data_read_back.begin_all_const();
while(diff_iter!=orig.end_all())
{
if (output_type_info.integer_type())
{
std::stringstream full_message;
// construct useful error message even though we use a boolean check
full_message << boost::format("unequal values are %2% and %3%. %1%: difference larger than .5")
% message % static_cast<elemT>(*data_read_back_iter) % *diff_iter;
// difference should be maximum .5 (but we test with slightly larger tolerance to accomodate numerical precision)
test_failed = check(fabs(*diff_iter - *data_read_back_iter)<=.502,
full_message.str().c_str());
}
else
{
std::string full_message = message;
full_message += ": difference larger than tolerance";
test_failed = check_if_equal(static_cast<elemT>(*data_read_back_iter), *diff_iter,
full_message.c_str());
}
if (test_failed)
break;
diff_iter++; data_read_back_iter++;
}
return test_failed;
}
public:
void run_tests();
};
void
ArrayTests::run_tests()
{
cerr << "Testing Array classes\n";
{
cerr << "Testing 1D stuff" << endl;
{
Array<1,int> testint(IndexRange<1>(5));
testint[0] = 2;
check_if_equal(testint.size(), size_t(5), "test size()");
check_if_equal(testint.size_all(), size_t(5), "test size_all()");
Array<1,float> test(IndexRange<1>(10));
check_if_zero(test, "Array1D not initialised to 0");
test[1] = (float)10.5;
test.set_offset(-1);
check_if_equal(test.size(), size_t(10), "test size() with non-zero offset");
check_if_equal(test.size_all(), size_t(10), "test size_all() with non-zero offset");
check_if_equal( test[0], 10.5F, "test indexing of Array1D");
test += 1;
check_if_equal( test[0] , 11.5F, "test operator+=(float)");
check_if_equal( test.sum(), 20.5F, "test operator+=(float) and sum()");
check_if_zero( test - test, "test operator-(Array1D)");
BasicCoordinate<1,int> c;
c[1]=0;
check_if_equal(test[c] , 11.5F , "test operator[](BasicCoordinate)");
test[c] = 12.5;
check_if_equal(test[c] , 12.5F , "test operator[](BasicCoordinate)");
{
Array<1,float> ref(-1,2);
ref[-1]=1.F;ref[0]=3.F;ref[1]=3.14F;
Array<1,float> test = ref;
test += 1;
for (int i=ref.get_min_index(); i<= ref.get_max_index(); ++i)
check_if_equal( test[i] , ref[i]+1, "test operator+=(float)");
test = ref; test -= 4;
for (int i=ref.get_min_index(); i<= ref.get_max_index(); ++i)
check_if_equal( test[i] , ref[i]-4, "test operator-=(float)");
test = ref; test *= 3;
for (int i=ref.get_min_index(); i<= ref.get_max_index(); ++i)
check_if_equal( test[i] , ref[i]*3, "test operator*=(float)");
test = ref; test /= 3;
for (int i=ref.get_min_index(); i<= ref.get_max_index(); ++i)
check_if_equal( test[i] , ref[i]/3, "test operator/=(float)");
}
{
Array<1,float> test2;
test2 = test * 2;
check_if_equal( 2*test[0] , test2[0], "test operator*(float)");
}
{
Array<1,float> test2 = test;
test.grow(-2,test.get_max_index());
Array<1,float> test3 = test2 + test;
check_if_zero(test3[-2], "test growing during operator+");
}
// using preallocated memory
{
std::vector<float> mem(test.get_index_range().size_all());
std::copy(test.begin_all_const(), test.end_all_const(), mem.begin());
Array<1,float> preallocated;
preallocated.init(test.get_index_range(), &mem[0], false);
check(!preallocated.owns_memory_for_data(), "test preallocated without copy: should not own memory");
check_if_equal(test, preallocated, "test preallocated: equality");
std::copy(test.begin_all_const(), test.end_all_const(), preallocated.begin_all());
check_if_equal(test, preallocated, "test preallocated: copy with full_iterator");
check(test.is_contiguous(), "test Array1D is contiguous");
check(preallocated.is_contiguous(), "test Array1D is contiguous (preallocated)");
check(preallocated.get_full_data_ptr() == &mem[0], "test Array1D preallocated pointer access");
preallocated.release_full_data_ptr();
check(preallocated.get_const_full_data_ptr() == &mem[0], "test Array1D preallocated const pointer access");
preallocated.release_const_full_data_ptr();
// test memory is shared between the Array and mem
mem[0]=*test.begin() + 345;
check_if_equal(*preallocated.begin(), mem[0], "test preallocated: direct buffer mod");
*(preallocated.begin()+1) += 4;
check_if_equal(*(preallocated.begin()+1), mem[1], "test preallocated: indirect buffer mod");
// test resize
{
const auto min = preallocated.get_min_index();
const auto max = preallocated.get_max_index();
// resizing to smaller range will keep pointing to the same memory
preallocated.resize(min+1, max-1);
std::fill(mem.begin(), mem.end(), 12345.F);
check_if_equal(preallocated[min+1], 12345.F, "test preallocated: resize smaller uses same memory");
// resizing to non-overlapping range will reallocate
preallocated.resize(min-1, max-1);
std::fill(mem.begin(), mem.end(), 123456.F);
check_if_equal(preallocated[min+1], 12345.F, "test preallocated: grow uses different memory");
}
}
// copying from existing memory
{
std::vector<float> mem(test.get_index_range().size_all());
std::copy(test.begin_all_const(), test.end_all_const(), mem.begin());
Array<1,float> test_from_mem;
test_from_mem.init(test.get_index_range(), &mem[0], true);
check(test_from_mem.owns_memory_for_data(), "test preallocated with copy: should own memory");
check_if_equal(test, test_from_mem, "test construct from mem: equality");
std::copy(test.begin_all_const(), test.end_all_const(), test_from_mem.begin_all());
check_if_equal(test, test_from_mem, "test construct from mem: copy with full_iterator");
// test memory is not shared between the Array and mem
mem[0]=*test.begin() + 345;
check_if_equal(*test_from_mem.begin(), *test.begin(), "test construct from mem: direct buffer mod");
*(test_from_mem.begin()+1) += 4;
check_if_equal(*(test_from_mem.begin()+1), mem[1]+4, "test construct from mem: indirect buffer mod");
}
}
#if 1
{
// tests on log/exp
Array<1,float> test(-3,10);
test.fill(1.F);
in_place_log(test);
{
Array<1,float> testeq(-3,10);
check_if_equal(test , testeq, "test in_place_log of Array1D");
}
{
for (int i=test.get_min_index(); i<= test.get_max_index(); i++)
test[i] = 3.5F*i + 100;
}
Array<1,float> test_copy = test;
in_place_log(test);
in_place_exp(test);
check_if_equal(test , test_copy, "test log/exp of Array1D");
}
#endif
}
{
cerr << "Testing 2D stuff" << endl;
{
const IndexRange<2> range(Coordinate2D<int>(0,0),Coordinate2D<int>(9,9));
Array<2,float> test2(range);
check_if_equal(test2.size(), size_t(10), "test size()");
check_if_equal(test2.size_all(), size_t(100), "test size_all()");
// KT 17/03/98 added check on initialisation
check_if_zero(test2, "test Array<2,float> not initialised to 0" );
#if 0
// KT 06/04/98 removed operator()
test2(3,4) = (float)23.3;
#else
test2[3][4] = (float)23.3;
#endif
//test2.set_offsets(-1,-4);
//check_if_equal( test2[2][0] , 23.3, "test indexing of Array2D");
}
{
IndexRange<2> range(Coordinate2D<int>(0,0),Coordinate2D<int>(3,3));
Array<2,float> testfp(range);
Array<2,float> t2fp(range);
#if 0
// KT 06/04/98 removed operator()
testfp(3,2) = 3.3F;
t2fp(3,2) = 2.2F;
#else
testfp[3][2] = 3.3F;
t2fp[3][2] = 2.2F;
#endif
Array<2,float> t2 = t2fp + testfp;
check_if_equal( t2[3][2] , 5.5F, "test operator +(Array2D)");
t2fp += testfp;
check_if_equal( t2fp[3][2] , 5.5F, "test operator +=(Array2D)");
check_if_equal(t2 , t2fp, "test comparing Array2D+= and +" );
{
BasicCoordinate<2,int> c;
c[1]=3; c[2]=2;
check_if_equal(t2[c], 5.5F, "test on operator[](BasicCoordinate)");
t2[c] = 6.;
check_if_equal(t2[c], 6.F, "test on operator[](BasicCoordinate)");
}
// assert should break on next line (in Debug build) if uncommented
//t2[-4][3]=1.F;
// at() should throw error
{
bool exception_thrown=false;
try
{
t2.at(-4).at(3);
}
catch (...)
{
exception_thrown=true;
}
check(exception_thrown, "out-of-range index should throw an exception");
}
//t2.grow_height(-5,5);
IndexRange<2> larger_range(Coordinate2D<int>(-5,0),Coordinate2D<int>(5,3));
t2.grow(larger_range);
t2[-4][3]=1.F;
check_if_equal( t2[3][2] , 6.F, "test on grow");
// test assignment
t2fp = t2;
check_if_equal(t2 , t2fp, "test operator=(Array2D)" );
{
Array<2,float> tmp;
tmp = t2 / 2;
check_if_equal( t2.sum()/2 , tmp.sum(), "test operator/(float)");
}
{
// copy constructor;
Array<2,float> t21(t2);
check_if_equal(t21 , t2, "test Array2D copy constructor" );
// 'assignment constructor' (this simply calls copy constructor)
Array<2,float> t22 = t2;
check_if_equal(t22 , t2, "test Array2D copy constructor" );
}
// using preallocated memory
{
std::vector<float> mem(t2.get_index_range().size_all());
std::copy(t2.begin_all_const(), t2.end_all_const(), mem.begin());
{
// test iterator access is row-major
auto first_min_idx = t2.get_min_index();
check_if_equal(t2[3][2],
mem[(3 - first_min_idx) * t2[first_min_idx].size_all() +
2 - t2[first_min_idx].get_min_index()],
"check row-major order in 2D");
}
Array<2,float> preallocated;
preallocated.init(t2.get_index_range(), &mem[0], false);
//check(!preallocated.owns_memory_for_data(), "test preallocated without copy: should not own memory");
check_if_equal(t2, preallocated, "test preallocated: equality");
std::copy(t2.begin_all_const(), t2.end_all_const(), preallocated.begin_all());
check_if_equal(t2, preallocated, "test preallocated: copy with full_iterator");
check(preallocated.is_contiguous(), "test Array2D is contiguous (preallocated)");
check(preallocated.get_full_data_ptr() == &mem[0], "test Array2D preallocated pointer access");
preallocated.release_full_data_ptr();
check(preallocated.get_const_full_data_ptr() == &mem[0], "test Array2D preallocated const pointer access");
preallocated.release_const_full_data_ptr();
// test memory is shared between the Array and mem
mem[0]=*t2.begin_all() + 345;
check_if_equal(*preallocated.begin_all(), mem[0], "test preallocated: direct buffer mod");
*(preallocated.begin_all()) += 4;
check_if_equal(*(preallocated.begin_all()), mem[0], "test preallocated: indirect buffer mod");
// test resize
{
BasicCoordinate<2,int> min, max;
preallocated.get_regular_range(min, max);
// resizing to smaller range will keep pointing to the same memory
preallocated.resize(IndexRange<2>(min+1, max-1));
std::fill(mem.begin(), mem.end(), 12345.F);
check_if_equal(preallocated[min+1], 12345.F, "test preallocated: resize smaller uses same memory");
check(!preallocated.is_contiguous(), "test preallocated: no longer contiguous after resize");
preallocated.resize(IndexRange<2>(min-1, max-1));
std::fill(mem.begin(), mem.end(), 123456.F);
check_if_equal(preallocated[min+1], 12345.F, "test preallocated: grow uses different memory");
}
}
}
// size_all with irregular range
{
const IndexRange<2> range(Coordinate2D<int>(-1,1),Coordinate2D<int>(1,2));
Array<2,float> test2(range);
check(test2.is_regular(), "test is_regular() with regular");
check_if_equal(test2.size(), size_t(3), "test size() with non-zero offset");
check_if_equal(test2.size_all(), size_t(6), "test size_all() with non-zero offset");
test2[0].resize(-1,2);
check(!test2.is_regular(), "test is_regular() with irregular");
check_if_equal(test2.size(), size_t(3), "test size() with irregular range");
check_if_equal(test2.size_all(), size_t(6+2), "test size_all() with irregular range");
}
// full iterator
{
IndexRange<2> range(Coordinate2D<int>(0,0),Coordinate2D<int>(2,2));
Array<2,float> test2(range);
{
float value = 1.2F;
for (Array<2,float>::full_iterator iter = test2.begin_all();
iter != test2.end_all();
)
*iter++ = value++;
}
{
float value = 1.2F;
Array<2,float>::const_full_iterator iter = test2.begin_all_const();
for (int i=test2.get_min_index(); i<= test2.get_max_index(); ++i)
for (int j=test2[i].get_min_index(); j<= test2[i].get_max_index(); ++j)
{
check(iter != test2.end_all_const(), "test on 2D full iterator");
check_if_equal(*iter++, test2[i][j], "test on 2D full iterator vs. index");
check_if_equal(test2[i][j], value++, "test on 2D full iterator value");
}
}
const Array<2,float> empty;
check(empty.begin_all() == empty.end_all(), "test on 2D full iterator for empty range");
}
// tests for next()
{
const IndexRange<2> range(Coordinate2D<int>(-1,1),Coordinate2D<int>(1,2));
Array<2,int> test(range);
// fill array with numbers in sequence
{
Array<2,int>::full_iterator iter = test.begin_all();
for (int i=0; iter!= test.end_all(); ++iter, ++i)
{
*iter = i;
}
}
std::cerr << "\tTest on next() with regular array\n";
this->run_tests_on_next(test);
// now do test with irregular array
test[0].resize(0,2);
test[0][2] = 10;
std::cerr << "\tTest on next() with irregular array, case 1\n";
this->run_tests_on_next(test);
test[1].resize(-2,2);
test[1][-2] = 20;
std::cerr << "\tTest on next() with irregular array, case 2\n";
this->run_tests_on_next(test);
test[-1].resize(-2,0);
test[-1][-2] = 30;
std::cerr << "\tTest on next() with irregular array, case 3\n";
this->run_tests_on_next(test);
}
}
{
cerr << "Testing 3D stuff" << endl;
IndexRange<3> range(Coordinate3D<int>(0,-1,1),Coordinate3D<int>(3,3,3));
Array<3,float> test3(range);
check_if_equal(test3.size(), size_t(4), "test size()");
check_if_equal(test3.size_all(), size_t(60), "test size_all() with non-zero offset");
// KT 06/04/98 removed operator()
#if 0
test3(1,2,1) = (float)6.6;
#else
test3[1][2][1] = (float)6.6;
#endif
test3[1][0][2] = (float)7.3;
test3[1][0][1] = -1;
check_if_equal( test3.sum() , 12.9F, "test on sum");
check_if_equal( test3.find_max() , 7.3F, "test on find_max");
check_if_equal( test3.find_min() , -1.F, "test on find_min");
{
Array<3,float> test3copy(test3);
BasicCoordinate<3,int> c;
c[1]=1; c[2]=0; c[3]=2;
check_if_equal(test3[c], 7.3F, "test on operator[](BasicCoordinate)");
test3copy[c]=8.;
check_if_equal(test3copy[1][0][2], 8.F, "test on operator[](BasicCoordinate)");
}
Array<3,float> test3bis(range);
test3bis[1][2][1] = (float)6.6;
test3bis[1][0][1] = (float)1.3;
Array<3,float> test3ter = test3bis;
test3ter += test3;
check_if_equal(test3ter[1][0][1] , .3F, "test on operator+=(Array3D)");
Array<3,float> test3quat = test3 + test3bis;
check_if_equal(test3quat , test3ter, "test summing Array3D");
{
Array<3,float> tmp= test3 - 2;
Array<3,float> tmp2 = test3;
tmp2.fill(1.F);
check_if_zero( test3.sum() - 2*tmp2.sum() - tmp.sum(), "test operator-(float)");
}
in_place_apply_function(test3ter, std::bind(plus<float>(), std::placeholders::_1, 4.F));
test3quat += 4.F;
check_if_equal(test3quat , test3ter,
"test in_place_apply_function and operator+=(NUMBER)");
// size_all with irregular range
{
const IndexRange<3> range(Coordinate3D<int>(-1,1,4),Coordinate3D<int>(1,2,6));
Array<3,float> test(range);
check(test.is_regular(), "test is_regular() with regular");
check_if_equal(test.size(), size_t(3), "test size() with non-zero offset");
check_if_equal(test.size_all(), size_t(3*2*3), "test size_all() with non-zero offset");
test[0][1].resize(-1,2);
check(!test.is_regular(), "test is_regular() with irregular");
check_if_equal(test.size(), size_t(3), "test size() with irregular range");
check_if_equal(test.size_all(), size_t(3*2*3+4-3), "test size_all() with irregular range");
}
// full iterator
{
IndexRange<3> range(Coordinate3D<int>(0,0,1),Coordinate3D<int>(2,2,3));
Array<3,float> test(range);
{
float value = 1.2F;
for (Array<3,float>::full_iterator iter = test.begin_all();
iter != test.end_all();
)
*iter++ = value++;
}
{
float value = 1.2F;
Array<3,float>::const_full_iterator iter = test.begin_all_const();
for (int i=test.get_min_index(); i<= test.get_max_index(); ++i)
for (int j=test[i].get_min_index(); j<= test[i].get_max_index(); ++j)
for (int k=test[i][j].get_min_index(); k<= test[i][j].get_max_index(); ++k)
{
check(iter != test.end_all_const(), "test on 3D full iterator");
check_if_equal(*iter++, test[i][j][k], "test on 3D full iterator vs. index");
check_if_equal(test[i][j][k], value++, "test on 3D full iterator value");
}
}
// test empty container
{
const Array<3,float> empty;
check(empty.begin_all() == empty.end_all(), "test on 3D full iterator for empty range");
}
// test conversion from full_iterator to const_full_iterator
{
Array<3,float>::full_iterator titer= test.begin_all();
Array<3,float>::const_full_iterator ctiter= titer; // this should compile
}
}
}
{
cerr << "Testing 4D stuff" << endl;
const IndexRange<4> range(Coordinate4D<int>(-3,0,-1,1),Coordinate4D<int>(-2,3,3,3));
Array<4,float> test4(range);
test4.fill(1.);
test4[-3][1][2][1] = (float)6.6;
#if 0
test4(-2,1,0,2) = (float)7.3;
#else
test4[-2][1][0][2] = (float)7.3;
#endif
{
float sum = test4.sum();
check_if_equal( sum , 131.9F, "test on sum()");
}
const IndexRange<4> larger_range(Coordinate4D<int>(-3,0,-1,1),Coordinate4D<int>(-1,3,3,5));
test4.grow(larger_range);
check_if_equal(test4.get_index_range(), larger_range, "test Array4D grow index range");
check_if_equal(test4.sum(), 131.9F , "test Array4D grow sum");
{
const Array<4,float> test41 = test4;
check_if_equal(test4 , test41, "test Array4D copy constructor" );
check_if_equal( test41[-3][1][2][1] , 6.6F, "test on indexing after grow");
}
{
Array<4,float> test41 = test4;
const IndexRange<4> mixed_range(Coordinate4D<int>(-4,1,0,1),Coordinate4D<int>(-2,3,3,6));
test41.resize(mixed_range);
check_if_equal(test41.get_index_range(), mixed_range, "test Array4D resize index range");
check_if_equal( test41[-3][1][2][1] , 6.6F, "test on indexing after resize");
}
{
BasicCoordinate<4,int> c;
c[1]=-2;c[2]=1;c[3]=0;c[4]=2;
check_if_equal(test4[c] , 7.3F , "test on operator[](BasicCoordinate)");
test4[c]=1.;
check_if_equal(test4[c] , 1.F , "test on operator[](BasicCoordinate)");
}
{
Array<4,float> test4bis(range);
test4bis[-2][1][2][1] = (float)6.6;
test4bis[-3][1][0][1] = (float)1.3;
Array<4,float> test4ter = test4bis;
test4ter += test4;
check_if_equal(test4ter[-3][1][0][1] ,2.3F, "test on operator+=(Array4D)");
check(test4ter.get_index_range() == larger_range, "test range for operator+=(Array4D) with grow");
// Note that test4 is bigger in size than test4bis.
Array<4,float> test4quat = test4bis + test4;
check_if_equal(test4quat ,test4ter, "test summing Array4D with grow");
check(test4quat.get_index_range() == larger_range, "test range for operator+=(Array4D)");
}
// test on scalar multiplication, division
{
Array<4,float> test4bis = test4;
test4bis *= 6.F;
check_if_equal(test4bis.sum() ,test4.sum()*6, "test operator *=(float)");
test4bis /= 5.F;
check_if_equal(test4bis.sum() ,test4.sum()*6.F/5, "test operator /=(float)");
}
// test on element-wise multiplication, division
{
Array<4,float> test4bis(range);
{
for (int i=test4bis.get_min_index(); i<= test4bis.get_max_index(); i++)
test4bis[i].fill(i+10.F);
}
// save for comparison later on
Array<4,float> test4ter = test4bis;
// Note that test4 is bigger than test4bis, so it will grow with the *=
// new elements in test4bis will remain 0 because we're using multiplication
test4[-1].fill(666);
test4bis *= test4;
check_if_zero(test4bis[-1], "test operator *=(Array4D) grows ok");
check(test4.get_index_range() == test4bis.get_index_range(), "test operator *=(Array4D) grows ok: range");
// compute the new sum.
{
float sum_check = 0;
for (int i=test4.get_min_index(); i<= -2; i++)
sum_check += test4[i].sum()*(i+10.F);
check_if_equal(test4bis.sum() ,sum_check, "test operator *=(Array4D)");
}
// divide test4, but add a tiny number to avoid division by zero
const Array<4,float> test4quat = test4bis / (test4+.00001F);
test4ter.grow(test4.get_index_range());
check_if_equal(test4ter ,test4quat, "test operator /(Array4D)");
}
// test operator+(float)
{
// KT 31/01/2000 new
Array<4,float> tmp= test4 + 2;
Array<4,float> tmp2 = test4;
tmp2.fill(1.F);
// KT 20/12/2001 made check_if_zero compare relative to 1 by dividing
check_if_zero( (test4.sum() + 2*tmp2.sum() - tmp.sum())/test4.sum(),
"test operator+(float)");
}
// test axpby
{
Array<4,float> tmp(test4.get_index_range());
Array<4,float> tmp2(test4+2);
tmp.axpby(2.F, test4, 3.3F, tmp2);
const Array<4,float> by_hand = test4*2.F + (test4+2)*3.3F;
check_if_equal(tmp, by_hand, "test axpby (Array4D)");
}
// test xapyb, a and b scalar
{
Array<4,float> tmp(test4.get_index_range());
tmp.xapyb(test4, 2.F, test4+2, 3.3F);
const Array<4,float> by_hand = test4*2.F + (test4+2)*3.3F;
check_if_equal(tmp, by_hand, "test xapyb scalar (Array4D)");
tmp = test4;
tmp.sapyb(2.F, test4+2, 3.3F);
check_if_equal(tmp, by_hand, "test sapyb scalar (Array4D)");
}
// test xapyb, a and b vector
{
Array<4,float> tmp(test4.get_index_range());
tmp.xapyb(test4, test4+4, test4+2, test4+6);
const Array<4, float> by_hand = test4 * (test4 + 4) + (test4 + 2) * (test4 + 6);
check_if_equal(tmp, by_hand, "test xapyb vector (Array4D)");
tmp = test4;
tmp.sapyb(test4+4, test4+2, test4+6);
check_if_equal(tmp, by_hand, "test sapyb vector (Array4D)");
}
{
typedef NumericVectorWithOffset<Array<4, float>, float> NVecArr;
typedef NVecArr::iterator NVecArrIter;
NVecArr tmp(-1, 2);
NVecArr x(-1, 2);
NVecArr y(-1, 2);
NVecArr by_hand(-1, 2);
NVecArrIter iter_tmp = tmp.begin();
NVecArrIter iter_x = x.begin();
NVecArrIter iter_y = y.begin();
NVecArrIter iter_by_hand = by_hand.begin();
int i = 0;
while (iter_tmp != tmp.end())
{
*iter_x = test4+i;
*iter_y = (test4 +i+ 2);
*iter_by_hand = ((test4 +i)* 2.0F + (test4+i + 2) * 3.3F);
iter_tmp++;
iter_x++;
iter_y++;
iter_by_hand++;
}
tmp.xapyb(x, 2.0F, y, 3.3F);
check_if_equal(tmp, by_hand, "test xapyb scalar (NumericVectorWithOffset<Array4D>)");
x.sapyb(2.0F, y, 3.3F);
check_if_equal(x, by_hand, "test sapyb scalar (NumericVectorWithOffset<Array4D>)");
}
{
typedef NumericVectorWithOffset<Array<4, float>, float> NVecArr;
typedef NVecArr::iterator NVecArrIter;
NVecArr tmp(-1, 2);
NVecArr x(-1, 2);
NVecArr y(-1, 2);
NVecArr a(-1, 2);
NVecArr b(-1, 2);
NVecArr by_hand(-1, 2);
NVecArrIter iter_tmp = tmp.begin();
NVecArrIter iter_x = x.begin();
NVecArrIter iter_y = y.begin();
NVecArrIter iter_a = a.begin();
NVecArrIter iter_b = b.begin();
NVecArrIter iter_by_hand = by_hand.begin();
int i = 0;
while (iter_tmp != tmp.end())
{
*iter_x = test4+i;
*iter_y = (test4+i + 2);
*iter_a = (test4+i + 4);
*iter_b = (test4+i + 6);
*iter_by_hand = ((test4+i) * (test4+i + 4) + (test4+i + 2) * (test4+i + 6));
iter_tmp++;
iter_x++;
iter_y++;
iter_a++;
iter_b++;
iter_by_hand++;
}
tmp.xapyb(x, a, y, b);
check_if_equal(tmp, by_hand, "test xapyb vector (NumericVectorWithOffset<Array4D>)");
x.sapyb(a, y, b);
check_if_equal(x, by_hand, "test sapyb vector (NumericVectorWithOffset<Array4D>)");
}
}
#if 1
{
cerr << "Testing 1D float IO" << endl;
Array<1,float> t1(IndexRange<1>(-1,10));
for (int i=-1; i<=10; i++)
t1[i] = static_cast<float>(sin(i* _PI/ 15.));
run_IO_tests(t1);
}
{
cerr << "Testing 2D double IO" << endl;
IndexRange<2> range(Coordinate2D<int>(-1,11),Coordinate2D<int>(10,20));
Array<2,double> t1(range);
for (int i=-1; i<=10; i++)
for (int j=11; j<=20; j++)
t1[i][j] = static_cast<double>(sin(i*j* _PI/ 15.));
run_IO_tests(t1);
}
{
cerr << "Testing 3D float IO" << endl;
// construct test array which has rows of very different magnitudes,
// numbers in last rows do not fit into short integers
IndexRange<3> range(Coordinate3D<int>(-1,11,21),Coordinate3D<int>(10,20,30));
Array<3,float> t1(range);
for (int i=-1; i<=10; i++)
for (int j=11; j<=20; j++)
for (int k=21; k<=30; k++)
t1[i][j][k] = static_cast<float>(20000.*k*sin(i*j*k* _PI/ 3000.));
run_IO_tests(t1);
}
#endif
{
cerr << "Testing make_array" << endl;
const Array<2,float> arr1 =
make_array(make_1d_array(1.F,0.F,0.F),
make_1d_array(0.F,1.F,1.F),
make_1d_array(0.F,-2.F,2.F));
const Array<2,float> arr2(
make_array(make_1d_array(1.F,0.F,0.F),
make_1d_array(0.F,1.F,1.F),
make_1d_array(0.F,-2.F,2.F)));
const Array<2,float> arr3 = detail::test_make_array();
const Array<2,float> arr4(detail::test_make_array());
check_if_equal(arr1[2][1], -2.F, "make_array element comparison");
check_if_equal(arr1, arr2, "make_array inline assignment vs constructor");
check_if_equal(arr1, arr3, "make_array inline vs function with assignment");
check_if_equal(arr1, arr4, "make_array inline constructor from function");
}
std::cerr << "timings\n";
{
HighResWallClockTimer t;
IndexRange<4> range(Coordinate4D<int>(20,100,400,600));
t.start();
double create_duration;
{