range/test/algorithm_test/unique.cpp

// 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 <boost/range/algorithm/unique.hpp>

#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

#include <boost/assign.hpp>
#include <boost/bind.hpp>
#include "../test_driver/range_return_test_driver.hpp"
#include <algorithm>
#include <functional>
#include <list>
#include <numeric>
#include <deque>
#include <vector>

namespace boost
{
    namespace
    {
        // test the 'unique' algorithm without a predicate
        class unique_test_policy 
        {
        public:
            template< class Container >
            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
            test_iter(Container& cont)
            {
                // There isn't an iterator return version of boost::unique, so just
                // perform the standard algorithm
                return std::unique(cont.begin(), cont.end());
            }

            template< range_return_value return_type >
            struct test_range
            {
                template< class Container, class Policy >
                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                operator()(Policy&, Container& cont)
                {
                    return boost::unique<return_type>(cont);
                }
            };

            template< class Container >
            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
            reference(Container& cont)
            {
                return std::unique(cont.begin(), cont.end());
            }
        };

        // test the 'unique' algorithm with a predicate
        template<class Pred>
        class unique_pred_test_policy
        {
        public:
            template< class Container >
            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
            test_iter(Container& cont)
            {
                // There isn't an iterator return version of boost::unique, so just
                // perform the standard algorithm
                return std::unique(cont.begin(), cont.end(), Pred());
            }

            Pred pred() const { return Pred(); }

            template< range_return_value return_type >
            struct test_range
            {
                template< class Container, class Policy >
                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                operator()(Policy& policy, Container& cont)
                {
                    return boost::unique<return_type>(cont, policy.pred());
                }
            };

            template< class Container >
            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
            reference(Container& cont)
            {
                return std::unique(cont.begin(), cont.end(), Pred());
            }
        };

        template<class Container, class TestPolicy, class Pred>
        void test_unique_impl(TestPolicy policy, Pred pred)
        {
            using namespace boost::assign;

            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;

            range_test::range_return_test_driver test_driver;

            Container cont;

            test_driver(cont, policy);

            cont.clear();
            cont += 1;

            std::vector<value_t> temp(cont.begin(), cont.end());
            std::sort(temp.begin(), temp.end(), pred);
            cont.assign(temp.begin(), temp.end());

            test_driver(cont, policy);

            cont.clear();
            cont += 1,2,2,2,2,3,4,5,6,7,8,9;
            
            temp.assign(cont.begin(), cont.end());
            std::sort(temp.begin(), temp.end(), pred);
            cont.assign(temp.begin(), temp.end());

            test_driver(cont, policy);
        }

        template<class Container>
        void test_unique_impl()
        {
            test_unique_impl<Container>(
                unique_test_policy(),
                std::less<int>()
                );

            test_unique_impl<Container>(
                unique_pred_test_policy<std::less<int> >(),
                std::less<int>()
                );
            
            test_unique_impl<Container>(
                unique_pred_test_policy<std::greater<int> >(),
                std::greater<int>()
                );
        }

        void test_unique()
        {
            test_unique_impl< std::vector<int> >();
            test_unique_impl< std::list<int> >();
            test_unique_impl< std::deque<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.unique" );

    test->add( BOOST_TEST_CASE( &boost::test_unique ) );

    return test;
}