-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathndarray.hpp
866 lines (745 loc) · 21.3 KB
/
ndarray.hpp
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
/*
Copyright (c) 2012,2013 Tobias Brink
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef TERSOFF_NDARRAY_HPP
#define TERSOFF_NDARRAY_HPP
#include <cstdlib>
#include <cmath>
#include <stdexcept>
/***********************************************************************
* TODO:
*
* - unsigned vs signed
* - copy and move constructors
* - move implementations out of the class definition (see Vec3D)
* - implement a size() function (multiply all extents)
***********************************************************************/
namespace mytest {
// Some common integer powers. /////////////////////////////////////////
template<typename T>
T pow2(const T& b) {
return b * b;
}
template<typename T>
T pow3(const T& b) {
return b * b * b;
}
// 3D vectors. /////////////////////////////////////////////////////////
template<typename T> class Vec3D;
//! Addition of Vec3D with scalar.
template<typename T>
Vec3D<T> operator+(Vec3D<T> lhs, const T& rhs) {
lhs += rhs;
return lhs;
}
//! Addition of Vec3D with Vec3D.
template<typename T>
Vec3D<T> operator+(Vec3D<T> lhs, const Vec3D<T>& rhs) {
lhs += rhs;
return lhs;
}
//! Add scalar to Vec3D.
template<typename T>
Vec3D<T> operator+(const T& lhs, Vec3D<T> rhs) {
rhs += lhs;
return rhs;
}
//! Subtract scalar from Vec3D.
template<typename T>
Vec3D<T> operator-(Vec3D<T> lhs, const T& rhs) {
lhs -= rhs;
return lhs;
}
//! Subtract Vec3D from Vec3D.
template<typename T>
Vec3D<T> operator-(Vec3D<T> lhs, const Vec3D<T>& rhs) {
lhs -= rhs;
return lhs;
}
//! Subtract Vec3D from scalar.
template<typename T>
Vec3D<T> operator-(const T& lhs, const Vec3D<T>& rhs) {
return -rhs + lhs;
}
//! Multiplication of Vec3D with scalar.
template<typename T>
Vec3D<T> operator*(Vec3D<T> lhs, const T& rhs) {
lhs *= rhs;
return lhs;
}
//! Multiplication of Vec3D with Vec3D.
template<typename T>
Vec3D<T> operator*(Vec3D<T> lhs, const Vec3D<T>& rhs) {
lhs *= rhs;
return lhs;
}
//! Multiply scalar with Vec3D.
template<typename T>
Vec3D<T> operator*(const T& lhs, Vec3D<T> rhs) {
rhs *= lhs;
return rhs;
}
//! Devide Vec3D by scalar.
template<typename T>
Vec3D<T> operator/(Vec3D<T> lhs, const T& rhs) {
lhs /= rhs;
return lhs;
}
//! Devide Vec3D by Vec3D.
template<typename T>
Vec3D<T> operator/(Vec3D<T> lhs, const Vec3D<T>& rhs) {
lhs /= rhs;
return lhs;
}
//! Devide scalar by Vec3D.
template<typename T>
Vec3D<T> operator/(const T& lhs, Vec3D<T> rhs) {
rhs.x = lhs / rhs.x;
rhs.y = lhs / rhs.y;
rhs.z = lhs / rhs.z;
return rhs;
}
//! Vec3D dot product.
template<typename T>
T dot(const Vec3D<T>& lhs, const Vec3D<T>& rhs) {
return lhs.x*rhs.x + lhs.y*rhs.y + lhs.z*rhs.z;
}
//! Vec3D cross product.
template<typename T>
Vec3D<T> cross(const Vec3D<T>& lhs, const Vec3D<T>& rhs) {
return Vec3D<T>(lhs.y * rhs.z - lhs.z * rhs.y,
lhs.z * rhs.x - lhs.x * rhs.z,
lhs.x * rhs.y - lhs.y * rhs.x);
}
/*!
A 3D vector (x,y,z).
*/
template<typename T>
class Vec3D {
friend T dot<T>(const Vec3D<T>&, const Vec3D<T>&);
friend Vec3D<T> cross<T>(const Vec3D<T>&, const Vec3D<T>&);
friend Vec3D<T> operator/<T>(const T&, Vec3D<T>);
public:
Vec3D();
Vec3D(const T& x, const T& y, const T& z);
Vec3D(const Vec3D<T>& rhs);
T& operator[](int);
const T& operator[](int i) const;
Vec3D<T>& operator+=(const Vec3D<T>& rhs);
Vec3D<T>& operator+=(const T& rhs);
Vec3D<T>& operator-=(const Vec3D<T>& rhs);
Vec3D<T>& operator-=(const T& rhs);
Vec3D<T> operator-() const;
Vec3D<T>& operator*=(const Vec3D<T>& rhs);
Vec3D<T>& operator*=(const T& rhs);
Vec3D<T>& operator/=(const Vec3D<T>& rhs);
Vec3D<T>& operator/=(const T& rhs);
T abs() const;
T abssq() const;
private:
T x,y,z;
};
template<typename T> inline
Vec3D<T>::Vec3D() { }
template<typename T> inline
Vec3D<T>::Vec3D(const T& x, const T& y, const T& z)
: x(x), y(y), z(z)
{ }
template<typename T> inline
Vec3D<T>::Vec3D(const Vec3D<T>& rhs)
: x(rhs.x), y(rhs.y), z(rhs.z)
{ }
template<typename T> inline
T& Vec3D<T>::operator[](int i) {
switch (i) {
case 0:
return x;
case 1:
return y;
case 2:
return z;
default:
throw std::out_of_range("i must be in the range [0;2]");
}
}
template<typename T> inline
const T& Vec3D<T>::operator[](int i) const {
switch (i) {
case 0:
return x;
case 1:
return y;
case 2:
return z;
default:
throw std::out_of_range("i must be in the range [0;2]");
}
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator+=(const Vec3D<T>& rhs) {
x += rhs.x;
y += rhs.y;
z += rhs.z;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator+=(const T& rhs) {
x += rhs;
y += rhs;
z += rhs;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator-=(const Vec3D<T>& rhs) {
x -= rhs.x;
y -= rhs.y;
z -= rhs.z;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator-=(const T& rhs) {
x -= rhs;
y -= rhs;
z -= rhs;
return *this;
}
template<typename T> inline
Vec3D<T> Vec3D<T>::operator-() const {
return Vec3D<T>(-this->x, -this->y, -this->z);
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator*=(const Vec3D<T>& rhs) {
x *= rhs.x;
y *= rhs.y;
z *= rhs.z;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator*=(const T& rhs) {
x *= rhs;
y *= rhs;
z *= rhs;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator/=(const Vec3D<T>& rhs) {
x /= rhs.x;
y /= rhs.y;
z /= rhs.z;
return *this;
}
template<typename T> inline
Vec3D<T>& Vec3D<T>::operator/=(const T& rhs) {
x /= rhs;
y /= rhs;
z /= rhs;
return *this;
}
template<typename T> inline
T Vec3D<T>::abs() const {
return std::sqrt(x*x + y*y + z*z);
}
template<typename T> inline
T Vec3D<T>::abssq() const {
return x*x + y*y + z*z;
}
// Symmetric 3*3 matrix in Voigt notation //////////////////////////////
template<typename T> class Voigt6;
// Multiply Voigt6 with scalar.
template<typename T>
Voigt6<T> operator*(Voigt6<T> lhs, const T& rhs) {
lhs *= rhs;
return lhs;
}
// Multiply scalar with Voigt6.
template<typename T>
Voigt6<T> operator*(const T& lhs, Voigt6<T> rhs) {
rhs *= lhs;
return rhs;
}
// Divide Voigt6 by scalar.
template<typename T>
Voigt6<T> operator/(Voigt6<T> lhs, const T& rhs) {
lhs /= rhs;
return lhs;
}
// Uses {xx,yy,zz,yz,xz,xy} to store data. Data is stored
// continuously.
template<typename T>
class Voigt6 {
public:
Voigt6(T xx_, T yy_, T zz_, T yz_, T xz_, T xy_)
: data(static_cast<T*>(std::malloc(6*sizeof(T)))), keep_data(false),
xx(data[0]), yy(data[1]), zz(data[2]),
yz(data[3]), xz(data[4]), xy(data[5])
{
data[0] = xx_; data[1] = yy_; data[2] = zz_;
data[3] = yz_; data[4] = xz_; data[5] = xy_;
}
// Uninitialized.
Voigt6()
: data(static_cast<T*>(std::malloc(6*sizeof(T)))), keep_data(false),
xx(data[0]), yy(data[1]), zz(data[2]),
yz(data[3]), xz(data[4]), xy(data[5])
{}
// Wrapper to externally managed memory.
explicit Voigt6(T* d)
: data(d), keep_data(true),
xx(data[0]), yy(data[1]), zz(data[2]),
yz(data[3]), xz(data[4]), xy(data[5])
{}
// Copy constructor.
Voigt6(const Voigt6<T>& other)
: data(static_cast<T*>(std::malloc(6*sizeof(T)))), keep_data(false),
xx(data[0]), yy(data[1]), zz(data[2]),
yz(data[3]), xz(data[4]), xy(data[5])
{
data[0] = other.data[0]; data[1] = other.data[1]; data[2] = other.data[2];
data[3] = other.data[3]; data[4] = other.data[4]; data[5] = other.data[5];
}
// Move constructor.
Voigt6(Voigt6<T>&& other)
: xx(other.data[0]), yy(other.data[1]), zz(other.data[2]),
yz(other.data[3]), xz(other.data[4]), xy(other.data[5])
{
data = other.data;
keep_data = other.keep_data;
other.keep_data = true; // Keep from double-freeing memory.
}
~Voigt6() {
if (!keep_data)
std::free(data);
}
T& operator()(int i) {
//TODO: range check??
return data[i];
}
const T& operator()(int i) const {
//TODO: range check??
return data[i];
}
T& operator()(int i, int j) {
switch (i) {
case 0:
switch (j) {
case 0: return data[0]; // xx
case 1: return data[5]; // xy
case 2: return data[4]; // xz
default: throw std::runtime_error("out of bounds");
}
case 1:
switch (j) {
case 0: return data[5]; // xy
case 1: return data[1]; // yy
case 2: return data[3]; // yz
default: throw std::runtime_error("out of bounds");
}
case 2:
switch (j) {
case 0: return data[4]; // xz
case 1: return data[3]; // yz
case 2: return data[2]; // zz
default: throw std::runtime_error("out of bounds");
}
default:
throw std::runtime_error("out of bounds");
}
}
const T& operator()(int i, int j) const {
switch (i) {
case 0:
switch (j) {
case 0: return data[0]; // xx
case 1: return data[5]; // xy
case 2: return data[4]; // xz
default: throw std::runtime_error("out of bounds");
}
case 1:
switch (j) {
case 0: return data[5]; // xy
case 1: return data[1]; // yy
case 2: return data[3]; // yz
default: throw std::runtime_error("out of bounds");
}
case 2:
switch (j) {
case 0: return data[4]; // xz
case 1: return data[3]; // yz
case 2: return data[2]; // zz
default: throw std::runtime_error("out of bounds");
}
default:
throw std::runtime_error("out of bounds");
}
}
Voigt6<T>& operator*=(const T& rhs) {
data[0] *= rhs; data[1] *= rhs; data[2] *= rhs;
data[3] *= rhs; data[4] *= rhs; data[5] *= rhs;
return *this;
}
Voigt6<T>& operator/=(const T& rhs) {
data[0] /= rhs; data[1] /= rhs; data[2] /= rhs;
data[3] /= rhs; data[4] /= rhs; data[5] /= rhs;
return *this;
}
private:
T* data;
bool keep_data;
public:
const T& xx;
const T& yy;
const T& zz;
const T& yz;
const T& xz;
const T& xy;
};
// n-dimensional arrays. ///////////////////////////////////////////////
/*!
This wraps a pointer to type T to be used as a 2D array.
@todo: move inline member functions out of the class definition like above.
*/
template<typename T>
class Array1D {
public:
//! External memory management.
explicit Array1D(T* data, int size)
: data(data), size_(size),
keep_data(true)
{}
//! Manage data by the class.
explicit Array1D(int size)
: data(static_cast<T*>(std::malloc(size*sizeof(T)))),
size_(size),
keep_data(false)
{}
//! Move constructor.
Array1D(Array1D<T>&& other)
: data(other.data),
size_(other.size_),
keep_data(other.keep_data)
{
other.keep_data = true; // Avoid double-freeing memory.
}
virtual ~Array1D() {
if (!keep_data)
std::free(data);
}
//! Return size of array in dimension e (0 is the first dimension).
int extent(int e) const {
switch(e) {
case 0:
return size_;
default:
throw std::out_of_range("e must be 0");
}
}
T& operator()(int i) {
//TODO: range check??
return data[i];
}
const T& operator()(int i) const {
//TODO: range check??
return data[i];
}
Array1D<T>& operator*=(const T& rhs) {
for (int i = 0; i != size_; ++i)
data[i] *= rhs;
return *this;
}
protected:
T* data;
private:
int size_;
bool keep_data;
// Do not use!
Array1D& operator=(const Array1D&) {}
};
/*! This is basically the same as Array1D but initializes memory
when allocating. */
template<typename T>
class Array1DInit : public Array1D<T> {
public:
//! External memory management.
explicit Array1DInit(T* data, int size)
: Array1D<T>(data, size),
keep_data_outer(true)
{}
//! Manage data by the class.
explicit Array1DInit(int size)
: Array1D<T>(new T[size], size),
keep_data_outer(false)
{}
//! Move constructor.
Array1DInit(Array1DInit<T>&& other)
: Array1D<T>(move(other)),
keep_data_outer(other.keep_data_outer)
{
other.keep_data_outer = true; // Avoid double-freeing memory.
}
~Array1DInit() {
if (!keep_data_outer)
delete[] this->data;
}
private:
bool keep_data_outer;
};
/*!
This wraps a pointer to type T to be used as a 2D array.
@todo: move inline member functions out of the class definition like above.
*/
template<typename T>
class Array2D {
public:
//! External memory management.
explicit Array2D(T* data, int extent_outer, int extent_inner)
: data(data), extent_outer(extent_outer), extent_inner(extent_inner),
keep_data(true)
{}
//! Manage data by the class.
explicit Array2D(int extent_outer, int extent_inner)
: data(static_cast<T*>(std::malloc(extent_outer*extent_inner*sizeof(T)))),
extent_outer(extent_outer), extent_inner(extent_inner),
keep_data(false)
{}
//! Move constructor.
Array2D(Array2D<T>&& other)
: data(other.data),
extent_outer(other.extent_outer), extent_inner(other.extent_inner),
keep_data(other.keep_data)
{
other.keep_data = true; // Avoid double-freeing memory.
}
~Array2D() {
if (!keep_data)
std::free(data);
}
//! Return size of array in dimension e (0 is the first dimension).
int extent(int e) const {
switch(e) {
case 0:
return extent_outer;
case 1:
return extent_inner;
default:
throw std::out_of_range("e must be in the range [0;1]");
}
}
T& operator()(int i, int j) {
//TODO: range check??
return data[i*extent_inner + j];
}
const T& operator()(int i, int j) const {
//TODO: range check??
return data[i*extent_inner + j];
}
Array2D& operator=(const T& rhs) {
const int size = extent_outer * extent_inner;
for (int i = 0; i != size; ++i)
data[i] = rhs;
return *this;
}
Array2D<T>& operator*=(const T& rhs) {
const int size = extent_outer * extent_inner;
for (int i = 0; i != size; ++i)
data[i] *= rhs;
return *this;
}
private:
T* data;
int extent_outer, extent_inner;
bool keep_data;
// Do not use!
Array2D& operator=(const Array2D&) {}
};
/*!
This wraps a pointer to type T to be used as a 2D array.
@todo: move inline member functions out of the class definition like above.
*/
template<typename T>
class Array3D {
public:
explicit Array3D(T* data, int extent0, int extent1, int extent2)
: data(data), extent0(extent0), extent1(extent1), extent2(extent2),
fac_i(extent1*extent2),
keep_data(true)
{}
explicit Array3D(int extent0, int extent1, int extent2)
: data(static_cast<T*>(malloc(extent0*extent1*extent2*sizeof(T)))),
extent0(extent0), extent1(extent1), extent2(extent2),
fac_i(extent1*extent2),
keep_data(false)
{}
//! Move constructor.
Array3D(Array3D<T>&& other)
: data(other.data),
extent0(other.extent0), extent1(other.extent1), extent2(other.extent2),
fac_i(other.fac_i),
keep_data(other.keep_data)
{
other.keep_data = true; // Avoid double-freeing memory.
}
~Array3D() {
if (!keep_data)
std::free(data);
}
//! Return size of array in dimension e (0 is the first dimension).
int extent(int e) const {
switch(e) {
case 0:
return extent0;
case 1:
return extent1;
case 2:
return extent2;
default:
throw std::out_of_range("e must be in the range [0;2]");
}
}
T& operator()(int i, int j, int k) {
//TODO: range check??
return data[i*fac_i + j*extent2 + k];
}
const T& operator()(int i, int j, int k) const {
//TODO: range check??
return data[i*fac_i + j*extent2 + k];
}
void operator=(const T& rhs) {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
(*this)(i,j,k) = rhs;
}
bool any() const {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
if ((*this)(i,j,k))
return true;
return false;
}
bool all() const {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
if (!(*this)(i,j,k))
return false;
return true;
}
private:
T* data;
int extent0, extent1, extent2;
int fac_i;
bool keep_data;
// Do not use!
Array3D& operator=(const Array3D&) {}
};
/*!
This wraps a pointer to type T to be used as a 2D array.
@todo: move inline member functions out of the class definition like above.
*/
template<typename T>
class Array4D {
public:
explicit Array4D(T* data,
int extent0, int extent1, int extent2, int extent3)
: data(data),
extent0(extent0), extent1(extent1), extent2(extent2), extent3(extent3),
fac_i(extent1*extent2*extent3),
fac_j(extent2*extent3),
keep_data(true)
{}
explicit Array4D(int extent0, int extent1, int extent2, int extent3)
: data(static_cast<T*>(malloc(extent0*extent1*extent2*extent3*sizeof(T)))),
extent0(extent0), extent1(extent1), extent2(extent2), extent3(extent3),
fac_i(extent1*extent2*extent3),
fac_j(extent2*extent3),
keep_data(false)
{}
//! Move constructor.
Array4D(Array4D<T>&& other)
: data(other.data),
extent0(other.extent0), extent1(other.extent1),
extent2(other.extent2), extent3(other.extent3),
fac_i(other.fac_i), fac_j(other.fac_j),
keep_data(other.keep_data)
{
other.keep_data = true; // Avoid double-freeing memory.
}
~Array4D() {
if (!keep_data)
std::free(data);
}
//! Return size of array in dimension e (0 is the first dimension).
int extent(int e) const {
switch(e) {
case 0:
return extent0;
case 1:
return extent1;
case 2:
return extent2;
case 3:
return extent3;
default:
throw std::out_of_range("e must be in the range [0;3]");
}
}
T& operator()(int i, int j, int k, int l) {
//TODO: range check??
return data[i*fac_i + j*fac_j + k*extent3 + l];
}
const T& operator()(int i, int j, int k, int l) const {
//TODO: range check??
return data[i*fac_i + j*fac_j + k*extent3 + l];
}
void operator=(const T& rhs) {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
for (int l = 0; l != extent3; ++l)
(*this)(i,j,k,l) = rhs;
}
bool any() const {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
for (int l = 0; l != extent3; ++l)
if ((*this)(i,j,k,l))
return true;
return false;
}
bool all() const {
for (int i = 0; i != extent0; ++i)
for (int j = 0; j != extent1; ++j)
for (int k = 0; k != extent2; ++k)
for (int l = 0; l != extent3; ++l)
if (!(*this)(i,j,k,l))
return false;
return true;
}
private:
T* data;
int extent0, extent1, extent2, extent3;
int fac_i, fac_j;
bool keep_data;
// Do not use!
Array4D& operator=(const Array4D&) {}
};
}
#endif /* TERSOFF_NDARRAY_HPP */