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
|
//------------------------------------------------------------------------------
// This file is part of the OpenStructure project <www.openstructure.org>
//
// Copyright (C) 2008-2020 by the OpenStructure authors
// Copyright (C) 2003-2010 by the IPLT authors
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License as published by the Free
// Software Foundation; either version 3.0 of the License, or (at your option)
// any later version.
// This library 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 Lesser General Public License for more
// details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this library; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
//------------------------------------------------------------------------------
/*
Author: Ansgar Philippsen
*/
#include <iostream>
#include "test_extent.hh"
#include <ost/img/extent.hh>
#include <ost/img/extent_iterator.hh>
using namespace ost::img;
namespace test_extent {
void test_Construction()
{
// using explicit start and end points
Extent e1(Point(-1,-2,-3),Point(3,2,1));
BOOST_CHECK(e1.GetStart()==Point(-1,-2,-3));
BOOST_CHECK(e1.GetEnd()==Point(3,2,1));
BOOST_CHECK(e1.GetSize()==Size(5,5,5));
// using just size -> implicit origin
Extent e2(Size(8,10,13));
BOOST_CHECK(e2.GetStart()==Point(0,0,0));
BOOST_CHECK(e2.GetEnd()==Point(7,9,12));
BOOST_CHECK(e2.GetSize()==Size(8,10,13));
// size and start point
Extent e3(Point(-3,1,3),Size(5,7,2));
BOOST_CHECK(e3.GetStart()==Point(-3,1,3));
BOOST_CHECK(e3.GetEnd()==Point(1,7,4));
BOOST_CHECK(e3.GetSize()==Size(5,7,2));
// size and origin point 1
Extent e4(Size(7,10,6),Point(2,-1,3));
BOOST_CHECK(e4.GetStart()==Point(-1,-5,1));
BOOST_CHECK(e4.GetEnd()==Point(5,4,6));
BOOST_CHECK(e4.GetSize()==Size(7,10,6));
// size and origin point 2
Extent e5(Size(7,10,6),Point(0,0,0));
BOOST_CHECK(e5.GetStart()==Point(-3,-4,-2));
BOOST_CHECK(e5.GetEnd()==Point(3,5,3));
BOOST_CHECK(e5.GetSize()==Size(7,10,6));
// check automatic reordering
Extent e6(Point(3,-1,5),Point(-2,4,1));
BOOST_CHECK(e6.GetStart()==Point(-2,-1,1));
BOOST_CHECK(e6.GetEnd()==Point(3,4,5));
// start and size
Extent e7(Point(-2,1,4),Size(4,2,3));
BOOST_CHECK(e7.GetStart()==Point(-2,1,4));
BOOST_CHECK(e7.GetEnd()==Point(1,2,6));
BOOST_CHECK(e7.GetSize()==Size(4,2,3));
}
void test_Contains()
{
Extent e(Point(-1,-2,-3),Point(0,1,2));
BOOST_CHECK(e.Contains(Point(0,0,0)));
BOOST_CHECK(e.Contains(Point(-1,-2,-3)));
BOOST_CHECK(e.Contains(Point(0,1,2)));
BOOST_CHECK(!e.Contains(Point(-2,0,0)));
BOOST_CHECK(!e.Contains(Point(0,-3,0)));
BOOST_CHECK(!e.Contains(Point(0,0,-4)));
BOOST_CHECK(!e.Contains(Point(1,0,0)));
BOOST_CHECK(!e.Contains(Point(0,2,0)));
BOOST_CHECK(!e.Contains(Point(0,0,3)));
BOOST_CHECK(!e.Contains(Point(-2,-5,10)));
}
void test_WrapAround()
{
Extent e(Point(-1,-2,-3),Point(1,3,3));
Point p1(0,0,0);
Point p1c(0,0,0);
Point p1w(e.WrapAround(p1));
Point p2(-3,-4,5);
Point p2c(0,2,-2);
Point p2w(e.WrapAround(p2));
std::ostringstream msg;
msg << p1c << " != " << p1w;
BOOST_CHECK_MESSAGE(p1c==p1w,msg.str());
msg.str("");
msg << p2c << " != " << p2w;
BOOST_CHECK_MESSAGE(p2c==p2w,msg.str());
}
void test_Mirror()
{
Extent e(Point(-3,-4,2),Point(5,-1,8));
BOOST_CHECK(e.Mirror(Plane::YZ)==Extent(Point(-5,-4,2),Point(3,-1,8)));
BOOST_CHECK(e.Mirror(Plane::XZ)==Extent(Point(-3,1,2),Point(5,4,8)));
BOOST_CHECK(e.Mirror(Plane::XY)==Extent(Point(-3,-4,-8),Point(5,-1,-2)));
}
void test_Iterator()
{
Point p1(-3,4,-1);
Point p2(-1,7,3);
Extent e(p1,p2);
ExtentIterator it(e);
BOOST_CHECK(it.AtStart());
it.ToEnd();
BOOST_CHECK(it.AtEnd());
it.ToStart();
BOOST_CHECK(it.AtStart());
std::ostringstream msg;
for(int w=p1[2];w<=p2[2];++w) {
for(int v=p1[1];v<=p2[1];++v) {
for(int u=p1[0];u<=p2[0];++u) {
msg.str("");
msg << it << " != " << Point(u,v,w);
BOOST_CHECK_MESSAGE( (Point)it == Point(u,v,w),msg.str());
++it;
}
}
}
BOOST_CHECK(it.AtEnd());
--it.ToEnd();
for(int w=p2[2];w>=p1[2];--w) {
for(int v=p2[1];v>=p1[1];--v) {
for(int u=p2[0];u>=p1[0];--u) {
msg.str("");
msg << it << " != " << Point(u,v,w);
BOOST_CHECK_MESSAGE( (Point)it == Point(u,v,w),msg.str());
--it;
}
}
}
BOOST_CHECK(it.AtStart());
int count=0;
for(it.ToEnd();!it.AtStart();--it) {
++count;
}
BOOST_CHECK(count==e.GetVolume());
}
void test_Overlap()
{
Extent e1(Point(-10,5),Point(8,12));
Extent e2(Point(-1,2),Point(12,7));
Extent e3(Point(0,0),Point(1,1));
BOOST_CHECK(Overlap(e1,e2)==Extent(Point(-1,5),Point(8,7)));
BOOST_CHECK_THROW(Overlap(e1,e3), InvalidExtentException);
}
} // namespace
test_suite* CreateExtentTest()
{
using namespace test_extent;
test_suite* ts=BOOST_TEST_SUITE("Extent Test");
ts->add(BOOST_TEST_CASE(&test_Construction));
ts->add(BOOST_TEST_CASE(&test_Contains));
ts->add(BOOST_TEST_CASE(&test_WrapAround));
ts->add(BOOST_TEST_CASE(&test_Mirror));
ts->add(BOOST_TEST_CASE(&test_Iterator));
ts->add(BOOST_TEST_CASE(&test_Overlap));
return ts;
}
|
