// 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 #include #include #include #include #include #include #include namespace { struct DoubleValue { template< class Value > Value operator()(Value x) { return x * 2; } }; template< class Container > void test_push_front_impl(std::size_t n) { Container reference; for (std::size_t i = 0; i < n; ++i) reference.push_back(i); Container test; boost::push_front(test, boost::irange(0, n)); BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(), test.begin(), test.end() ); // copy the original reference sequence Container reference_copy(reference); std::transform(reference.begin(), reference.end(), reference.begin(), DoubleValue()); // Do it again to push onto non-empty container reference.insert(reference.end(), reference_copy.begin(), reference_copy.end()); boost::push_front(test, boost::irange(0, n * 2, 2)); BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(), test.begin(), test.end() ); } template< class Container > void test_push_front_impl() { test_push_front_impl< Container >(0); test_push_front_impl< Container >(1); test_push_front_impl< Container >(2); test_push_front_impl< Container >(100); } void test_push_front() { test_push_front_impl< std::vector >(); test_push_front_impl< std::list >(); } } 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_front" ); test->add( BOOST_TEST_CASE( &test_push_front ) ); return test; }