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
|
/*
* (C) Copyright 1996- ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
* In applying this licence, ECMWF does not waive the privileges and immunities
* granted to it by virtue of its status as an intergovernmental organisation
* nor does it submit to any jurisdiction.
*/
#include "eckit/config/Resource.h"
#include "util.h"
#include "eckit/linalg/allocator/NonOwningAllocator.h"
#include "eckit/linalg/allocator/StandardContainerAllocator.h"
using namespace eckit::linalg;
//----------------------------------------------------------------------------------------------------------------------
namespace eckit::test {
//----------------------------------------------------------------------------------------------------------------------
struct Fixture {
const Vector x;
const SparseMatrix A;
const Vector y;
};
/// Test sparse matrix interface
CASE("move constructor") {
SparseMatrix a{S(3, 3, 4, 0, 0, 2., 0, 2, -3., 1, 1, 2., 2, 2, 2.)};
EXPECT(!a.empty());
SparseMatrix b{std::move(a)};
EXPECT(!b.empty());
}
CASE("eckit la sparse") {
// "square" fixture
// A = 2 . -3
// . 2 .
// . . 2
// x = 1 2 3
// y = 1 2 3
Fixture F{V(3, 1., 2., 3.), S(3, 3, 4, 0, 0, 2., 0, 2, -3., 1, 1, 2., 2, 2, 2.), V(3, 1., 2., 3.)};
// "non-square" fixture
// A = 1 . 2
// 3 4 .
// x = 1 2
// y = 1 2 3
Fixture G{V(2, 1., 2.), S(2, 3, 4, 0, 0, 1., 0, 2, 2., 1, 0, 3., 1, 1, 4.), V(3, 1., 2., 3.)};
SECTION("set from triplets") {
// A = 2 0 -3
// 0 2 0
// 0 0 2
EXPECT(F.A.nonZeros() == 4);
Index outer[4] = {0, 2, 3, 4};
Index inner[4] = {0, 2, 1, 2};
Scalar data[4] = {2., -3., 2., 2.};
EXPECT(equal_sparse_matrix(F.A, outer, inner, data));
}
SECTION("set from triplets with empty rows") {
Index outer[7] = {0, 0, 1, 1, 2, 2, 2};
Index inner[2] = {0, 3};
Scalar data[2] = {1., 2.};
EXPECT(equal_sparse_matrix(S(6, 6, 2, 1, 0, 1., 3, 3, 2.), outer, inner, data));
}
SECTION("set from triplets with rows in wrong order") {
// (not triggering right now since triplets are expected to be sorted)
// EXPECT_THROWS_AS( S(2, 2, 2, 1, 1, 1., 0, 0, 1.), AssertionFailed );
}
SECTION("copy constructor") {
SparseMatrix B(F.A);
EXPECT(B.nonZeros() == 4);
Index outer[4] = {0, 2, 3, 4};
Index inner[4] = {0, 2, 1, 2};
Scalar data[4] = {2., -3., 2., 2.};
EXPECT(equal_sparse_matrix(B, outer, inner, data));
}
SECTION("prune") {
SparseMatrix A(S(3, 3, 5, 0, 0, 0., 0, 2, 1., 1, 0, 0., 1, 1, 2., 2, 2, 0.));
A.prune();
EXPECT(A.nonZeros() == 2);
Index outer[4] = {0, 1, 2, 2};
Index inner[2] = {2, 1};
Scalar data[2] = {1., 2.};
EXPECT(equal_sparse_matrix(A, outer, inner, data));
}
SECTION("row reduction") {
SparseMatrix A(S(4, 3, 6, 0, 0, 2., 0, 2, 1., 1, 0, 7., 1, 1, 2., 2, 2, 1., 3, 1, 3.));
// A
// 2 . 1
// 7 2 .
// . . 1
// . 3 .
std::vector<size_t> p{1, 0};
SparseMatrix B = A.rowReduction(p);
// B
// 7 2 .
// 2 . 1
EXPECT(B.rows() == p.size());
EXPECT(B.nonZeros() == 4);
B.dump(Log::info());
Index outer[3] = {0, 2, 4};
Index inner[4] = {0, 1, 0, 2};
Scalar data[4] = {7., 2., 2., 1.};
EXPECT(equal_sparse_matrix(B, outer, inner, data));
}
SECTION("iterator") {
SparseMatrix A(S(3, 3, 5, 0, 0, 0., 1, 0, 0., 1, 1, 0., 1, 2, 1., 2, 2, 2.));
A.prune();
EXPECT(A.nonZeros() == 2);
// data [ 1 2 ]
// outer [ 0 0 1 2 ]
// inner [ 2 2 ]
Scalar data[2] = {1., 2.};
Index outer[4] = {0, 0, 1, 2};
Index inner[2] = {2, 2};
EXPECT(equal_sparse_matrix(A, outer, inner, data));
SparseMatrix::const_iterator it = A.begin();
// check entry #1
EXPECT(it.row() == 1);
EXPECT(it.col() == 2);
EXPECT(*it == 1.);
// check entry #2
++it;
EXPECT(it.row() == 2);
EXPECT(it.col() == 2);
EXPECT(*it == 2.);
// go past the end
EXPECT(it != A.end());
++it;
EXPECT(it == A.end());
EXPECT(!it);
// go back and re-check entry #1
// (row 0 is empty, should relocate to row 1)
it = A.begin();
EXPECT(it);
EXPECT(it.row() == 1);
EXPECT(it.col() == 2);
EXPECT(*it == 1.);
// go way past the end
it = A.begin(42);
EXPECT(!it);
}
SECTION("transpose square") {
Index outer[4] = {0, 1, 2, 4};
Index inner[4] = {0, 1, 0, 2};
Scalar data[4] = {2., 2., -3., 2.};
SparseMatrix B(F.A);
EXPECT(equal_sparse_matrix(B.transpose(), outer, inner, data));
}
SECTION("transpose non-square") {
Index outer[4] = {0, 2, 3, 4};
Index inner[4] = {0, 1, 1, 0};
Scalar data[4] = {1., 3., 4., 2.};
SparseMatrix B(G.A);
EXPECT(equal_sparse_matrix(B.transpose(), outer, inner, data));
}
SECTION("non-owning allocator") {
SparseMatrix FA(
new allocator::NonOwningAllocator(F.A.rows(), F.A.cols(), F.A.nonZeros(), const_cast<Index*>(F.A.outer()),
const_cast<Index*>(F.A.inner()), const_cast<Scalar*>(F.A.data())));
EXPECT(F.A.outerIndex() == FA.outerIndex());
EXPECT(F.A.inner() == FA.inner());
EXPECT(F.A.data() == FA.data());
SparseMatrix GA(
new allocator::NonOwningAllocator(G.A.rows(), G.A.cols(), G.A.nonZeros(), const_cast<Index*>(G.A.outer()),
const_cast<Index*>(G.A.inner()), const_cast<Scalar*>(G.A.data())));
EXPECT(G.A.outerIndex() == GA.outerIndex());
EXPECT(G.A.inner() == GA.inner());
EXPECT(G.A.data() == GA.data());
}
SECTION("containers allocator") {
SparseMatrix FA(new allocator::StandardContainerAllocator(3, 3, {{{0, 2.}, {2, -3.}}, {{1, 2.}}, {{2, 2.}}}));
EXPECT(equal_sparse_matrix(FA, F.A.outer(), F.A.inner(), F.A.data()));
SparseMatrix GA(new allocator::StandardContainerAllocator(2, 3, {{{0, 1.}, {2, 2.}}, {{0, 3.}, {1, 4.}}}));
EXPECT(equal_sparse_matrix(GA, GA.outer(), G.A.inner(), G.A.data()));
}
}
//----------------------------------------------------------------------------------------------------------------------
CASE("creation with unassigned triplets ( ECKIT-361 )") {
Size N{10};
Size M{8};
Size max_stencil_size = 4;
SECTION("only zero triplets, expects throw") {
std::vector<Triplet> triplets(N * max_stencil_size);
EXPECT_THROWS(SparseMatrix matrix(N, M, triplets));
}
SECTION("mixed zero / non-zero triplets") {
auto compute_row_triplets = [&](Size row) {
std::vector<Triplet> row_triplets(3);
for (Size i = 0; i < 3; ++i) {
row_triplets[i] = Triplet(row, i, 1. / 3.);
}
return row_triplets;
};
auto skip_point = [](Size row) {
if (row == 5) {
return true;
}
return false;
};
std::vector<Triplet> triplets(N * max_stencil_size);
Size nonzeros{0};
for (Size i = 0; i < N; ++i) {
if (!skip_point(i)) {
auto row = compute_row_triplets(i);
for (Size j = 0; j < row.size(); ++j) {
triplets[i * max_stencil_size + j] = row[j];
++nonzeros;
}
}
}
SparseMatrix matrix(N, M, triplets);
EXPECT(matrix.rows() == N);
EXPECT(matrix.cols() == M);
EXPECT(matrix.nonZeros() == nonzeros);
}
}
//----------------------------------------------------------------------------------------------------------------------
} // namespace eckit::test
int main(int argc, char** argv) {
eckit::Main::initialise(argc, argv);
return eckit::testing::run_tests(argc, argv, false);
}
|
