partition_point.pass.cpp 3.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
  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. // ForwardIterator
  12. // partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
  13. #include <algorithm>
  14. #include <cassert>
  15. #include "test_iterators.h"
  16. struct is_odd
  17. {
  18. bool operator()(const int& i) const {return i & 1;}
  19. };
  20. int main()
  21. {
  22. {
  23. const int ia[] = {2, 4, 6, 8, 10};
  24. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  25. forward_iterator<const int*>(std::end(ia)),
  26. is_odd()) == forward_iterator<const int*>(ia));
  27. }
  28. {
  29. const int ia[] = {1, 2, 4, 6, 8};
  30. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  31. forward_iterator<const int*>(std::end(ia)),
  32. is_odd()) == forward_iterator<const int*>(ia + 1));
  33. }
  34. {
  35. const int ia[] = {1, 3, 2, 4, 6};
  36. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  37. forward_iterator<const int*>(std::end(ia)),
  38. is_odd()) == forward_iterator<const int*>(ia + 2));
  39. }
  40. {
  41. const int ia[] = {1, 3, 5, 2, 4, 6};
  42. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  43. forward_iterator<const int*>(std::end(ia)),
  44. is_odd()) == forward_iterator<const int*>(ia + 3));
  45. }
  46. {
  47. const int ia[] = {1, 3, 5, 7, 2, 4};
  48. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  49. forward_iterator<const int*>(std::end(ia)),
  50. is_odd()) == forward_iterator<const int*>(ia + 4));
  51. }
  52. {
  53. const int ia[] = {1, 3, 5, 7, 9, 2};
  54. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  55. forward_iterator<const int*>(std::end(ia)),
  56. is_odd()) == forward_iterator<const int*>(ia + 5));
  57. }
  58. {
  59. const int ia[] = {1, 3, 5, 7, 9, 11};
  60. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  61. forward_iterator<const int*>(std::end(ia)),
  62. is_odd()) == forward_iterator<const int*>(ia + 6));
  63. }
  64. {
  65. const int ia[] = {1, 3, 5, 2, 4, 6, 7};
  66. assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
  67. forward_iterator<const int*>(std::begin(ia)),
  68. is_odd()) == forward_iterator<const int*>(ia));
  69. }
  70. }