w4kek/WSJT-X
1
0
Fork 0
mirror of https://github.com/saitohirga/WSJT-X.git synced 2025-10-30 20:40:28 -04:00
Code Issues Packages Projects Releases Wiki Activity
WSJT-X/boost/libs/numeric/odeint/test/const_step_iterator.cpp

233 lines
7.8 KiB
C++
Raw Blame History

/*
[auto_generated]
libs/numeric/odeint/test/const_step_iterator.cpp
[begin_description]
This file tests the const step iterator.
[end_description]
Copyright 2012-2013 Karsten Ahnert
Copyright 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_const_step_iterator
#include <iterator>
#include <algorithm>
#include <vector>
#include <boost/numeric/odeint/config.hpp>
#include <boost/array.hpp>
#include <boost/range/algorithm/for_each.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/numeric/odeint/iterator/const_step_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( const_step_iterator_test )
typedef mpl::vector<
dummy_stepper
, dummy_dense_output_stepper
> dummy_steppers;
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_stepper_iterator , Stepper , dummy_steppers )
{
typedef const_step_iterator< Stepper , empty_system , state_type > iterator_type;
state_type x = {{ 1.0 }};
iterator_type iter1 = iterator_type( Stepper() , empty_system() , x , 0.0 , 0.999 , 0.1 );
iterator_type iter2 = iter1;
BOOST_CHECK_EQUAL( &(*iter1) , &(*iter2) );
BOOST_CHECK_EQUAL( &(*iter1) , &x );
BOOST_CHECK( iter1.same( iter2 ) );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( assignment_stepper_iterator , Stepper , dummy_steppers )
{
typedef const_step_iterator< Stepper , empty_system , state_type > iterator_type;
state_type x1 = {{ 1.0 }} , x2 = {{ 2.0 }};
iterator_type iter1 = iterator_type( Stepper() , empty_system() , x1 , 0.0 , 1.0 , 0.1 );
iterator_type iter2 = iterator_type( Stepper() , empty_system() , x2 , 0.0 , 1.0 , 0.2 );
BOOST_CHECK_EQUAL( &(*iter1) , &x1 );
BOOST_CHECK_EQUAL( &(*iter2) , &x2 );
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_TEMPLATE( stepper_iterator_factory , Stepper , dummy_steppers )
{
Stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_const_step_iterator_begin( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_const_step_iterator_end( stepper , boost::ref( system ) , x ) ,
dummy_observer() );
// dummy_steppers just add 0.25 at each step, the above for_each leads to 10 do_step calls so x should be 3.5
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-13 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( stepper_range , Stepper , dummy_steppers )
{
Stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_const_step_range( stepper , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-13 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( stepper_iterator_with_reference_wrapper_factory , Stepper , dummy_steppers )
{
Stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
std::for_each(
make_const_step_iterator_begin( boost::ref( stepper ) , boost::ref( system ) , x , 0.0 , 1.0 , 0.1 ) ,
make_const_step_iterator_end( boost::ref( stepper ) , boost::ref( system ) , x ) ,
dummy_observer() );
BOOST_CHECK_CLOSE( x[0] , 3.5 , 1.0e-13 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( stepper_range_with_reference_wrapper , Stepper , dummy_steppers )
{
Stepper stepper;
empty_system system;
state_type x = {{ 1.0 }};
boost::for_each( make_const_step_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-13 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( transitivity1 , Stepper , dummy_steppers )
{
typedef const_step_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 );
first1 = stepper_iterator( Stepper() , empty_system() , x , 2.0 , 2.0 , 0.1 );
last1 = stepper_iterator( Stepper() , empty_system() , x );
BOOST_CHECK( first1 != last1 );
BOOST_CHECK( ++first1 == last1 );
}
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_algorithm , Stepper , dummy_steppers )
{
typedef const_step_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( 4 ) );
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( x[0] , 1.75 , 1.0e-14 ); // the iterator should not iterate over the end
}
BOOST_AUTO_TEST_CASE_TEMPLATE( copy_algorithm_negative_time_step , Stepper , dummy_steppers )
{
typedef const_step_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.3 , -0.05 , -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( 4 ) );
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( x[0] , 1.75 , 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_const_step_iterator_begin( Stepper() , empty_system() , x , 0.0 , 0.35 , 0.1 ) ,
make_const_step_iterator_end( Stepper() , empty_system() , x ) ,
std::back_insert_iterator< std::vector< state_type > >( res ) );
BOOST_CHECK_EQUAL( res.size() , size_t( 4 ) );
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( x[0] , 1.75 , 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_const_step_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( 4 ) );
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( x[0] , 1.75 , 1.0e-14 );
}
BOOST_AUTO_TEST_SUITE_END()
Reference in New Issue View Git Blame Copy Permalink