DGtal 1.4.0
Loading...
Searching...
No Matches
testHyperRectDomain.cpp
Go to the documentation of this file.
1
33#include <cstdio>
34#include <cmath>
35#include <iostream>
36#include <fstream>
37#include <algorithm>
38#include <numeric>
39#include <iterator>
40
41#include "DGtal/base/Common.h"
42#include "DGtal/kernel/SpaceND.h"
43#include "DGtal/kernel/PointVector.h"
44#include "DGtal/kernel/domains/HyperRectDomain.h"
45#include "DGtal/base/CConstBidirectionalRange.h"
46
47#include "DGtalCatch.h"
48
49using namespace DGtal;
50using namespace std;
51
52
54// Simple test of HyperRectDomain construction.
55
56TEST_CASE( "Simple HyperRectDomain", "[domain][4D]" )
57{
58 typedef SpaceND<4> Space4Type;
59 typedef Space4Type::Point Point;
60 typedef Space4Type::RealPoint RealPoint;
61
62 Space4Type::Integer t [] = { 1, 2, 3 , 4};
63 Point a ( t );
64 Space4Type::Integer t2[] = { 5, 5, 3 , 4};
65 Point b ( t2 );
66 double td [] = { 1.1, 2.5, 3 , 4};
67 RealPoint c ( td );
68 double td2[] = { 4.9, 4.5, 3 , 4};
69 RealPoint d ( td2 );
70
71 trace.beginBlock ( "HyperRectDomain init" );
72
73 // Checking that HyperRectDomain is a model of CDomain.
74 typedef HyperRectDomain<Space4Type> HRDomain4;
75 BOOST_CONCEPT_ASSERT(( concepts::CDomain< HRDomain4 > ));
76 BOOST_CONCEPT_ASSERT(( concepts::CConstBidirectionalRange<HRDomain4> ));
77
78 // Empty domain using the default constructor
79 trace.info() << "Empty domain using the default constructor" << std::endl;
80 HyperRectDomain<Space4Type> myEmptyDomain;
81
82 trace.info() << "Empty domain = " << myEmptyDomain << std::endl;
83 REQUIRE( myEmptyDomain.isValid() );
84 REQUIRE( myEmptyDomain.isEmpty() );
85 REQUIRE( myEmptyDomain.size() == 0 );
86 REQUIRE( (myEmptyDomain.end() - myEmptyDomain.begin()) == 0 );
87 REQUIRE( (myEmptyDomain.begin() - myEmptyDomain.end()) == 0 );
88 REQUIRE( (myEmptyDomain.rend() - myEmptyDomain.rbegin()) == 0 );
89 REQUIRE( (myEmptyDomain.rbegin() - myEmptyDomain.rend()) == 0 );
90
91 // Domain characterized by points a and b
92 trace.info() << "Domain characterized by points a and b" << std::endl;
93 HyperRectDomain<Space4Type> myHyperRectDomain ( a, b );
94
95 trace.info() << "Domain = " << myHyperRectDomain << std::endl;
96 REQUIRE( myHyperRectDomain.isValid() );
97 REQUIRE( myHyperRectDomain.lowerBound() == a );
98 REQUIRE( myHyperRectDomain.upperBound() == b );
99
100 trace.info() << "Domain size = " << myHyperRectDomain.size() << std::endl;
101 REQUIRE( myHyperRectDomain.size() == 20 );
102 REQUIRE( (myHyperRectDomain.end() - myHyperRectDomain.begin()) == 20 );
103 REQUIRE( (myHyperRectDomain.begin() - myHyperRectDomain.end()) == -20 );
104 REQUIRE( (myHyperRectDomain.rend() - myHyperRectDomain.rbegin()) == 20 );
105 REQUIRE( (myHyperRectDomain.rbegin() - myHyperRectDomain.rend()) == -20 );
106
107 // Domain initialized with RealPoint
108 trace.info() << "Domain initialized with RealPoint" << std::endl;
109 HyperRectDomain<Space4Type> myHyperRectDomain_rr ( c, d );
110 trace.info() << "Domain = " << myHyperRectDomain_rr << std::endl;
111 REQUIRE( myHyperRectDomain_rr.isValid() );
112 REQUIRE( myHyperRectDomain_rr.lowerBound() == myHyperRectDomain.lowerBound() );
113 REQUIRE( myHyperRectDomain_rr.upperBound() == myHyperRectDomain.upperBound() );
114
115 HyperRectDomain<Space4Type> myHyperRectDomain_ir ( a, d );
116 trace.info() << "Domain = " << myHyperRectDomain_ir << std::endl;
117 REQUIRE( myHyperRectDomain_ir.isValid() );
118 REQUIRE( myHyperRectDomain_ir.lowerBound() == myHyperRectDomain.lowerBound() );
119 REQUIRE( myHyperRectDomain_ir.upperBound() == myHyperRectDomain.upperBound() );
120
121 HyperRectDomain<Space4Type> myHyperRectDomain_ri ( c, b );
122 trace.info() << "Domain = " << myHyperRectDomain_ri << std::endl;
123 REQUIRE( myHyperRectDomain_ri.isValid() );
124 REQUIRE( myHyperRectDomain_ri.lowerBound() == myHyperRectDomain.lowerBound() );
125 REQUIRE( myHyperRectDomain_ri.upperBound() == myHyperRectDomain.upperBound() );
126
127 trace.endBlock();
128
129 // Test Copy Constructor
130 trace.beginBlock("Test Copy Constructor");
131 HyperRectDomain<Space4Type> myHyperRectDomainBis( myHyperRectDomain );
132 trace.info() << "Domain = " << myHyperRectDomainBis << std::endl;
133 trace.info() << "Domain size = " << myHyperRectDomainBis.size() << std::endl;
134 REQUIRE( myHyperRectDomainBis.isValid() );
135 REQUIRE( myHyperRectDomainBis.lowerBound() == myHyperRectDomain.lowerBound() );
136 REQUIRE( myHyperRectDomainBis.upperBound() == myHyperRectDomain.upperBound() );
137 REQUIRE( myHyperRectDomainBis.size() == 20 );
138 trace.endBlock();
139
140 // Test Assignement
141 trace.beginBlock("Test Assignement");
142 HyperRectDomain<Space4Type> myHyperRectDomainTer;
143 myHyperRectDomainTer = myHyperRectDomain;
144 trace.info() << "Domain = " << myHyperRectDomainTer << std::endl;
145 trace.info() << "Domain size = " << myHyperRectDomainTer.size() << std::endl;
146 REQUIRE( myHyperRectDomainTer.isValid() );
147 REQUIRE( myHyperRectDomainTer.lowerBound() == myHyperRectDomain.lowerBound() );
148 REQUIRE( myHyperRectDomainTer.upperBound() == myHyperRectDomain.upperBound() );
149 REQUIRE( myHyperRectDomainTer.size() == 20 );
150 trace.endBlock();
151}
152
154// Checking iterators
155
157template <
158 typename Iterator,
159 typename Point,
160 typename Domain,
161 typename Dimension
162>
164 Iterator & it, Iterator const& it_begin, Iterator const& it_end,
165 typename std::iterator_traits<Iterator>::difference_type & cnt_begin,
166 Point & pt, Domain const& domain, std::vector<Dimension> const& dimensions, std::size_t id,
167 bool forward)
168{
169 if (id == 0)
170 {
171 trace.warning() << *it << std::endl;
172 REQUIRE( it != it_end );
173 REQUIRE( pt == *it );
174 REQUIRE( std::distance(it_begin, it) == cnt_begin );
175 REQUIRE( std::distance(it, it_begin) == -cnt_begin );
176 INFO( *(it_begin + cnt_begin) << " == " << *it );
177 REQUIRE( it_begin + cnt_begin == it );
178 INFO( *(it - cnt_begin) << " == " << *it_begin);
179 REQUIRE( it - cnt_begin == it_begin );
180 ++it;
181 ++cnt_begin;
182 return;
183 }
184
185 --id;
186
187 const auto d = dimensions[id];
188
189 if (forward)
190 {
191 while ( pt[d] <= domain.upperBound()[d] )
192 {
193 testIteratorHelperImpl(it, it_begin, it_end, cnt_begin, pt, domain, dimensions, id, forward);
194 ++pt[d];
195 }
196
197 pt[d] = domain.lowerBound()[d];
198 }
199 else
200 {
201 while ( pt[d] >= domain.lowerBound()[d] )
202 {
203 testIteratorHelperImpl(it, it_begin, it_end, cnt_begin, pt, domain, dimensions, id, forward);
204 --pt[d];
205 }
206
207 pt[d] = domain.upperBound()[d];
208 }
209}
210
211template <
212 typename Iterator,
213 typename Point,
214 typename Domain,
215 typename Dimension
216>
218 Iterator const& it_begin, Iterator const& it_end,
219 Point pt, Domain const& domain, std::vector<Dimension> const& dimensions,
220 bool forward = true)
221{
222 Iterator it = it_begin;
223 typename std::iterator_traits<Iterator>::difference_type cnt_begin = 0;
224
226 it, it_begin, it_end, cnt_begin,
227 pt, domain, dimensions, dimensions.size(),
228 forward);
229 REQUIRE( it == it_end );
230}
231
232template <
233 typename Iterator,
234 typename Point,
235 typename Domain
236>
238 Iterator const& it_begin, Iterator const& it_end,
239 Point pt, Domain const& domain, bool forward = true)
240{
241 std::vector<Dimension> dimensions(Domain::dimension);
242 std::iota(dimensions.begin(), dimensions.end(), Dimension(0));
243
244 testIteratorHelper(it_begin, it_end, pt, domain, dimensions, forward);
245}
246
247template <
248 typename Point
249>
250void testIterator(Point const& a, Point const& b, Point const& c)
251{
254
255 Domain domain(a, b);
256 trace.info() << "Domain = " << domain << std::endl;
257
258 trace.emphase() << "Iterator" << std::endl;
260
261 trace.emphase() << "Reverse iterator" << std::endl;
263
264 trace.emphase() << "Iterator from starting point" << std::endl;
266
267 trace.emphase() << "Reverse iterator from starting point" << std::endl;
269
270 trace.emphase() << "Iterator on reversed dimension order: " << std::endl;
271 std::vector<Dimension> dimensions(Point::dimension);
272 std::iota(dimensions.rbegin(), dimensions.rend(), Dimension(0));
273 const auto range = domain.subRange(dimensions);
274 testIteratorHelper(range.begin(), range.end(), domain.lowerBound(), domain, dimensions);
275
276 trace.emphase() << "Reverse iterator on reversed dimension order: " << std::endl;
277 testIteratorHelper(range.rbegin(), range.rend(), domain.upperBound(), domain, dimensions, false);
278
279 trace.emphase() << "Iterator on reversed dimension order and from a starting point: " << std::endl;
280 const auto range2 = domain.subRange(dimensions);
281 testIteratorHelper(range2.begin(c), range2.end(), c, domain, dimensions);
282
283 trace.emphase() << "Reverse iterator on reversed dimension order and from a starting point: " << std::endl;
284 testIteratorHelper(range2.rbegin(c), range2.rend(), c, domain, dimensions, false);
285
286 trace.emphase() << "Iterator along one dimension: " << std::endl;
287 const auto range3 = domain.subRange({1});
288 const std::vector<Dimension> one_dimension({1});
289 testIteratorHelper(range3.begin(), range3.end(), domain.lowerBound(), domain, one_dimension);
290
291 trace.emphase() << "Reverse iterator along one dimension: " << std::endl;
292 auto upper_one_dim = domain.lowerBound();
293 upper_one_dim.partialCopy(domain.upperBound(), one_dimension);
294 testIteratorHelper(range3.rbegin(), range3.rend(), upper_one_dim, domain, one_dimension, false);
295
296 trace.emphase() << "Iterator along one dimension and from a starting point: " << std::endl;
297 const auto range4 = domain.subRange({1}, c);
298 testIteratorHelper(range4.begin(c), range4.end(), c, domain, one_dimension);
299
300 trace.emphase() << "Reverse iterator along one dimension and from a starting point: " << std::endl;
301 testIteratorHelper(range4.rbegin(c), range4.rend(), c, domain, one_dimension, false);
302}
303
304TEST_CASE( "Iterator 2D", "[iterator][2D]" )
305{
306 using Space = SpaceND<2>;
307 using Point = Space::Point;
308
309 Point a (1, 1);
310 Point b (4, 5);
311 Point c (2, 2);
312
313 trace.beginBlock( "Iterator 2D" );
314 testIterator(a, b, c);
315 trace.endBlock();
316}
317
318TEST_CASE( "Iterator 4D", "[iterator][4D]" )
319{
320 using Space = SpaceND<4>;
321 using Point = Space::Point;
322
323 Point a({1, 1, 1, 1});
324 Point b({2, 3, 4, 5});
325 Point c({1, 2, 3, 2});
326
327 trace.beginBlock( "Iterator 4D" );
328 testIterator(a, b, c);
329 trace.endBlock();
330}
331
332#ifdef WITH_BIGINTEGER
333TEST_CASE( "Iterator 4D GMP", "[iterator][4D][GMP]" )
334{
336 using Point = Space::Point;
337
338 Point a({1, 1, 1, 1});
339 Point b({2, 3, 4, 5});
340 Point c({1, 2, 3, 2});
341
342 trace.beginBlock( "Iterator 4D using GMP" );
343 testIterator(a, b, c);
344 trace.endBlock();
345}
346#endif
347
348TEST_CASE( "STL compatiblity", "[iterator][4D][STL]" )
349{
350 typedef SpaceND<4> TSpace4D;
351 typedef TSpace4D::Point Point4D;
352 TSpace4D::Integer t[] = {1, 1, 1, 1};
353 Point4D a4D (t);
354 TSpace4D::Integer t2[] = {3, 3, 3, 3};
355 Point4D b4D (t2);
356
357 trace.beginBlock ( "TestSTL Compatibility" );
358
359 HyperRectDomain<TSpace4D> myHyperRectDomain4D ( a4D, b4D );
360 trace.emphase() << myHyperRectDomain4D << std::endl;
361
362 std::copy ( myHyperRectDomain4D.begin(),
363 myHyperRectDomain4D.end(),
364 ostream_iterator<Point4D> ( trace.info(), " " ) );
365
366 trace.info() << std::endl;
367 trace.endBlock();
368}
369
370TEST_CASE( "Empty domain", "[domain][3D][empty]" )
371{
372 typedef SpaceND<3> TSpace;
373 typedef TSpace::Point TPoint;
374 typedef HyperRectDomain<TSpace> TDomain;
375
376 const TDomain nonempty_domain( TPoint::diagonal(0), TPoint::diagonal(0) );
377 REQUIRE( !nonempty_domain.isEmpty() );
378
379 const TDomain default_domain;
380 REQUIRE( default_domain.isEmpty() );
381
382 const TDomain domain( TPoint::diagonal(1), TPoint::diagonal(0) );
384 REQUIRE( domain.size() == 0 );
385 REQUIRE( domain.begin() == domain.end() );
386 REQUIRE( domain.rbegin() == domain.rend() );
387
388 TDomain::ConstSubRange range = domain.subRange( 0, 1, 2, domain.lowerBound() );
389 REQUIRE( range.begin() == range.end() );
390 REQUIRE( range.rbegin() == range.rend() );
391
392 range = domain.subRange( 2, 1, 0, domain.lowerBound() );
393 REQUIRE( range.begin() == range.end() );
394 REQUIRE( range.rbegin() == range.rend() );
395
396 range = domain.subRange( 0, 2, domain.lowerBound() );
397 REQUIRE( range.begin() == range.end() );
398 REQUIRE( range.rbegin() == range.rend() );
399
400 range = domain.subRange( 2, 0, domain.lowerBound() );
401 REQUIRE( range.begin() == range.end() );
402 REQUIRE( range.rbegin() == range.rend() );
403
404 range = domain.subRange( 1, domain.lowerBound() );
405 REQUIRE( range.begin() == range.end() );
406 REQUIRE( range.rbegin() == range.rend() );
407}
408
Aim: Parallelepidec region of a digital space, model of a 'CDomain'.
const ConstIterator & begin() const
const Point & lowerBound() const
ConstReverseIterator rbegin() const
const Point & upperBound() const
ConstSubRange subRange(const std::vector< Dimension > &permutation) const
ConstReverseIterator rend() const
const ConstIterator & end() const
Self & partialCopy(const PointVector< dim, OtherComponent, OtherContainer > &pv, const std::vector< Dimension > &dimensions)
Partial copy of a given PointVector.
PointVector< dim, Integer > Point
Points in DGtal::SpaceND.
Definition SpaceND.h:110
void beginBlock(const std::string &keyword="")
std::ostream & warning()
std::ostream & emphase()
std::ostream & info()
double endBlock()
DGtal is the top-level namespace which contains all DGtal functions and types.
DGtal::uint32_t Dimension
Definition Common.h:136
Trace trace
Definition Common.h:153
STL namespace.
Aim: Defines the concept describing a bidirectional const range.
Aim: This concept represents a digital domain, i.e. a non mutable subset of points of the given digit...
Definition CDomain.h:130
MyPointD Point
void testIterator(Point const &a, Point const &b, Point const &c)
void testIteratorHelper(Iterator const &it_begin, Iterator const &it_end, Point pt, Domain const &domain, std::vector< Dimension > const &dimensions, bool forward=true)
TEST_CASE("Simple HyperRectDomain", "[domain][4D]")
void testIteratorHelperImpl(Iterator &it, Iterator const &it_begin, Iterator const &it_end, typename std::iterator_traits< Iterator >::difference_type &cnt_begin, Point &pt, Domain const &domain, std::vector< Dimension > const &dimensions, std::size_t id, bool forward)
Checking iterator given then span domain and dimensions order.
Domain domain
HyperRectDomain< Space > Domain
REQUIRE(domain.isInside(aPoint))
PointVector< 3, double > RealPoint