unique_copy_pred.pass.cpp 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  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<InputIterator InIter, class OutIter,
  11. // EquivalenceRelation<auto, InIter::value_type> Pred>
  12. // requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type>
  13. // && HasAssign<InIter::value_type, InIter::reference>
  14. // && Constructible<InIter::value_type, InIter::reference>
  15. // && CopyConstructible<Pred>
  16. // constexpr OutIter // constexpr after C++17
  17. // unique_copy(InIter first, InIter last, OutIter result, Pred pred);
  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[] = {0, 1, 2, 2, 4};
  25. int ib[] = {0, 0, 0, 0, 0};
  26. const int expected[] = {0, 1, 2, 4};
  27. auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib),
  28. [](int a, int b) {return a == b; });
  29. return it == (std::begin(ib) + std::size(expected))
  30. && *it == 0 // don't overwrite final value in output
  31. && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
  32. ;
  33. }
  34. #endif
  35. struct count_equal
  36. {
  37. static unsigned count;
  38. template <class T>
  39. bool operator()(const T& x, const T& y)
  40. {++count; return x == y;}
  41. };
  42. unsigned count_equal::count = 0;
  43. template <class InIter, class OutIter>
  44. void
  45. test()
  46. {
  47. const int ia[] = {0};
  48. const unsigned sa = sizeof(ia)/sizeof(ia[0]);
  49. int ja[sa] = {-1};
  50. count_equal::count = 0;
  51. OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
  52. assert(base(r) == ja + sa);
  53. assert(ja[0] == 0);
  54. assert(count_equal::count == sa-1);
  55. const int ib[] = {0, 1};
  56. const unsigned sb = sizeof(ib)/sizeof(ib[0]);
  57. int jb[sb] = {-1};
  58. count_equal::count = 0;
  59. r = std::unique_copy(InIter(ib), InIter(ib+sb), OutIter(jb), count_equal());
  60. assert(base(r) == jb + sb);
  61. assert(jb[0] == 0);
  62. assert(jb[1] == 1);
  63. assert(count_equal::count == sb-1);
  64. const int ic[] = {0, 0};
  65. const unsigned sc = sizeof(ic)/sizeof(ic[0]);
  66. int jc[sc] = {-1};
  67. count_equal::count = 0;
  68. r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc), count_equal());
  69. assert(base(r) == jc + 1);
  70. assert(jc[0] == 0);
  71. assert(count_equal::count == sc-1);
  72. const int id[] = {0, 0, 1};
  73. const unsigned sd = sizeof(id)/sizeof(id[0]);
  74. int jd[sd] = {-1};
  75. count_equal::count = 0;
  76. r = std::unique_copy(InIter(id), InIter(id+sd), OutIter(jd), count_equal());
  77. assert(base(r) == jd + 2);
  78. assert(jd[0] == 0);
  79. assert(jd[1] == 1);
  80. assert(count_equal::count == sd-1);
  81. const int ie[] = {0, 0, 1, 0};
  82. const unsigned se = sizeof(ie)/sizeof(ie[0]);
  83. int je[se] = {-1};
  84. count_equal::count = 0;
  85. r = std::unique_copy(InIter(ie), InIter(ie+se), OutIter(je), count_equal());
  86. assert(base(r) == je + 3);
  87. assert(je[0] == 0);
  88. assert(je[1] == 1);
  89. assert(je[2] == 0);
  90. assert(count_equal::count == se-1);
  91. const int ig[] = {0, 0, 1, 1};
  92. const unsigned sg = sizeof(ig)/sizeof(ig[0]);
  93. int jg[sg] = {-1};
  94. count_equal::count = 0;
  95. r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal());
  96. assert(base(r) == jg + 2);
  97. assert(jg[0] == 0);
  98. assert(jg[1] == 1);
  99. assert(count_equal::count == sg-1);
  100. const int ih[] = {0, 1, 1};
  101. const unsigned sh = sizeof(ih)/sizeof(ih[0]);
  102. int jh[sh] = {-1};
  103. count_equal::count = 0;
  104. r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh), count_equal());
  105. assert(base(r) == jh + 2);
  106. assert(jh[0] == 0);
  107. assert(jh[1] == 1);
  108. assert(count_equal::count == sh-1);
  109. const int ii[] = {0, 1, 1, 1, 2, 2, 2};
  110. const unsigned si = sizeof(ii)/sizeof(ii[0]);
  111. int ji[si] = {-1};
  112. count_equal::count = 0;
  113. r = std::unique_copy(InIter(ii), InIter(ii+si), OutIter(ji), count_equal());
  114. assert(base(r) == ji + 3);
  115. assert(ji[0] == 0);
  116. assert(ji[1] == 1);
  117. assert(ji[2] == 2);
  118. assert(count_equal::count == si-1);
  119. }
  120. int main()
  121. {
  122. test<input_iterator<const int*>, output_iterator<int*> >();
  123. test<input_iterator<const int*>, forward_iterator<int*> >();
  124. test<input_iterator<const int*>, bidirectional_iterator<int*> >();
  125. test<input_iterator<const int*>, random_access_iterator<int*> >();
  126. test<input_iterator<const int*>, int*>();
  127. test<forward_iterator<const int*>, output_iterator<int*> >();
  128. test<forward_iterator<const int*>, forward_iterator<int*> >();
  129. test<forward_iterator<const int*>, bidirectional_iterator<int*> >();
  130. test<forward_iterator<const int*>, random_access_iterator<int*> >();
  131. test<forward_iterator<const int*>, int*>();
  132. test<bidirectional_iterator<const int*>, output_iterator<int*> >();
  133. test<bidirectional_iterator<const int*>, forward_iterator<int*> >();
  134. test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
  135. test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
  136. test<bidirectional_iterator<const int*>, int*>();
  137. test<random_access_iterator<const int*>, output_iterator<int*> >();
  138. test<random_access_iterator<const int*>, forward_iterator<int*> >();
  139. test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
  140. test<random_access_iterator<const int*>, random_access_iterator<int*> >();
  141. test<random_access_iterator<const int*>, int*>();
  142. test<const int*, output_iterator<int*> >();
  143. test<const int*, forward_iterator<int*> >();
  144. test<const int*, bidirectional_iterator<int*> >();
  145. test<const int*, random_access_iterator<int*> >();
  146. test<const int*, int*>();
  147. #if TEST_STD_VER > 17
  148. static_assert(test_constexpr());
  149. #endif
  150. }