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
|
#include "test.h"
#include <iostream>
#include "btas/range.h"
using std::cout;
using std::endl;
using btas::Range1;
using btas::Range;
using btas::RangeNd;
TEST_CASE("Range1d")
{
Range1 r0;
CHECK(r0.size() == 0);
Range1 r1(5);
CHECK(r1.size() == 5);
long j=0;
for(auto i=r1.begin();i!=r1.end();++i,++j){
CHECK(*i== j);
}
Range1 r2(-1,4);
CHECK(r2.size() == 5);
j=-1;
for(auto i=r2.begin();i!=r2.end();++i,++j){
CHECK(*i== j);
}
Range1 r3(-1,7,2);
CHECK(r3.size() == 4);
j=-1;
for(auto i=r3.begin();i!=r3.end();++i,j+=2){
CHECK(*i== j);
}
}
TEST_CASE("Range")
{
const auto begin = std::array<long, 3>{{-1,-1,-1}};
const auto size = std::array<std::size_t, 3>{{3,2,3}};
SECTION("Default")
{
Range r0;
CHECK(r0.area() == 0);
}
SECTION("Initialized by extents")
{
Range r1(3,2,3);
CHECK(r1.area()== 18);
long j=0;
for(auto i=r1.begin(); i!=r1.end(); ++i) {
//FIXME
//index == tmp can not be compiled.
//const btas::varray<long> tmp={j/6,(j%6)/3,j%3};
const auto index= *i;
// CHECK(index == tmp);
CHECK(index[0] == j/6);
CHECK(index[1] == (j%6)/3);
CHECK(index[2] == j%3);
CHECK(r1.ordinal(*i)== j);
j++;
}
}
SECTION("Fixed-rank Range")
{
RangeNd<blas::Layout::RowMajor, std::array<long, 3> > r3(begin, size);
CHECK(r3.area()== 48);
typedef RangeNd<blas::Layout::RowMajor, std::array<size_t, 3>> Range3d;
Range3d x;
CHECK(x.rank()== 3);
CHECK(x.area()== 0);
Range3d x1(std::array<int,0>{},std::array<int,0>{});
CHECK(x1.rank()== 3);
CHECK(x1.area()== 0);
}
SECTION("Col-major std::vector-based Range")
{
RangeNd<blas::Layout::ColMajor, std::vector<long> > r4(size);
CHECK(r4.area()== 18);
}
SECTION("Initialized by initializer list")
{
Range r5={2,3,4};
CHECK(r5.area()== 24);
Range r6({-1, -1, -1}, {2, 3, 4});
CHECK(r6.area()== 60);
}
SECTION("Ordinal")
{
Range r5={2,3,4};
long j=0;
for(auto i : r5){
CHECK(r5.ordinal(i)== j);
j++;
}
}
SECTION("Permute")
{
const auto p = std::array<size_t, 3>{{2,0,1}};
Range r5={2,3,4};
auto r5p = permute(r5, p);
CHECK(r5p.area()== 24);
long j=0;
for(auto i : r5p){
// ordinal is still in the old order
CHECK(r5p.ordinal(i)== i[1]*12+i[2]*4+i[0]);
CHECK(r5p.ordinal(i)== permute(r5.ordinal(),p)(i) );
CHECK(i[0]==j/6);
CHECK(i[1]==(j%6)/3);
CHECK(i[2]==j%3);
j++;
}
for(auto i: r5p)
for(auto j: r5)
if(i[0]==j[2] && i[1]==j[0] && i[2]==j[1])
CHECK(r5p.ordinal(i)==r5.ordinal(j));
}
SECTION("Diag")
{
Range r({1,1,1},{3,3,4});
for(auto i: diag(r))
CHECK(diag(r).ordinal(i) == r.ordinal(Range::index_type ({i[0],i[0],i[0]})));
RangeNd<blas::Layout::ColMajor> rc({1,1,1},{3,3,4});
for(auto i : diag(rc))
CHECK(diag(rc).ordinal(i) == rc.ordinal(RangeNd<blas::Layout::ColMajor>::index_type ({i[0],i[0],i[0]})));
}
SECTION("Group and Flatten")
{
Range r({2,3,3});
auto gr= btas::group(r,0,2);
CHECK(gr.rank()== 2);
CHECK(gr.area()== 18);
for(const auto& i : r){
//FIXME
//In current code, the grouped indices are recalculated to give a new index. The new index begins with 0.
//I am not sure whether it is necessary.
//FIXME
//r.extent(1) is 3.
//But I have to set it 3, rather than use r.extent(1)
//CHECK(r.ordinal(i) == gr.ordinal(Range::index_type ({(i[0]-r.lobound()[0])*r.extent(1)+(i[1]-r.lobound()[1]),i[2]})));
CHECK(r.ordinal(i) == gr.ordinal(Range::index_type ({(i[0]-r.lobound()[0])*3+(i[1]-r.lobound()[1]),i[2]})));
}
auto fr =btas::flatten(r);
CHECK(fr.rank() == 1);
CHECK(fr.area()== 18);
for(const auto& i : r){
CHECK(r.ordinal(i) == fr.ordinal(Range::index_type{static_cast<Range::index_type::value_type>(i[0]*r.extent(1)*r.extent(2)+i[1]*r.extent(2)+i[2])}));
}
}
SECTION("TieIndex")
{
Range r({0,0,0,0},{3,4,4,4});
auto tr= btas::tieIndex(r,0,2);
CHECK(tr.rank()== 3);
CHECK(tr.area()== 48);
for(auto i : tr)
CHECK(tr.ordinal(i) == r.ordinal(Range::index_type {i[0],i[1],i[0],i[2]}));
}
}
|
