-
Notifications
You must be signed in to change notification settings - Fork 36
Expand file tree
/
Copy pathArray.cpp
More file actions
193 lines (181 loc) · 5.76 KB
/
Copy pathArray.cpp
File metadata and controls
193 lines (181 loc) · 5.76 KB
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
#define CATCH_CONFIG_MAIN
#include "catch.hpp"
#include "ndarray/Array.hpp"
namespace ndd = ndarray::detail;
namespace nd = ndarray;
TEST_CASE(
"default-constructed and post-move Arrays behave appropriately",
"[array-empty]"
) {
nd::Array<float,3> empty;
CHECK( empty.data() == nullptr );
CHECK( empty.manager() == nullptr );
CHECK( empty.empty() );
nd::Array<float,3> b;
CHECK( empty == b );
nd::Array<float,3> full({4, 3, 2});
CHECK( empty != full );
empty = std::move(full);
// No check for data()==nullptr; this is not guaranteed.
CHECK( full.empty() );
CHECK( full.manager() == nullptr );
}
TEST_CASE(
"Arrays can use different container types for shapes and strides",
"[array-primary-ctors]"
) {
// initializer_list for both.
nd::Array<float,3> a(nullptr, {4, 5, 2}, {40, 8, 4});
CHECK( a.data() == nullptr );
CHECK( a.size<0>() == 4 );
CHECK( a.size<1>() == 5 );
CHECK( a.size<2>() == 2 );
CHECK( a.stride<0>() == 40 );
CHECK( a.stride<1>() == 8 );
CHECK( a.stride<2>() == 4 );
// initializer_list for shape, std::vector for strides
nd::Array<float,3> b(nullptr, {4, 5, 2}, std::vector<int>{40, 8, 4});
CHECK( b.data() == nullptr );
CHECK( b.size<0>() == 4 );
CHECK( b.size<1>() == 5 );
CHECK( b.size<2>() == 2 );
CHECK( b.stride<0>() == 40 );
CHECK( b.stride<1>() == 8 );
CHECK( b.stride<2>() == 4 );
// std::array for shape, initializer_list for strides
nd::Array<float,3> c(nullptr, std::array<unsigned char,3>{4, 5, 2},
{40, 8, 4});
CHECK( c.data() == nullptr );
CHECK( c.size<0>() == 4 );
CHECK( c.size<1>() == 5 );
CHECK( c.size<2>() == 2 );
CHECK( c.stride<0>() == 40 );
CHECK( c.stride<1>() == 8 );
CHECK( c.stride<2>() == 4 );
// std::vector for shape, std::array for strides
nd::Array<float,3> d(nullptr, std::vector<unsigned char>{4, 5, 2},
std::array<int,3>{40, 8, 4});
CHECK( d.data() == nullptr );
CHECK( d.size<0>() == 4 );
CHECK( d.size<1>() == 5 );
CHECK( d.size<2>() == 2 );
CHECK( d.stride<0>() == 40 );
CHECK( d.stride<1>() == 8 );
CHECK( d.stride<2>() == 4 );
// std::vector for shape, automatic row-major strides
nd::Array<float,3> e(std::vector<short>{4, 5, 2});
CHECK( e.data() != nullptr );
CHECK( e.size<0>() == 4 );
CHECK( e.size<1>() == 5 );
CHECK( e.size<2>() == 2 );
CHECK( e.stride<0>() == 40 );
CHECK( e.stride<1>() == 8 );
CHECK( e.stride<2>() == 4 );
// initializer_list for shape, automatic row-major strides
nd::Array<float,3> f({4, 5, 2});
CHECK( f.data() != nullptr );
CHECK( f.size<0>() == 4 );
CHECK( f.size<1>() == 5 );
CHECK( f.size<2>() == 2 );
CHECK( f.stride<0>() == 40 );
CHECK( f.stride<1>() == 8 );
CHECK( f.stride<2>() == 4 );
// std::array for shape, automatic column-major strides
nd::Array<float,3,-2> g(std::array<long,3>{4, 5, 2});
CHECK( g.data() != nullptr );
CHECK( g.size<0>() == 4 );
CHECK( g.size<1>() == 5 );
CHECK( g.size<2>() == 2 );
CHECK( g.stride<0>() == 4 );
CHECK( g.stride<1>() == 16 );
CHECK( g.stride<2>() == 80 );
// initializer_list for shape, automatic column-major strides
nd::Array<float,3,-1> h({4, 5, 2});
CHECK( h.data() != nullptr );
CHECK( h.size<0>() == 4 );
CHECK( h.size<1>() == 5 );
CHECK( h.size<2>() == 2 );
CHECK( h.stride<0>() == 4 );
CHECK( h.stride<1>() == 16 );
CHECK( h.stride<2>() == 80 );
}
TEST_CASE(
"Arrays equality comparison is shallow and requires exact equivalence.",
"[array-comparison]"
) {
nd::Array<float,3> a({4, 5, 2});
nd::Array<float,3> b({4, 5, 2});
CHECK( a != b ); // different data, same shape and strides
nd::Array<float,3> c(a);
CHECK( a == c );
b = a;
CHECK( a == b );
nd::Array<float,3,-3> d(a.data(), a.shape(), a.manager(), a.dtype());
CHECK( a != d ); // same data, shape; different strides
nd::Array<float,3> e(a.data(), a.shape().reversed(), a.strides(),
a.manager(), a.dtype());
CHECK( a != e ); // same data, strides; different shape
}
TEST_CASE(
"Arrays provide access to shape and strides as containers.",
"[array-shape-and-strides]"
) {
nd::Array<float,3> a({4, 5, 2});
CHECK( a.shape().equals({4, 5, 2}) );
CHECK( a.strides().equals({40, 8, 4}) );
}
TEST_CASE(
"Arrays are dereferenced to ArrayRefs, allowing value assignment.",
"[array-dereference]"
) {
nd::Array<float,1> a({2});
*a = 4.0;
CHECK ( a[0] == 4.0 );
CHECK ( a[1] == 4.0 );
}
TEST_CASE(
"Non-const arrays are implicitly convertible to const, yielding views.",
"[array-const-conversion]"
) {
nd::Array<float,1> a({2});
auto func = [a](nd::Array<float const,1> x) { return a == x; };
CHECK( func(a) );
}
TEST_CASE(
"Test nested iteration over higher-dimensional arrays",
"[array-iteration]"
) {
std::array<int,24> data;
std::iota(data.begin(), data.end(), 0);
nd::Array<int,3> a(data.data(), {2, 3, 4});
int i = 0;
int bn = 0;
for (auto const & b : a) {
int cn = 0;
for (auto const & c : b) {
int dn = 0;
for (auto const & d : c) {
CHECK( d == i );
++dn;
++i;
}
CHECK(dn == 4);
++cn;
}
CHECK(cn == 3);
++bn;
}
CHECK(bn == 2);
}
TEST_CASE(
"Test indexing with integers and index arrays.",
"[array-indexing]"
) {
std::array<int,12> data;
std::iota(data.begin(), data.end(), 0);
nd::Array<int,2> a(data.data(), {3, 4});
CHECK( a[2][0] == 8 );
CHECK( a[1][1] == 5 );
CHECK( (a[{1, 3}]) == 7 );
CHECK( (a[{2, 1}]) == 9 );
}