// Boost.Range library // // Copyright Neil Groves 2009. 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 "../test_driver/range_return_test_driver.hpp" #include #include #include #include #include namespace boost { namespace { template class find_end_test_policy { typedef Container2 container2_t; public: explicit find_end_test_policy(const Container2& cont) : m_cont(cont) { } container2_t cont() { return m_cont; } template BOOST_DEDUCED_TYPENAME range_iterator::type test_iter(Container& cont) { return boost::find_end(cont, m_cont); } template struct test_range { template BOOST_DEDUCED_TYPENAME range_return::type operator()(Policy& policy, Container& cont) { return boost::find_end(cont, policy.cont()); } }; template BOOST_DEDUCED_TYPENAME range_iterator::type reference(Container& cont) { return std::find_end(cont.begin(), cont.end(), m_cont.begin(), m_cont.end()); } private: Container2 m_cont; }; template class find_end_pred_test_policy { typedef Container2 container2_t; public: explicit find_end_pred_test_policy(const Container2& cont) : m_cont(cont) { } container2_t& cont() { return m_cont; } BinaryPredicate& pred() { return m_pred; } template BOOST_DEDUCED_TYPENAME range_iterator::type test_iter(Container& cont) { return boost::find_end(cont, m_cont, m_pred); } template struct test_range { template BOOST_DEDUCED_TYPENAME range_return::type operator()(Policy& policy, Container& cont) { return boost::find_end(cont, policy.cont(), policy.pred()); } }; template BOOST_DEDUCED_TYPENAME range_iterator::type reference(Container& cont) { return std::find_end(cont.begin(), cont.end(), m_cont.begin(), m_cont.end(), m_pred); } private: Container2 m_cont; BinaryPredicate m_pred; }; template void run_tests(Container1& cont1, Container2& cont2) { range_test::range_return_test_driver test_driver; test_driver(cont1, find_end_test_policy(cont2)); test_driver(cont1, find_end_pred_test_policy >(cont2)); test_driver(cont2, find_end_pred_test_policy >(cont2)); } template void test_find_end_impl() { using namespace boost::assign; typedef BOOST_DEDUCED_TYPENAME remove_const::type container1_t; typedef BOOST_DEDUCED_TYPENAME remove_const::type container2_t; container1_t mcont1; Container1& cont1 = mcont1; container2_t mcont2; Container2& cont2 = mcont2; run_tests(cont1, cont2); mcont1 += 1; run_tests(cont1, cont2); mcont2 += 1; run_tests(cont1, cont2); mcont1 += 2,3,4,5,6,7,8,9; mcont2 += 2,3,4; run_tests(cont1, cont2); mcont2.clear(); mcont2 += 7,8,9; run_tests(cont1, cont2); } void test_find_end() { test_find_end_impl< std::vector, std::vector >(); test_find_end_impl< std::list, std::list >(); test_find_end_impl< std::deque, std::deque >(); test_find_end_impl< const std::vector, const std::vector >(); test_find_end_impl< const std::list, const std::list >(); test_find_end_impl< const std::deque, const std::deque >(); test_find_end_impl< const std::vector, const std::list >(); test_find_end_impl< const std::list, const std::vector >(); test_find_end_impl< const std::vector, std::list >(); test_find_end_impl< const std::list, std::vector >(); test_find_end_impl< std::vector, std::list >(); test_find_end_impl< std::list, std::vector >(); } } } boost::unit_test::test_suite* init_unit_test_suite(int argc, char* argv[]) { boost::unit_test::test_suite* test = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.find_end" ); test->add( BOOST_TEST_CASE( &boost::test_find_end ) ); return test; }