123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110 |
- /*
- Copyright (c) Marshall Clow 2011-2012.
- Distributed under 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
- */
- #include <iostream>
- #include <boost/config.hpp>
- #include <boost/algorithm/cxx11/partition_copy.hpp>
- #define BOOST_TEST_MAIN
- #include <boost/test/unit_test.hpp>
- #include <boost/algorithm/cxx11/all_of.hpp>
- #include <boost/algorithm/cxx11/none_of.hpp>
- #include <string>
- #include <vector>
- #include <list>
- namespace ba = boost::algorithm;
- // namespace ba = boost;
- template <typename Container, typename Predicate>
- void test_sequence ( const Container &c, Predicate comp ) {
- std::vector<typename Container::value_type> v1, v2;
-
- v1.clear (); v2.clear ();
- ba::partition_copy ( c.begin (), c.end (),
- std::back_inserter (v1), std::back_inserter (v2), comp );
- // std::cout << "Sizes(1): " << c.size () << " -> { " << v1.size () << ", " << v2.size () << " }" << std::endl;
- BOOST_CHECK ( v1.size () + v2.size () == c.size ());
- BOOST_CHECK ( ba::all_of ( v1.begin (), v1.end (), comp ));
- BOOST_CHECK ( ba::none_of ( v2.begin (), v2.end (), comp ));
- v1.clear (); v2.clear ();
- ba::partition_copy ( c, std::back_inserter (v1), std::back_inserter ( v2 ), comp );
- // std::cout << "Sizes(2): " << c.size () << " -> { " << v1.size () << ", " << v2.size () << " }" << std::endl;
- BOOST_CHECK ( v1.size () + v2.size () == c.size ());
- BOOST_CHECK ( ba::all_of ( v1, comp ));
- BOOST_CHECK ( ba::none_of ( v2, comp ));
- }
- template <typename T>
- struct less_than {
- public:
- BOOST_CXX14_CONSTEXPR less_than ( T foo ) : val ( foo ) {}
- BOOST_CXX14_CONSTEXPR less_than ( const less_than &rhs ) : val ( rhs.val ) {}
- BOOST_CXX14_CONSTEXPR bool operator () ( const T &v ) const { return v < val; }
- private:
- less_than ();
- less_than operator = ( const less_than &rhs );
- T val;
- };
- bool is_even ( int v ) { return v % 2 == 0; }
- void test_sequence1 () {
- std::vector<int> v;
-
- v.clear ();
- for ( int i = 5; i < 15; ++i )
- v.push_back ( i );
- test_sequence ( v, less_than<int>(3)); // no elements
- test_sequence ( v, less_than<int>(6)); // only the first element
- test_sequence ( v, less_than<int>(10));
- test_sequence ( v, less_than<int>(99)); // all elements satisfy
- // With bidirectional iterators.
- std::list<int> l;
- for ( int i = 5; i < 16; ++i )
- l.push_back ( i );
- test_sequence ( l, less_than<int>(3)); // no elements
- test_sequence ( l, less_than<int>(6)); // only the first element
- test_sequence ( l, less_than<int>(10));
- test_sequence ( l, less_than<int>(99)); // all elements satisfy
- }
-
- BOOST_CXX14_CONSTEXPR bool test_constexpr () {
- int in[] = {1, 1, 2};
- int out_true[3] = {0};
- int out_false[3] = {0};
- bool res = true;
- ba::partition_copy( in, in + 3, out_true, out_false, less_than<int>(2) );
- res = (res && ba::all_of(out_true, out_true + 2, less_than<int>(2)) );
- res = (res && ba::none_of(out_false, out_false + 1, less_than<int>(2)) );
-
- // clear elements
- out_true [0] = 0;
- out_true [1] = 0;
- out_false[0] = 0;
-
- ba::partition_copy( in, out_true, out_false, less_than<int>(2));
- res = ( res && ba::all_of(out_true, out_true + 2, less_than<int>(2)));
- res = ( res && ba::none_of(out_false, out_false + 1, less_than<int>(2)));
- return res;
- }
- BOOST_AUTO_TEST_CASE( test_main )
- {
- test_sequence1 ();
- BOOST_CXX14_CONSTEXPR bool constexpr_res = test_constexpr ();
- BOOST_CHECK ( constexpr_res );
- }
|