mirror of
https://github.com/saitohirga/WSJT-X.git
synced 2024-12-02 09:05:13 -05:00
164 lines
5.3 KiB
C++
164 lines
5.3 KiB
C++
|
// 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 <boost/range/algorithm/min_element.hpp>
|
||
|
|
||
|
#include <boost/test/test_tools.hpp>
|
||
|
#include <boost/test/unit_test.hpp>
|
||
|
|
||
|
#include <boost/assign.hpp>
|
||
|
#include <boost/bind.hpp>
|
||
|
#include <boost/range/iterator.hpp>
|
||
|
#include "../test_driver/range_return_test_driver.hpp"
|
||
|
#include <algorithm>
|
||
|
#include <functional>
|
||
|
#include <list>
|
||
|
#include <numeric>
|
||
|
#include <deque>
|
||
|
#include <vector>
|
||
|
|
||
|
namespace boost_range_test_algorithm_min_element
|
||
|
{
|
||
|
class min_element_test_policy
|
||
|
{
|
||
|
public:
|
||
|
template< class Container >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
|
||
|
test_iter(Container& cont)
|
||
|
{
|
||
|
typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
|
||
|
iter_t result = boost::min_element(cont);
|
||
|
BOOST_CHECK( result == boost::min_element(boost::make_iterator_range(cont)) );
|
||
|
return result;
|
||
|
}
|
||
|
|
||
|
template< boost::range_return_value return_type >
|
||
|
struct test_range
|
||
|
{
|
||
|
template< class Container, class Policy >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
|
||
|
operator()(Policy&, Container& cont)
|
||
|
{
|
||
|
typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
|
||
|
result_t result = boost::min_element<return_type>(cont);
|
||
|
BOOST_CHECK( result == boost::min_element<return_type>(boost::make_iterator_range(cont)) );
|
||
|
return result;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
template< class Container >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
|
||
|
reference(Container& cont)
|
||
|
{
|
||
|
return std::min_element(cont.begin(), cont.end());
|
||
|
}
|
||
|
};
|
||
|
|
||
|
template<class Pred>
|
||
|
class min_element_pred_test_policy
|
||
|
{
|
||
|
public:
|
||
|
template< class Container >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
|
||
|
test_iter(Container& cont)
|
||
|
{
|
||
|
typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
|
||
|
iter_t result = boost::min_element(cont, Pred());
|
||
|
BOOST_CHECK( result == boost::min_element(
|
||
|
boost::make_iterator_range(cont), Pred()) );
|
||
|
return result;
|
||
|
}
|
||
|
|
||
|
Pred pred() const { return Pred(); }
|
||
|
|
||
|
template< boost::range_return_value return_type >
|
||
|
struct test_range
|
||
|
{
|
||
|
template< class Container, class Policy >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
|
||
|
operator()(Policy& policy, Container& cont)
|
||
|
{
|
||
|
typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
|
||
|
result_t result = boost::min_element<return_type>(cont, policy.pred());
|
||
|
BOOST_CHECK( result == boost::min_element<return_type>(
|
||
|
boost::make_iterator_range(cont), policy.pred()) );
|
||
|
return result;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
template< class Container >
|
||
|
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
|
||
|
reference(Container& cont)
|
||
|
{
|
||
|
return std::min_element(cont.begin(), cont.end(), Pred());
|
||
|
}
|
||
|
};
|
||
|
|
||
|
template<class Container, class TestPolicy>
|
||
|
void test_min_element_impl(TestPolicy policy)
|
||
|
{
|
||
|
using namespace boost::assign;
|
||
|
|
||
|
typedef BOOST_DEDUCED_TYPENAME Container::value_type
|
||
|
value_t BOOST_RANGE_UNUSED;
|
||
|
|
||
|
typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type
|
||
|
container_t;
|
||
|
|
||
|
boost::range_test::range_return_test_driver test_driver;
|
||
|
|
||
|
container_t cont;
|
||
|
|
||
|
test_driver(cont, policy);
|
||
|
|
||
|
cont.clear();
|
||
|
cont += 1;
|
||
|
|
||
|
test_driver(cont, policy);
|
||
|
|
||
|
cont.clear();
|
||
|
cont += 1,2,2,2,3,4,5,6,7,8,9;
|
||
|
|
||
|
test_driver(cont, policy);
|
||
|
}
|
||
|
|
||
|
template<class Container>
|
||
|
void test_min_element_impl()
|
||
|
{
|
||
|
test_min_element_impl<Container>(min_element_test_policy());
|
||
|
|
||
|
test_min_element_impl<Container>(
|
||
|
min_element_pred_test_policy<std::less<int> >());
|
||
|
|
||
|
test_min_element_impl<Container>(
|
||
|
min_element_pred_test_policy<std::greater<int> >());
|
||
|
}
|
||
|
|
||
|
void test_min_element()
|
||
|
{
|
||
|
test_min_element_impl< const std::vector<int> >();
|
||
|
test_min_element_impl< const std::deque<int> >();
|
||
|
test_min_element_impl< const std::list<int> >();
|
||
|
|
||
|
test_min_element_impl< std::vector<int> >();
|
||
|
test_min_element_impl< std::deque<int> >();
|
||
|
test_min_element_impl< std::list<int> >();
|
||
|
}
|
||
|
}
|
||
|
|
||
|
boost::unit_test::test_suite*
|
||
|
init_unit_test_suite(int argc, char* argv[])
|
||
|
{
|
||
|
boost::unit_test::test_suite* test
|
||
|
= BOOST_TEST_SUITE( "RangeTestSuite.algorithm.min_element" );
|
||
|
|
||
|
test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_min_element::test_min_element ) );
|
||
|
|
||
|
return test;
|
||
|
}
|