2010-04-04 14:14:12 +00:00
|
|
|
// Boost.Range library
|
|
|
|
//
|
|
|
|
// Copyright Neil Groves 2010. 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/
|
|
|
|
//
|
|
|
|
#include <boost/range/algorithm_ext/push_back.hpp>
|
|
|
|
|
|
|
|
#include <boost/test/test_tools.hpp>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
|
|
|
|
#include <boost/range/iterator.hpp>
|
|
|
|
#include <boost/range/irange.hpp>
|
|
|
|
#include <algorithm>
|
|
|
|
#include <list>
|
|
|
|
#include <vector>
|
|
|
|
|
2017-09-01 17:53:46 +02:00
|
|
|
|
2010-04-04 14:14:12 +00:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
template< class Container >
|
|
|
|
void test_push_back_impl(std::size_t n)
|
|
|
|
{
|
|
|
|
Container reference;
|
|
|
|
for (std::size_t i = 0; i < n; ++i)
|
|
|
|
reference.push_back(i);
|
|
|
|
|
|
|
|
Container test;
|
|
|
|
boost::push_back(test, boost::irange<std::size_t>(0, n));
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
|
|
|
|
test.begin(), test.end() );
|
|
|
|
|
|
|
|
// Do it again to push onto non-empty container
|
|
|
|
for (std::size_t j = 0; j < n; ++j)
|
|
|
|
reference.push_back(j);
|
|
|
|
|
|
|
|
boost::push_back(test, boost::irange<std::size_t>(0, n));
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
|
|
|
|
test.begin(), test.end() );
|
|
|
|
}
|
|
|
|
|
|
|
|
template< class Container >
|
|
|
|
void test_push_back_impl()
|
|
|
|
{
|
|
|
|
test_push_back_impl< Container >(0);
|
|
|
|
test_push_back_impl< Container >(1);
|
|
|
|
test_push_back_impl< Container >(2);
|
|
|
|
test_push_back_impl< Container >(100);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_push_back()
|
|
|
|
{
|
|
|
|
test_push_back_impl< std::vector<std::size_t> >();
|
|
|
|
test_push_back_impl< std::list<std::size_t> >();
|
|
|
|
}
|
2017-09-01 17:53:46 +02:00
|
|
|
|
|
|
|
#if !defined( BOOST_NO_CXX11_RVALUE_REFERENCES )
|
|
|
|
// test type which is not copyable by moveable.
|
|
|
|
class noncopyable_int : boost::noncopyable {
|
|
|
|
private:
|
|
|
|
int i;
|
|
|
|
public:
|
|
|
|
noncopyable_int(int x) : i(x) {}
|
|
|
|
noncopyable_int(const noncopyable_int&) = delete;
|
|
|
|
noncopyable_int& operator=(const noncopyable_int&) = delete;
|
|
|
|
noncopyable_int(noncopyable_int&& o) : i(o.i) {}
|
|
|
|
noncopyable_int& operator=(noncopyable_int&& o) { return o; }
|
|
|
|
bool operator!=(const noncopyable_int &rhs) { return i != rhs.i; }
|
|
|
|
friend std::ostream &operator<<(std::ostream &os, const noncopyable_int& x);
|
|
|
|
};
|
|
|
|
|
|
|
|
std::ostream & operator<<(std::ostream &os, const noncopyable_int& x)
|
|
|
|
{
|
|
|
|
return os << x.i;
|
|
|
|
}
|
|
|
|
|
|
|
|
template< class Container >
|
|
|
|
void test_push_back_move_impl(std::size_t n)
|
|
|
|
{
|
|
|
|
Container test;
|
|
|
|
Container reference;
|
|
|
|
for (std::size_t i = 0; i < n; ++i)
|
|
|
|
reference.push_back(noncopyable_int(i));
|
|
|
|
|
|
|
|
{
|
|
|
|
Container to_push_back;
|
|
|
|
for (std::size_t i = 0; i < n; ++i)
|
|
|
|
to_push_back.push_back(noncopyable_int(i));
|
|
|
|
|
|
|
|
boost::push_back(test, std::move(to_push_back));
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
|
|
|
|
test.begin(), test.end() );
|
|
|
|
}
|
|
|
|
// Do it again to push onto non-empty container
|
|
|
|
for (std::size_t i = 0; i < n; ++i)
|
|
|
|
reference.push_back(noncopyable_int(i));
|
|
|
|
|
|
|
|
{
|
|
|
|
Container to_push_back;
|
|
|
|
for (std::size_t i = 0; i < n; ++i)
|
|
|
|
to_push_back.push_back(noncopyable_int(i));
|
|
|
|
|
|
|
|
boost::push_back(test, std::move(to_push_back));
|
|
|
|
|
|
|
|
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
|
|
|
|
test.begin(), test.end() );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template< class Container >
|
|
|
|
void test_push_back_move_impl()
|
|
|
|
{
|
|
|
|
test_push_back_move_impl< Container >(0);
|
|
|
|
test_push_back_move_impl< Container >(1);
|
|
|
|
test_push_back_move_impl< Container >(2);
|
|
|
|
test_push_back_move_impl< Container >(100);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_push_back_move()
|
|
|
|
{
|
|
|
|
test_push_back_move_impl< std::vector<noncopyable_int> >();
|
|
|
|
test_push_back_move_impl< std::list<noncopyable_int> >();
|
|
|
|
}
|
|
|
|
#endif
|
2010-04-04 14:14:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
boost::unit_test::test_suite*
|
|
|
|
init_unit_test_suite(int argc, char* argv[])
|
|
|
|
{
|
|
|
|
boost::unit_test::test_suite* test
|
|
|
|
= BOOST_TEST_SUITE( "RangeTestSuite.algorithm_ext.push_back" );
|
|
|
|
|
|
|
|
test->add( BOOST_TEST_CASE( &test_push_back ) );
|
2017-09-01 17:53:46 +02:00
|
|
|
#if !defined( BOOST_NO_CXX11_RVALUE_REFERENCES )
|
|
|
|
test->add( BOOST_TEST_CASE( &test_push_back_move ) );
|
|
|
|
#endif
|
2010-04-04 14:14:12 +00:00
|
|
|
|
|
|
|
return test;
|
|
|
|
}
|