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
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
/*
[auto_generated]
libs/numeric/odeint/test/adaptive_iterator.cpp
[begin_description]
This file tests the adaptive iterators.
[end_description]
Copyright 2012-2013 Karsten Ahnert
Copyright 2012-2013 Mario Mulansky
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or
copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#define BOOST_TEST_MODULE odeint_adaptive_iterator
#include <iterator>
#include <algorithm>
#include <vector>
#include <boost/numeric/odeint/config.hpp>
#include <boost/array.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/range/algorithm/for_each.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/numeric/odeint/iterator/adaptive_iterator.hpp>
#include "dummy_steppers.hpp"
#include "dummy_odes.hpp"
#include "dummy_observers.hpp"
namespace mpl = boost::mpl;
using namespace boost::numeric::odeint;
typedef dummy_stepper::state_type state_type;
typedef dummy_stepper::value_type value_type;
BOOST_AUTO_TEST_SUITE( adaptive_iterator_test )
typedef mpl::vector<
dummy_controlled_stepper
, dummy_dense_output_stepper
> dummy_steppers;
BOOST_AUTO_TEST_CASE( copy_controlled_stepper_iterator )
{
typedef adaptive_iterator< dummy_controlled_stepper , empty_system , state_type > iterator_type;
state_type x = {{ 1.0 }};
iterator_type iter1( dummy_controlled_stepper() , empty_system() , x );
iterator_type iter2( iter1 );
BOOST_CHECK_EQUAL( &( *iter1 ) , &x );
BOOST_CHECK_EQUAL( &( *iter2 ) , &x );
BOOST_CHECK_EQUAL( &( *iter1 ) , &( *iter2 ) );
BOOST_CHECK( iter1.same( iter2 ) );
++iter1;
++iter2;
BOOST_CHECK_EQUAL( &( *iter1 ) , &x );
BOOST_CHECK_EQUAL( &( *iter2 ) , &x );
BOOST_CHECK_EQUAL( &( *iter1 ) , &( *iter2 ) );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE( copy_dense_output_stepper_iterator )
{
typedef adaptive_iterator< dummy_dense_output_stepper , empty_system , state_type > iterator_type;
state_type x = {{ 1.0 }};
// fix by mario: do not dereference iterators at the end - made iter1 start iterator
iterator_type iter1( dummy_dense_output_stepper() , empty_system() , x , 0.0 , 1.0 , 0.1 );
iterator_type iter2( iter1 );
// fix by mario: iterator dereference now always gives internal state also for dense output, consistent with other iterator implementations
// changed: iterators with dense output stepper do not have an internal state now to avoid a copy
BOOST_CHECK_NE( & (*iter1) , & (*iter2) );
BOOST_CHECK( iter1.same( iter2 ) );
++iter1;
++iter2;
BOOST_CHECK_NE( & (*iter1) , & (*iter2) );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE( copy_dense_output_stepper_iterator_with_reference_wrapper )
{
// bad use case, the same stepper is iterated twice
typedef adaptive_iterator< boost::reference_wrapper< dummy_dense_output_stepper > , empty_system , state_type > iterator_type;
state_type x = {{ 1.0 }};
dummy_dense_output_stepper stepper;
iterator_type iter1( boost::ref( stepper ) , empty_system() , x , 0.0 , 0.9 , 0.1 );
iterator_type iter2( iter1 );
BOOST_CHECK_EQUAL( & (*iter1) , & (*iter2) );
BOOST_CHECK( iter1.same( iter2 ) );
++iter1;
++iter2;
BOOST_CHECK_EQUAL( & (*iter1) , & (*iter2) );
BOOST_CHECK( !iter1.same( iter2 ) ); // they point to the same stepper, there the times will be different
}
BOOST_AUTO_TEST_CASE( assignment_controlled_stepper_iterator )
{
typedef adaptive_iterator< dummy_controlled_stepper , empty_system , state_type > iterator_type;
state_type x1 = {{ 1.0 }} , x2 = {{ 2.0 }};
iterator_type iter1 = iterator_type( dummy_controlled_stepper() , empty_system() , x1 , 0.0 , 1.0 , 0.1 );
iterator_type iter2 = iterator_type( dummy_controlled_stepper() , empty_system() , x2 , 0.0 , 1.0 , 0.2 );
BOOST_CHECK_EQUAL( &(*iter1) , &x1 );
BOOST_CHECK_EQUAL( &(*iter2) , &x2 );
// the iterators are indeed the same as this only checks the time values
BOOST_CHECK( !iter1.same( iter2 ) );
iter2 = iter1;
BOOST_CHECK_EQUAL( &(*iter1) , &x1 );
BOOST_CHECK_EQUAL( &(*iter2) , &x1 );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE( assignment_dense_output_stepper_iterator )
{
typedef adaptive_iterator< dummy_dense_output_stepper , empty_system , state_type > iterator_type;
state_type x1 = {{ 1.0 }};
iterator_type iter1 = iterator_type( dummy_dense_output_stepper() , empty_system() , x1 , 0.0 , 1.0 , 0.1 );
iterator_type iter2 = iterator_type( dummy_dense_output_stepper() , empty_system() , x1 , 0.0 , 1.0 , 0.2 );
BOOST_CHECK_NE( & (*iter1) , & (*iter2) );
BOOST_CHECK( !iter1.same( iter2 ) );
iter2 = iter1;
// fix by mario: iterator dereference now always gives internal state also for dense output, consistent with other iterator implementations
// changed: iterators with dense output stepper do not have an internal state now to avoid a copy
BOOST_CHECK_NE( & (*iter1) , & (*iter2) );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE( assignment_dense_output_stepper_iterator_with_reference_wrapper )
{
typedef adaptive_iterator< boost::reference_wrapper< dummy_dense_output_stepper > , empty_system , state_type > iterator_type;
state_type x1 = {{ 1.0 }};
dummy_dense_output_stepper stepper;
iterator_type iter1 = iterator_type( boost::ref( stepper ) , empty_system() , x1 , 0.0 , 1.0 , 0.1 );
iterator_type iter2 = iterator_type( boost::ref( stepper ) , empty_system() , x1 , 0.0 , 1.0 , 0.2 );
BOOST_CHECK_EQUAL( & (*iter1) , & (*iter2) );
BOOST_CHECK( !iter1.same( iter2 ) );
iter2 = iter1;
BOOST_CHECK_EQUAL( & (*iter1) , & (*iter2) );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE( controlled_stepper_iterator_factory )
{
dummy_controlled_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_adaptive_iterator_begin( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_adaptive_iterator_end( stepper , boost::ref( system ) , x ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-14 );
}
// just test if it compiles
BOOST_AUTO_TEST_CASE( dense_output_stepper_iterator_factory )
{
dummy_dense_output_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_adaptive_iterator_begin( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_adaptive_iterator_end( stepper , boost::ref( system ) , x ) ,
dummy_observer() );
}
BOOST_AUTO_TEST_CASE( controlled_stepper_range )
{
dummy_controlled_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_adaptive_range( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-14 );
}
// just test if it compiles
BOOST_AUTO_TEST_CASE( dense_output_stepper_range )
{
dummy_dense_output_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_adaptive_range( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
dummy_observer() );
}
BOOST_AUTO_TEST_CASE( controlled_stepper_iterator_with_reference_wrapper_factory )
{
dummy_controlled_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_adaptive_iterator_begin( boost::ref( stepper ) , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_adaptive_iterator_end( boost::ref( stepper ) , boost::ref( system ) , x ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-14 );
}
// just test if it compiles
BOOST_AUTO_TEST_CASE( dense_output_stepper_iterator_with_reference_wrapper_factory )
{
dummy_dense_output_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_adaptive_iterator_begin( boost::ref( stepper ) , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_adaptive_iterator_end( boost::ref( stepper ) , boost::ref( system ) , x ) ,
dummy_observer() );
}
BOOST_AUTO_TEST_CASE( controlled_stepper_range_with_reference_wrapper )
{
dummy_controlled_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_adaptive_range( boost::ref( stepper ) , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-14 );
}
// just test if it compiles
BOOST_AUTO_TEST_CASE( dense_output_stepper_range_with_reference_wrapper )
{
dummy_dense_output_stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_adaptive_range( boost::ref( stepper ) , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
dummy_observer() );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( transitivity1 , Stepper , dummy_steppers )
{
typedef adaptive_iterator< Stepper , empty_system , state_type > stepper_iterator;
state_type x = {{ 1.0 }};
stepper_iterator first1( Stepper() , empty_system() , x , 2.5 , 2.0 , 0.1 );
stepper_iterator last1( Stepper() , empty_system() , x );
stepper_iterator last2( Stepper() , empty_system() , x );
BOOST_CHECK( first1 == last1 );
BOOST_CHECK( first1 == last2 );
BOOST_CHECK( last1 == last2 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_algorithm , Stepper , dummy_steppers )
{
typedef adaptive_iterator< Stepper , empty_system , state_type > stepper_iterator;
state_type x = {{ 1.0 }};
std::vector< state_type > res;
stepper_iterator first( Stepper() , empty_system() , x , 0.0 , 0.35 , 0.1 );
stepper_iterator last( Stepper() , empty_system() , x );
std::copy( first , last , std::back_insert_iterator< std::vector< state_type > >( res ) );
BOOST_CHECK_EQUAL( res.size() , size_t( 5 ) );
BOOST_CHECK_CLOSE( res[0][0] , 1.0 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[1][0] , 1.25 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[2][0] , 1.5 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[3][0] , 1.75 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[4][0] , 2.0 , 1.0e-14 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_algorithm_with_factory , Stepper , dummy_steppers )
{
state_type x = {{ 1.0 }};
std::vector< state_type > res;
std::copy( make_adaptive_iterator_begin( Stepper() , empty_system() , x , 0.0 , 0.35 , 0.1 ) ,
make_adaptive_iterator_end( Stepper() , empty_system() , x ) ,
std::back_insert_iterator< std::vector< state_type > >( res ) );
BOOST_CHECK_EQUAL( res.size() , size_t( 5 ) );
BOOST_CHECK_CLOSE( res[0][0] , 1.0 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[1][0] , 1.25 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[2][0] , 1.5 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[3][0] , 1.75 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[4][0] , 2.0 , 1.0e-14 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_algorithm_with_range_factory , Stepper , dummy_steppers )
{
state_type x = {{ 1.0 }};
std::vector< state_type > res;
boost::range::copy( make_adaptive_range( Stepper() , empty_system() , x , 0.0 , 0.35 , 0.1 ) ,
std::back_insert_iterator< std::vector< state_type > >( res ) );
BOOST_CHECK_EQUAL( res.size() , size_t( 5 ) );
BOOST_CHECK_CLOSE( res[0][0] , 1.0 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[1][0] , 1.25 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[2][0] , 1.5 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[3][0] , 1.75 , 1.0e-14 );
BOOST_CHECK_CLOSE( res[4][0] , 2.0 , 1.0e-14 );
}
BOOST_AUTO_TEST_SUITE_END()
|
