2004-06-29 02:58:13 +00:00
|
|
|
// Boost.Range library
|
|
|
|
//
|
|
|
|
// Copyright Thorsten Ottosen 2003-2004. Use, modification and
|
|
|
|
// distribution is subject to 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)
|
|
|
|
//
|
|
|
|
// For more information, see http://www.boost.org/libs/range/
|
|
|
|
//
|
|
|
|
|
|
|
|
|
2004-07-29 14:20:35 +00:00
|
|
|
#include <boost/config.hpp>
|
|
|
|
|
|
|
|
#if BOOST_WORAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
|
|
|
|
# pragma warn -8091 // supress warning in Boost.Test
|
|
|
|
# pragma warn -8057 // unused argument argc/argv in Boost.Test
|
|
|
|
#endif
|
|
|
|
|
2004-06-29 02:58:13 +00:00
|
|
|
#include <boost/range/rbegin.hpp>
|
|
|
|
#include <boost/range/rend.hpp>
|
|
|
|
#include <boost/range/begin.hpp>
|
|
|
|
#include <boost/range/end.hpp>
|
|
|
|
#include <boost/static_assert.hpp>
|
|
|
|
#include <boost/type_traits.hpp>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
#include <boost/test/test_tools.hpp>
|
|
|
|
#include <vector>
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
using namespace boost;
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
void check_iterator()
|
|
|
|
{
|
|
|
|
typedef vector<char> vec_t;
|
|
|
|
typedef vec_t::iterator iterator;
|
|
|
|
typedef pair<iterator,iterator> pair_t;
|
|
|
|
typedef reverse_iterator_of<pair_t>::type rev_iterator;
|
|
|
|
typedef pair<rev_iterator,rev_iterator> rev_pair_t;
|
|
|
|
|
|
|
|
vec_t vec;
|
|
|
|
pair_t p = make_pair( vec.begin(), vec.end() );
|
|
|
|
rev_pair_t rp = make_pair( rbegin( p ), rend( p ) );
|
|
|
|
char* str = "mutable";
|
|
|
|
const char* cstr = "not mutable";
|
|
|
|
char a[] = "mutable";
|
|
|
|
const char ca[] = "not mutable";
|
|
|
|
wchar_t* wstr = L"mutable";
|
|
|
|
const wchar_t* cwstr= L"not mutable";
|
|
|
|
wchar_t wa[] = L"mutable";
|
|
|
|
const wchar_t cwa[]= L"not mutable";
|
|
|
|
|
|
|
|
BOOST_CHECK( rbegin( vec ) == reverse_iterator_of<vec_t>::type( vec.end() ) );
|
|
|
|
BOOST_CHECK( rend( vec ) == reverse_iterator_of<vec_t>::type( vec.begin() ) );
|
|
|
|
BOOST_CHECK( distance( rbegin( vec ), rend( vec ) ) == distance( begin( vec ), end( vec ) ) );
|
|
|
|
|
|
|
|
BOOST_CHECK( rbegin( p ) == begin( rp ) );
|
|
|
|
BOOST_CHECK( rend( p ) == end( rp ) );
|
|
|
|
BOOST_CHECK( distance( rbegin( p ), rend( p ) ) == distance( begin( rp ), end( rp ) ) );
|
|
|
|
BOOST_CHECK( distance( begin( p ), end( p ) ) == distance( rbegin( rp ), rend( rp ) ) );
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( str ), &*( rend( str ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( str ) - 1 ), &*rbegin( str ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( cstr ), &*( rend( cstr ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( cstr ) - 1 ), &*rbegin( cstr ) );
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( a ), &*( rend( a ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( a ) - 1 ), &*rbegin( a ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( ca ), &*( rend( ca ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( ca ) - 1 ), &*rbegin( ca ) );
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( wstr ), &*( rend( wstr ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( wstr ) - 1 ), &*rbegin( wstr ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( cwstr ), &*( rend( cwstr ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( cwstr ) - 1 ), &*rbegin( cwstr ) );
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( wa ), &*( rend( wa ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( wa ) - 1 ), &*rbegin( wa ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*begin( cwa ), &*( rend( cwa ) - 1 ) );
|
|
|
|
BOOST_CHECK_EQUAL( &*( end( cwa ) - 1 ), &*rbegin( cwa ) );
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include <boost/test/included/unit_test_framework.hpp>
|
|
|
|
|
|
|
|
using boost::unit_test_framework::test_suite;
|
|
|
|
|
|
|
|
test_suite* init_unit_test_suite( int argc, char* argv[] )
|
|
|
|
{
|
|
|
|
test_suite* test = BOOST_TEST_SUITE( "Range Test Suite" );
|
|
|
|
|
|
|
|
test->add( BOOST_TEST_CASE( &check_iterator ) );
|
|
|
|
|
|
|
|
return test;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|