Boost.RangeEx merged into Boost.Range

[SVN r60897]

test/algorithm_test/upper_bound.cpp

@@ -0,0 +1,170 @@
+//  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/upper_bound.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
+    {
+        class upper_bound_policy 
+        {
+        public:
+            template< class Container >
+            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
+            test_iter(Container& cont)
+            {
+                return boost::upper_bound(cont, 5);
+            }
+
+	        template<range_return_value result_type>
+	        struct test_range
+	        {
+		        template<class Container, class Policy>
+		        BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+		        operator()(Policy&, Container& cont)
+		        {
+		            return boost::upper_bound<result_type>(cont, 5);
+		        }
+	        };
+
+            template< class Container >
+            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
+            reference(Container& cont)
+            {
+                return std::upper_bound(cont.begin(), cont.end(), 5);
+            }
+        };
+
+        template< class BinaryPredicate >
+        struct upper_bound_pred_policy
+        {
+            template< class Container >
+            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
+            test_iter(Container& cont)
+            {
+                return boost::upper_bound(cont, 5, BinaryPredicate());
+            }
+
+            template< range_return_value result_type>
+	        struct test_range
+	        {
+		        template< class Container, class Policy >
+		        BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+		        operator()(Policy& policy, Container& cont)
+		        {
+		            return boost::upper_bound<result_type>(
+				        cont, 5, policy.pred());
+		        }
+            };
+
+            template<class Container>
+            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
+            reference(Container& cont)
+            {
+                return std::upper_bound(
+                        cont.begin(), cont.end(), 5, BinaryPredicate());
+            }
+	    
+	        BinaryPredicate& pred() { return m_pred; }
+	    
+	    private:
+	        BinaryPredicate m_pred;
+        };
+
+        template<class Container,
+                 class TestPolicy,
+                 class BinaryPredicate>
+        void test_upper_bound_impl(TestPolicy policy, BinaryPredicate pred)
+        {
+            using namespace boost::assign;
+
+            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
+            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+
+            range_test::range_return_test_driver test_driver;
+
+            container_t mcont;
+            Container& cont = mcont;
+
+            test_driver(cont, policy);
+
+            mcont.clear();
+            mcont += 1;
+
+            std::vector<value_t> temp(mcont.begin(), mcont.end());
+            std::sort(temp.begin(), temp.end(), pred);
+            mcont.assign(temp.begin(), temp.end());
+
+            test_driver(cont, policy);
+
+            mcont.clear();
+            mcont += 1,2,3,4,5,6,7,8,9;
+
+            temp.assign(mcont.begin(), mcont.end());
+            std::sort(temp.begin(), temp.end(), pred);
+            mcont.assign(temp.begin(), temp.end());
+
+            test_driver(cont, policy);
+        }
+
+        template<class Container>
+        void test_upper_bound_impl()
+        {
+            test_upper_bound_impl<Container>(
+                upper_bound_policy(),
+                std::less<int>()
+                );
+
+            test_upper_bound_impl<Container>(
+                upper_bound_pred_policy<std::less<int> >(),
+                std::less<int>()
+                );
+
+            test_upper_bound_impl<Container>(
+                upper_bound_pred_policy<std::greater<int> >(),
+                std::greater<int>()
+                );
+        }
+    }
+
+    void test_upper_bound()
+    {
+        test_upper_bound_impl< std::vector<int> >();
+        test_upper_bound_impl< std::list<int> >();
+        test_upper_bound_impl< std::deque<int> >();
+
+        test_upper_bound_impl< const std::vector<int> >();
+        test_upper_bound_impl< const std::list<int> >();
+        test_upper_bound_impl< const 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.upper_bound" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_upper_bound ) );
+
+    return test;
+}