equal.pass.cpp 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. // <algorithm>
  9. // template<InputIterator Iter1, InputIterator Iter2>
  10. // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
  11. // constexpr bool // constexpr after c++17
  12. // equal(Iter1 first1, Iter1 last1, Iter2 first2);
  13. //
  14. // Introduced in C++14:
  15. // template<InputIterator Iter1, InputIterator Iter2>
  16. // constexpr bool // constexpr after c++17
  17. // equal(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
  18. #include <algorithm>
  19. #include <cassert>
  20. #include "test_macros.h"
  21. #include "test_iterators.h"
  22. #if TEST_STD_VER > 17
  23. TEST_CONSTEXPR bool test_constexpr() {
  24. int ia[] = {1, 3, 6, 7};
  25. int ib[] = {1, 3};
  26. int ic[] = {1, 3, 5, 7};
  27. typedef input_iterator<int*> II;
  28. typedef bidirectional_iterator<int*> BI;
  29. return !std::equal(std::begin(ia), std::end(ia), std::begin(ic))
  30. && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic))
  31. && std::equal(std::begin(ib), std::end(ib), std::begin(ic))
  32. && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic))
  33. && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)))
  34. && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)))
  35. ;
  36. }
  37. #endif
  38. int main(int, char**)
  39. {
  40. int ia[] = {0, 1, 2, 3, 4, 5};
  41. const unsigned s = sizeof(ia)/sizeof(ia[0]);
  42. int ib[s] = {0, 1, 2, 5, 4, 5};
  43. assert(std::equal(input_iterator<const int*>(ia),
  44. input_iterator<const int*>(ia+s),
  45. input_iterator<const int*>(ia)));
  46. #if TEST_STD_VER >= 14
  47. assert(std::equal(input_iterator<const int*>(ia),
  48. input_iterator<const int*>(ia+s),
  49. input_iterator<const int*>(ia),
  50. input_iterator<const int*>(ia+s)));
  51. assert(std::equal(random_access_iterator<const int*>(ia),
  52. random_access_iterator<const int*>(ia+s),
  53. random_access_iterator<const int*>(ia),
  54. random_access_iterator<const int*>(ia+s)));
  55. #endif
  56. assert(!std::equal(input_iterator<const int*>(ia),
  57. input_iterator<const int*>(ia+s),
  58. input_iterator<const int*>(ib)));
  59. #if TEST_STD_VER >= 14
  60. assert(!std::equal(input_iterator<const int*>(ia),
  61. input_iterator<const int*>(ia+s),
  62. input_iterator<const int*>(ib),
  63. input_iterator<const int*>(ib+s)));
  64. assert(!std::equal(random_access_iterator<const int*>(ia),
  65. random_access_iterator<const int*>(ia+s),
  66. random_access_iterator<const int*>(ib),
  67. random_access_iterator<const int*>(ib+s)));
  68. assert(!std::equal(input_iterator<const int*>(ia),
  69. input_iterator<const int*>(ia+s),
  70. input_iterator<const int*>(ia),
  71. input_iterator<const int*>(ia+s-1)));
  72. assert(!std::equal(random_access_iterator<const int*>(ia),
  73. random_access_iterator<const int*>(ia+s),
  74. random_access_iterator<const int*>(ia),
  75. random_access_iterator<const int*>(ia+s-1)));
  76. #endif
  77. #if TEST_STD_VER > 17
  78. static_assert(test_constexpr());
  79. #endif
  80. return 0;
  81. }