lexicographical_compare.cpp 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. // Copyright Neil Groves 2009. Use, modification and
  2. // distribution is subject to the Boost Software License, Version
  3. // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  4. // http://www.boost.org/LICENSE_1_0.txt)
  5. //
  6. //
  7. // For more information, see http://www.boost.org/libs/range/
  8. //
  9. #include <boost/range/algorithm/lexicographical_compare.hpp>
  10. #include <boost/test/test_tools.hpp>
  11. #include <boost/test/unit_test.hpp>
  12. #include <boost/assign.hpp>
  13. #include <boost/range/value_type.hpp>
  14. #include <algorithm>
  15. #include <functional>
  16. #include <list>
  17. #include <numeric>
  18. #include <deque>
  19. #include <vector>
  20. namespace boost
  21. {
  22. namespace
  23. {
  24. template<class ForwardRange1, class ForwardRange2>
  25. void test_lexicographical_compare_impl_nopred(ForwardRange1& rng1,
  26. ForwardRange2& rng2)
  27. {
  28. const bool reference = std::lexicographical_compare(
  29. boost::begin(rng1), boost::end(rng1),
  30. boost::begin(rng2), boost::end(rng2));
  31. const bool test = boost::lexicographical_compare(rng1, rng2);
  32. BOOST_CHECK( reference == test );
  33. BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), rng2) );
  34. BOOST_CHECK( test == boost::lexicographical_compare(rng1, boost::make_iterator_range(rng2)) );
  35. BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), boost::make_iterator_range(rng2)) );
  36. }
  37. template<class ForwardRange1, class ForwardRange2,
  38. class BinaryPredicate>
  39. void test_lexicographical_compare_impl_pred(ForwardRange1& rng1,
  40. ForwardRange2& rng2,
  41. BinaryPredicate pred)
  42. {
  43. const bool reference = std::lexicographical_compare(
  44. boost::begin(rng1), boost::end(rng1),
  45. boost::begin(rng2), boost::end(rng2),
  46. pred);
  47. const bool test = boost::lexicographical_compare(rng1, rng2, pred);
  48. BOOST_CHECK( reference == test );
  49. BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), rng2, pred) );
  50. BOOST_CHECK( test == boost::lexicographical_compare(rng1, boost::make_iterator_range(rng2), pred) );
  51. BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), boost::make_iterator_range(rng2), pred) );
  52. }
  53. template<class Container1, class Container2>
  54. void test_lexicographical_compare_impl(Container1& cont1,
  55. Container2& cont2)
  56. {
  57. typedef BOOST_DEDUCED_TYPENAME boost::range_value<Container1>::type value_t;
  58. test_lexicographical_compare_impl_nopred(cont1, cont2);
  59. test_lexicographical_compare_impl_pred(cont1, cont2, std::less<value_t>());
  60. test_lexicographical_compare_impl_pred(cont1, cont2, std::greater<value_t>());
  61. }
  62. template<class Container1, class Container2>
  63. void test_lexicographical_compare_impl()
  64. {
  65. using namespace boost::assign;
  66. typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container1>::type container1_t;
  67. typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container2>::type container2_t;
  68. container1_t cont1;
  69. container2_t cont2;
  70. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  71. cont1.clear();
  72. cont2.clear();
  73. cont1.push_back(1);
  74. cont2.push_back(1);
  75. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  76. cont1.clear();
  77. cont2.clear();
  78. cont1 += 2;
  79. cont2 += 1;
  80. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  81. cont1.clear();
  82. cont2.clear();
  83. cont1 += 1;
  84. cont2 += 2;
  85. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  86. cont1.clear();
  87. cont2.clear();
  88. cont1 += 1,2,3,4,5,6,7;
  89. cont2 += 1,2,3,4,5,6,7;
  90. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  91. cont1.clear();
  92. cont2.clear();
  93. cont1 += 1,2,3,4,5,6,7;
  94. cont2 += 1,2,3,4,5,6;
  95. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  96. cont1.clear();
  97. cont2.clear();
  98. cont1 += 1,2,3,4,5,6;
  99. cont2 += 1,2,3,4,5,6,7;
  100. test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2);
  101. }
  102. template<class Container1>
  103. void test_lexicographical_compare_rhs()
  104. {
  105. typedef BOOST_DEDUCED_TYPENAME range_value<Container1>::type value_t;
  106. test_lexicographical_compare_impl<Container1, const std::vector<value_t> >();
  107. test_lexicographical_compare_impl<Container1, const std::deque<value_t> >();
  108. test_lexicographical_compare_impl<Container1, const std::list<value_t> >();
  109. test_lexicographical_compare_impl<Container1, std::vector<value_t> >();
  110. test_lexicographical_compare_impl<Container1, std::deque<value_t> >();
  111. test_lexicographical_compare_impl<Container1, std::list<value_t> >();
  112. }
  113. void test_lexicographical_compare()
  114. {
  115. test_lexicographical_compare_rhs< const std::vector<int> >();
  116. test_lexicographical_compare_rhs< const std::deque<int> >();
  117. test_lexicographical_compare_rhs< const std::list<int> >();
  118. test_lexicographical_compare_rhs< std::vector<int> >();
  119. test_lexicographical_compare_rhs< std::deque<int> >();
  120. test_lexicographical_compare_rhs< std::list<int> >();
  121. }
  122. }
  123. }
  124. boost::unit_test::test_suite*
  125. init_unit_test_suite(int argc, char* argv[])
  126. {
  127. boost::unit_test::test_suite* test
  128. = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.lexicographical_compare" );
  129. test->add( BOOST_TEST_CASE( &boost::test_lexicographical_compare ) );
  130. return test;
  131. }