partition_point.pass.cpp 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is dual licensed under the MIT and the University of Illinois Open
  6. // Source Licenses. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. // <algorithm>
  10. // template<class ForwardIterator, class Predicate>
  11. // constpexr ForwardIterator // constexpr after C++17
  12. // partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
  13. #include <algorithm>
  14. #include <cassert>
  15. #include "test_macros.h"
  16. #include "test_iterators.h"
  17. struct is_odd
  18. {
  19. TEST_CONSTEXPR bool operator()(const int& i) const {return i & 1;}
  20. };
  21. #if TEST_STD_VER > 17
  22. TEST_CONSTEXPR bool test_constexpr() {
  23. int ia[] = {1, 3, 5, 2, 4, 6};
  24. int ib[] = {1, 2, 3, 4, 5, 6};
  25. return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3)
  26. && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1)
  27. ;
  28. }
  29. #endif
  30. int main()
  31. {
  32. {
  33. const int ia[] = {2, 4, 6, 8, 10};
  34. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  35. forward_iterator<const int*>(std::end(ia)),
  36. is_odd()) == forward_iterator<const int*>(ia));
  37. }
  38. {
  39. const int ia[] = {1, 2, 4, 6, 8};
  40. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  41. forward_iterator<const int*>(std::end(ia)),
  42. is_odd()) == forward_iterator<const int*>(ia + 1));
  43. }
  44. {
  45. const int ia[] = {1, 3, 2, 4, 6};
  46. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  47. forward_iterator<const int*>(std::end(ia)),
  48. is_odd()) == forward_iterator<const int*>(ia + 2));
  49. }
  50. {
  51. const int ia[] = {1, 3, 5, 2, 4, 6};
  52. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  53. forward_iterator<const int*>(std::end(ia)),
  54. is_odd()) == forward_iterator<const int*>(ia + 3));
  55. }
  56. {
  57. const int ia[] = {1, 3, 5, 7, 2, 4};
  58. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  59. forward_iterator<const int*>(std::end(ia)),
  60. is_odd()) == forward_iterator<const int*>(ia + 4));
  61. }
  62. {
  63. const int ia[] = {1, 3, 5, 7, 9, 2};
  64. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  65. forward_iterator<const int*>(std::end(ia)),
  66. is_odd()) == forward_iterator<const int*>(ia + 5));
  67. }
  68. {
  69. const int ia[] = {1, 3, 5, 7, 9, 11};
  70. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  71. forward_iterator<const int*>(std::end(ia)),
  72. is_odd()) == forward_iterator<const int*>(ia + 6));
  73. }
  74. {
  75. const int ia[] = {1, 3, 5, 2, 4, 6, 7};
  76. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  77. forward_iterator<const int*>(std::begin(ia)),
  78. is_odd()) == forward_iterator<const int*>(ia));
  79. }
  80. #if TEST_STD_VER > 17
  81. static_assert(test_constexpr());
  82. #endif
  83. }