text: //  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/lower_bound.hpp>
  
  #include <boost/test/test_tools.hpp>
  #include <boost/test/unit_test.hpp>
  
  #include <boost/assign.hpp>
  #include <boost/range/algorithm/lower_bound.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_lower_bound
  {
      class lower_bound_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::lower_bound(cont, 5);
              BOOST_CHECK( result == boost::lower_bound(boost::make_iterator_range(cont), 5) );
              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::lower_bound<return_type>(cont, 5);
                  BOOST_CHECK( result == boost::lower_bound<return_type>(boost::make_iterator_range(cont), 5) );
                  return result;
              }
          };
  
          template< class Container >
          BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
          reference(Container& cont)
          {
              return std::lower_bound(cont.begin(), cont.end(), 5);
          }
      };
  
      template< class BinaryPredicate >
      struct lower_bound_pred_policy
      {
          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::lower_bound(cont, 5, m_pred);
              BOOST_CHECK( result == boost::lower_bound(
                                      boost::make_iterator_range(cont), 5, m_pred) );
              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& policy, Container& cont)
              {
                  typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
                  result_t result = boost::lower_bound<return_type>(cont, 5, policy.pred());
                  BOOST_CHECK( result == boost::lower_bound<return_type>(
                                          boost::make_iterator_range(cont), 5, policy.pred()) );
                  return result;
              }
          };
  
          template<class Container>
          BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
          reference(Container& cont)
          {
              return std::lower_bound(
                      cont.begin(), cont.end(), 5, m_pred);
          }
  
          BinaryPredicate& pred() { return m_pred; }
  
      private:
          BinaryPredicate m_pred;
      };
  
      template<class Container,
               class TestPolicy,
               class BinaryPredicate>
      void test_lower_bound_impl(TestPolicy policy, BinaryPredicate pred)
      {
          using namespace boost::assign;
  
          typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
          typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
  
          boost::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_lower_bound_impl()
      {
          test_lower_bound_impl<Container>(
              lower_bound_policy(),
              std::less<int>()
              );
  
          test_lower_bound_impl<Container>(
              lower_bound_pred_policy<std::less<int> >(),
              std::less<int>()
              );
  
          test_lower_bound_impl<Container>(
              lower_bound_pred_policy<std::greater<int> >(),
              std::greater<int>()
              );
      }
  
      void test_lower_bound()
      {
          test_lower_bound_impl< std::vector<int> >();
          test_lower_bound_impl< std::list<int> >();
          test_lower_bound_impl< std::deque<int> >();
  
          test_lower_bound_impl< const std::vector<int> >();
          test_lower_bound_impl< const std::list<int> >();
          test_lower_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.lower_bound" );
  
      test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_lower_bound::test_lower_bound ) );
  
      return test;
  }
  