62 lines
1.7 KiB
C++
62 lines
1.7 KiB
C++
// stl_byval.cpp
|
|
///
|
|
// (C) Copyright Eric Niebler 2004.
|
|
// Use, modification and distribution are 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)
|
|
|
|
/*
|
|
Revision history:
|
|
25 August 2005 : Initial version.
|
|
*/
|
|
|
|
#include <list>
|
|
#include <boost/test/minimal.hpp>
|
|
#include <boost/foreach.hpp>
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// define the container types, used by utility.hpp to generate the helper functions
|
|
typedef std::list<int> foreach_container_type;
|
|
typedef std::list<int> const foreach_const_container_type;
|
|
typedef int foreach_value_type;
|
|
typedef int &foreach_reference_type;
|
|
typedef int const &foreach_const_reference_type;
|
|
|
|
#include "./utility.hpp"
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// initialize a std::list<int>
|
|
std::list<int> make_list()
|
|
{
|
|
std::list<int> l;
|
|
l.push_back(1);
|
|
l.push_back(2);
|
|
l.push_back(3);
|
|
l.push_back(4);
|
|
l.push_back(5);
|
|
return l;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// define some containers
|
|
//
|
|
std::list<int> my_list = make_list();
|
|
std::list<int> const &my_const_list = my_list;
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// test_main
|
|
//
|
|
int test_main( int, char*[] )
|
|
{
|
|
boost::mpl::false_ *p = BOOST_FOREACH_IS_LIGHTWEIGHT_PROXY(my_list);
|
|
(void)p;
|
|
|
|
// non-const containers by value
|
|
BOOST_CHECK(sequence_equal_byval_n_r(my_list, "\5\4\3\2\1"));
|
|
|
|
// const containers by value
|
|
BOOST_CHECK(sequence_equal_byval_c_r(my_const_list, "\5\4\3\2\1"));
|
|
|
|
return 0;
|
|
}
|