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
|
/*****************************************************************************
*
* Copyright (c) 2003-2020 by The University of Queensland
* http://www.uq.edu.au
*
* Primary Business: Queensland, Australia
* Licensed under the Apache License, version 2.0
* http://www.apache.org/licenses/LICENSE-2.0
*
* Development until 2012 by Earth Systems Science Computational Center (ESSCC)
* Development 2012-2013 by School of Earth Sciences
* Development from 2014-2017 by Centre for Geoscience Computing (GeoComp)
* Development from 2019 by School of Earth and Environmental Sciences
**
*****************************************************************************/
#include <escript/DataTypes.h>
#include "multi_arrayTestCase.h"
#include <boost/multi_array.hpp>
#include <cppunit/TestCaller.h>
#include <iostream>
using namespace CppUnit;
using namespace std;
void multi_arrayTestCase::testAll()
{
//
// Test boost multi_array
typedef boost::multi_array<double, 3> ArrayType;
typedef ArrayType::index_range range;
ArrayType testArr(boost::extents[1][2][3]);
cout << endl;
for (ArrayType::index i=0;i!=1;++i) {
for (ArrayType::index j=0;j!=2;++j) {
for (ArrayType::index k=0;k!=3;++k) {
testArr[i][j][k]=k+j*3+i*(1*2);
cout << "(" << i << "," << j << "," << k << ") "
<< testArr[i][j][k] << endl;
}
}
}
ArrayType::index_gen indices;
ArrayType::array_view<2>::type OneView=testArr[ indices[range()][range()][1] ];
for (ArrayType::index i=0;i!=1;++i) {
for (ArrayType::index j=0;j!=2;++j) {
cout << "(" << i << "," << j << ",1) " << OneView[i][j] << endl;
}
}
}
TestSuite* multi_arrayTestCase::suite ()
{
TestSuite *testSuite = new TestSuite("multi_arrayTestCase");
testSuite->addTest(new TestCaller<multi_arrayTestCase>(
"testAll",&multi_arrayTestCase::testAll));
return testSuite;
}
|
