feedc0de/boost_range
1
0
Fork 0
forked from boostorg/range
Code Pull Requests Activity

fixed and resolved missing coverage in the copy_backward unit test.

Browse Source
This commit is contained in:
Neil Groves
2014-06-16 11:45:41 +01:00
parent a0dad84a13
commit fc172fc509
1 changed files with 46 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
test/algorithm_test/copy_backward.cpp
View File

@ -8,6 +8,10 @@
// //
// For more information, see http://www.boost.org/libs/range/ // For more information, see http://www.boost.org/libs/range/
// //
// Credits:
// awulkiew highlighted that this test was not successfully testing the
// algorithm.
//
#include <boost/range/algorithm/copy_backward.hpp> #include <boost/range/algorithm/copy_backward.hpp>
#include <boost/test/test_tools.hpp> #include <boost/test/test_tools.hpp>
@ -17,52 +21,64 @@
#include <boost/range/iterator.hpp> #include <boost/range/iterator.hpp>
#include <algorithm> #include <algorithm>
#include <list> #include <list>
#include <set>
#include <vector> #include <vector>
namespace boost namespace boost_range_test
{ {
namespace namespace
{ {
template< class Container > template<typename Container>
void test_copy_backward_impl() void test_copy_backward_impl(std::size_t n)
{ {
Container source; Container source;
typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t; typedef typename Container::value_type value_t;
for (std::size_t i = 0; i < n; ++i)
source.push_back(static_cast<value_t>(i));
std::vector<value_t> target; std::vector<value_t> target(n);
target.resize(source.size());
typedef BOOST_DEDUCED_TYPENAME range_iterator< std::vector<value_t> >::type iterator_t; typedef typename boost::range_iterator<
iterator_t it = boost::copy_backward(source, target.begin()); std::vector<value_t>
>::type iterator_t;
iterator_t it = boost::copy_backward(source, target.end());
BOOST_CHECK(it == target.begin());
BOOST_CHECK( it == target.end() );
BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(), BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
source.rbegin(), source.rend() ); source.begin(), source.end());
BOOST_CHECK(it == boost::copy_backward(
boost::make_iterator_range(source), target.end()));
BOOST_CHECK( it == boost::copy_backward(boost::make_iterator_range(source), target.begin()) );
BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(), BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
source.rbegin(), source.rend() ); source.begin(), source.end());
}
template<typename Container>
void test_copy_backward_impl()
{
test_copy_backward_impl<Container>(0u);
test_copy_backward_impl<Container>(1u);
test_copy_backward_impl<Container>(100u);
} }
void test_copy_backward() void test_copy_backward()
{ {
test_copy_backward_impl<std::vector<int> >(); test_copy_backward_impl<std::vector<int> >();
test_copy_backward_impl<std::list<int> >(); test_copy_backward_impl<std::list<int> >();
test_copy_backward_impl< std::set<int> >();
test_copy_backward_impl< std::multiset<int> >();
}
}
} }
} // anonymous namespace
} // namespace boost_range_test
boost::unit_test::test_suite* boost::unit_test::test_suite*
init_unit_test_suite(int argc, char* argv[]) init_unit_test_suite(int, char*[])
{ {
boost::unit_test::test_suite* test boost::unit_test::test_suite* test
= BOOST_TEST_SUITE("RangeTestSuite.algorithm.copy_backward"); = BOOST_TEST_SUITE("RangeTestSuite.algorithm.copy_backward");
test->add( BOOST_TEST_CASE( &boost::test_copy_backward ) ); test->add(BOOST_TEST_CASE(&boost_range_test::test_copy_backward));
return test; return test;
} }