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
|
//# tExprGroupArray.cc: Test program for the grouping aggregate array functions
//# Copyright (C) 2013
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This program is free software; you can redistribute it and/or modify it
//# under the terms of the GNU General Public License as published by the Free
//# Software Foundation; either version 2 of the License, or (at your option)
//# any later version.
//#
//# This program is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
//# more details.
//#
//# You should have received a copy of the GNU General Public License along
//# with this program; if not, write to the Free Software Foundation, Inc.,
//# 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: casa-feedback@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
#include <casacore/casa/Containers/Record.h>
#include <casacore/tables/TaQL/ExprNode.h>
#include <casacore/tables/TaQL/ExprNodeSet.h>
#include <casacore/tables/TaQL/ExprAggrNodeArray.h>
#include <casacore/tables/TaQL/ExprGroupAggrFunc.h>
#include <casacore/tables/TaQL/ExprGroupAggrFuncArray.h>
#include <casacore/tables/TaQL/RecordExpr.h>
#include <casacore/tables/TaQL/TableExprIdAggr.h>
#include <casacore/casa/Arrays/Cube.h>
#include <casacore/casa/Arrays/Matrix.h>
#include <casacore/casa/Arrays/Vector.h>
#include <casacore/casa/Arrays/MatrixIter.h>
#include <casacore/casa/Arrays/ArrayMath.h>
#include <casacore/casa/Arrays/ArrayPartMath.h>
#include <casacore/casa/Arrays/ArrayLogical.h>
#include <casacore/casa/IO/ArrayIO.h>
#include <casacore/casa/Arrays/ArrayUtil.h>
#include <casacore/casa/BasicSL/Constants.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/iostream.h>
#include <vector>
#include <casacore/casa/namespace.h>
// <summary>
// Test program for class TableExprAggrNodeArray.
// </summary>
// Keeps track if errors occurred.
Bool foundError = False;
#define checkFailure(STR,EXPR)\
{\
bool failed = False;\
try {\
TableExprNode n(EXPR);\
} catch (std::exception&) {\
failed = True;\
}\
if (!failed) {\
cout << STR << ": was expected to fail, but did not" << endl;\
}\
}
void checkLazy (const TableExprNode& expr,
const std::vector<Record>& recs,
const Array<Bool>& expVal, const String& str)
{
cout << "Test Bool " << str << endl;
// Get the aggregation node.
TableExprAggrNodeArray& aggr = const_cast<TableExprAggrNodeArray&>
(dynamic_cast<const TableExprAggrNodeArray&>(*expr.getRep().get()));
TableExprGroupExprId funcid(0);
for (uInt i=0; i<recs.size(); ++i) {
TableExprId id(recs[i]);
funcid.apply (id);
}
funcid.finish();
std::shared_ptr<TableExprGroupFuncBase> func = aggr.makeGroupAggrFunc();
MArray<Bool> val = func->getArrayBool(*funcid.getIds());
if (!allEQ (val.array(), expVal)) {
foundError = True;
cout << str << ": found value " << val.array() << "; expected "
<< expVal << endl;
}
}
void checkLazy (const TableExprNode& expr,
const std::vector<Record>& recs,
const Array<Int64>& expVal, const String& str)
{
cout << "Test Int " << str << endl;
// Get the aggregation node.
TableExprAggrNodeArray& aggr = const_cast<TableExprAggrNodeArray&>
(dynamic_cast<const TableExprAggrNodeArray&>(*expr.getRep().get()));
TableExprGroupExprId funcid(0);
for (uInt i=0; i<recs.size(); ++i) {
TableExprId id(recs[i]);
funcid.apply (id);
}
funcid.finish();
std::vector<std::shared_ptr<TableExprGroupFuncSet>> funcSets;
funcSets.push_back (std::shared_ptr<TableExprGroupFuncSet>(new TableExprGroupFuncSet()));
std::shared_ptr<TableExprGroupFuncBase> func = aggr.makeGroupAggrFunc();
funcSets[0]->add (func);
MArray<Int64> val = func->getArrayInt(*funcid.getIds());
if (!allEQ (val.array(), expVal)) {
foundError = True;
cout << str << ": found value " << val.array() << "; expected "
<< expVal << endl;
}
std::vector<std::shared_ptr<std::vector<TableExprId>>> ids(1, funcid.getIds());
std::shared_ptr<TableExprGroupResult> groupResult(new TableExprGroupResult(funcSets, ids));
TableExprIdAggr aid(groupResult);
aid.setRownr (0);
MArray<Int64> val2 = aggr.getArrayInt (aid);
if (!allEQ (val2.array(), expVal)) {
foundError = True;
cout << str << ": found value " << val2.array() << "; expected "
<< expVal << endl;
}
}
void checkLazy (const TableExprNode& expr,
const std::vector<Record>& recs,
const Array<Double>& expVal, const String& str)
{
cout << "Test Double " << str << endl;
// Get the aggregation node.
TableExprAggrNodeArray& aggr = const_cast<TableExprAggrNodeArray&>
(dynamic_cast<const TableExprAggrNodeArray&>(*expr.getRep().get()));
TableExprGroupExprId funcid(0);
for (uInt i=0; i<recs.size(); ++i) {
TableExprId id(recs[i]);
funcid.apply (id);
}
funcid.finish();
std::shared_ptr<TableExprGroupFuncBase> func = aggr.makeGroupAggrFunc();
MArray<Double> val = func->getArrayDouble(*funcid.getIds());
if (!allNear (val.array(), expVal, 1.e-10)) {
foundError = True;
cout << str << ": found value " << val.array() << "; expected "
<< expVal << endl;
}
}
void checkLazy (const TableExprNode& expr,
const std::vector<Record>& recs,
const Array<DComplex>& expVal, const String& str)
{
cout << "Test DComplex " << str << endl;
// Get the aggregation node.
TableExprAggrNodeArray& aggr = const_cast<TableExprAggrNodeArray&>
(dynamic_cast<const TableExprAggrNodeArray&>(*expr.getRep().get()));
TableExprGroupExprId funcid(0);
for (uInt i=0; i<recs.size(); ++i) {
TableExprId id(recs[i]);
funcid.apply (id);
}
funcid.finish();
std::shared_ptr<TableExprGroupFuncBase> func = aggr.makeGroupAggrFunc();
MArray<DComplex> val = func->getArrayDComplex(*funcid.getIds());
if (!allNear (val.array(), expVal, 1.e-10)) {
foundError = True;
cout << str << ": found value " << val.array() << "; expected "
<< expVal << endl;
}
}
void checkHist (const TableExprNode& expr,
const std::vector<Record>& recs,
const Array<Int64>& expVal)
{
cout << "Test Double ghist " << endl;
// Get the aggregation node.
TableExprAggrNodeArray& aggr = const_cast<TableExprAggrNodeArray&>
(dynamic_cast<const TableExprAggrNodeArray&>(*expr.getRep().get()));
std::shared_ptr<TableExprGroupFuncBase> func = aggr.makeGroupAggrFunc();
for (uInt i=0; i<recs.size(); ++i) {
TableExprId id(recs[i]);
func->apply (id);
}
func->finish();
MArray<Int64> val = func->getArrayInt(std::vector<TableExprId>());
if (!allEQ (val.array(), expVal)) {
foundError = True;
cout << "ghist: found value " << val.array() << "; expected "
<< expVal << endl;
}
}
void doBoolArr()
{
// Define an Array with values.
Cube<Bool> arr(2,3,4);
arr = False; arr(0,1,3) = True; arr(0,2,2) = True;
// Define records containing equal parts of the array.
std::vector<Record> recs(arr.shape()[2]);
MatrixIterator<Bool> iter(arr);
int i=0;
while (!iter.pastEnd()) {
recs[i++].define ("fld", iter.matrix());
iter.next();
}
// Form the expression node from the record field.
TableExprNode expr = makeRecordExpr (recs[0], "fld");
checkLazy (TableExprNode::newFunctionNode(TableExprFuncNode::gaggrFUNC, expr),
recs, arr, "gaggr");
}
void doIntArr()
{
// Define an Array with values.
Cube<Int64> arr(20,30,40);
indgen (arr);
// Define records containing equal parts of the array.
std::vector<Record> recs(arr.shape()[2]);
MatrixIterator<Int64> iter(arr);
int i=0;
while (!iter.pastEnd()) {
recs[i++].define ("fld", iter.matrix());
iter.next();
}
// Form the expression node from the record field.
TableExprNode expr = makeRecordExpr (recs[0], "fld");
checkLazy (TableExprNode::newFunctionNode(TableExprFuncNode::gaggrFUNC, expr),
recs, arr, "gaggr");
}
void doDoubleArr()
{
// Define an Array with values.
Cube<Double> arr(5,3,1);
indgen (arr, 10., 2.);
// Define records containing equal parts of the array.
std::vector<Record> recs(arr.shape()[2]);
MatrixIterator<Double> iter(arr);
int i=0;
while (!iter.pastEnd()) {
recs[i++].define ("fld", iter.matrix());
iter.next();
}
// Form the expression node from the record field.
TableExprNode expr = makeRecordExpr (recs[0], "fld");
checkLazy (TableExprNode::newFunctionNode(TableExprFuncNode::gaggrFUNC, expr),
recs, arr, "gaggr");
// Do a test of the histogram function (8 bins between 12 and 36).
Vector<Int64> hist(10, 0);
for (uInt i=0; i<arr.size(); ++i) {
Double v = arr.data()[i];
if (v < 12) {
hist[0]++;
} else if (v > 36) {
hist[9]++;
} else {
hist[1 + int((v-12)/3)]++;
}
}
TableExprNodeSet set;
set.add (TableExprNodeSetElem(expr));
set.add (TableExprNodeSetElem(8));
set.add (TableExprNodeSetElem(12.));
set.add (TableExprNodeSetElem(36.));
checkHist (TableExprNode::newFunctionNode(TableExprFuncNode::ghistFUNC,
set, TableExprInfo()),
recs, hist);
}
void doDComplexArr()
{
// Define an Array with values.
Cube<DComplex> arr(5,3,8);
indgen (arr, DComplex(0.1, -0.3), DComplex(-1.3, 3.5));
// Define records containing equal parts of the array.
std::vector<Record> recs(arr.shape()[2]);
MatrixIterator<DComplex> iter(arr);
int i=0;
while (!iter.pastEnd()) {
recs[i++].define ("fld", iter.matrix());
iter.next();
}
// Form the expression node from the record field.
TableExprNode expr = makeRecordExpr (recs[0], "fld");
checkLazy (TableExprNode::newFunctionNode(TableExprFuncNode::gaggrFUNC, expr),
recs, arr, "gaggr");
}
int main()
{
try {
doBoolArr();
doIntArr();
doDoubleArr();
doDComplexArr();
} catch (std::exception& x) {
cout << "Unexpected exception: " << x.what() << endl;
return 1;
} catch (...) {
cout << "Unexpected unknown exception" << endl;
return 1;
}
if (foundError) {
cout << "Some unexpected results were found" << endl;
return 1;
}
cout << "OK" << endl;
return 0;
}
|
