swap_ranges.cpp 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268
  1. // Range v3 library
  2. //
  3. // Copyright Eric Niebler 2014-present
  4. //
  5. // Use, modification and distribution is subject to the
  6. // Boost Software License, Version 1.0. (See accompanying
  7. // file LICENSE_1_0.txt or copy at
  8. // http://www.boost.org/LICENSE_1_0.txt)
  9. //
  10. // Project home: https://github.com/ericniebler/range-v3
  11. //===----------------------------------------------------------------------===//
  12. //
  13. // The LLVM Compiler Infrastructure
  14. //
  15. // This file is dual licensed under the MIT and the University of Illinois Open
  16. // Source Licenses. See LICENSE.TXT for details.
  17. //
  18. //===----------------------------------------------------------------------===//
  19. #include <array>
  20. #include <memory>
  21. #include <algorithm>
  22. #include <range/v3/core.hpp>
  23. #include <range/v3/algorithm/swap_ranges.hpp>
  24. #include "../simple_test.hpp"
  25. #include "../test_utils.hpp"
  26. #include "../test_iterators.hpp"
  27. template<class Iter1, class Iter2>
  28. void test_iter_3()
  29. {
  30. int i[3] = {1, 2, 3};
  31. int j[3] = {4, 5, 6};
  32. ranges::swap_ranges_result<Iter1, Iter2> r =
  33. ranges::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
  34. CHECK(base(r.in1) == i+3);
  35. CHECK(base(r.in2) == j+3);
  36. CHECK(i[0] == 4);
  37. CHECK(i[1] == 5);
  38. CHECK(i[2] == 6);
  39. CHECK(j[0] == 1);
  40. CHECK(j[1] == 2);
  41. CHECK(j[2] == 3);
  42. using Sent1 = typename sentinel_type<Iter1>::type;
  43. r = ranges::swap_ranges(Iter1(j), Sent1(j+3), Iter2(i));
  44. CHECK(base(r.in1) == j+3);
  45. CHECK(base(r.in2) == i+3);
  46. CHECK(i[0] == 1);
  47. CHECK(i[1] == 2);
  48. CHECK(i[2] == 3);
  49. CHECK(j[0] == 4);
  50. CHECK(j[1] == 5);
  51. CHECK(j[2] == 6);
  52. }
  53. template<class Iter1, class Iter2>
  54. void test_iter_4()
  55. {
  56. int i[3] = {1, 2, 3};
  57. int j[4] = {4, 5, 6, 7};
  58. ranges::swap_ranges_result<Iter1, Iter2> r =
  59. ranges::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j), Iter2(j+4));
  60. CHECK(base(r.in1) == i+3);
  61. CHECK(base(r.in2) == j+3);
  62. CHECK(i[0] == 4);
  63. CHECK(i[1] == 5);
  64. CHECK(i[2] == 6);
  65. CHECK(j[0] == 1);
  66. CHECK(j[1] == 2);
  67. CHECK(j[2] == 3);
  68. CHECK(j[3] == 7);
  69. using Sent1 = typename sentinel_type<Iter1>::type;
  70. using Sent2 = typename sentinel_type<Iter2>::type;
  71. r = ranges::swap_ranges(Iter1(j), Sent1(j+4), Iter2(i), Sent2(i+3));
  72. CHECK(base(r.in1) == j+3);
  73. CHECK(base(r.in2) == i+3);
  74. CHECK(i[0] == 1);
  75. CHECK(i[1] == 2);
  76. CHECK(i[2] == 3);
  77. CHECK(j[0] == 4);
  78. CHECK(j[1] == 5);
  79. CHECK(j[2] == 6);
  80. CHECK(j[3] == 7);
  81. }
  82. template<class Iter1, class Iter2>
  83. void test_rng_3()
  84. {
  85. int i[3] = {1, 2, 3};
  86. int j[3] = {4, 5, 6};
  87. ranges::swap_ranges_result<Iter1, Iter2> r =
  88. ranges::swap_ranges(as_lvalue(ranges::make_subrange(Iter1(i), Iter1(i+3))), Iter2(j));
  89. CHECK(base(r.in1) == i+3);
  90. CHECK(base(r.in2) == j+3);
  91. CHECK(i[0] == 4);
  92. CHECK(i[1] == 5);
  93. CHECK(i[2] == 6);
  94. CHECK(j[0] == 1);
  95. CHECK(j[1] == 2);
  96. CHECK(j[2] == 3);
  97. using Sent1 = typename sentinel_type<Iter1>::type;
  98. r = ranges::swap_ranges(as_lvalue(ranges::make_subrange(Iter1(j), Sent1(j+3))), Iter2(i));
  99. CHECK(base(r.in1) == j+3);
  100. CHECK(base(r.in2) == i+3);
  101. CHECK(i[0] == 1);
  102. CHECK(i[1] == 2);
  103. CHECK(i[2] == 3);
  104. CHECK(j[0] == 4);
  105. CHECK(j[1] == 5);
  106. CHECK(j[2] == 6);
  107. }
  108. template<class Iter1, class Iter2>
  109. void test_rng_4()
  110. {
  111. int i[3] = {1, 2, 3};
  112. int j[4] = {4, 5, 6, 7};
  113. ranges::swap_ranges_result<Iter1, Iter2> r = ranges::swap_ranges(
  114. as_lvalue(ranges::make_subrange(Iter1(i), Iter1(i+3))),
  115. as_lvalue(ranges::make_subrange(Iter2(j), Iter2(j+4))));
  116. CHECK(base(r.in1) == i+3);
  117. CHECK(base(r.in2) == j+3);
  118. CHECK(i[0] == 4);
  119. CHECK(i[1] == 5);
  120. CHECK(i[2] == 6);
  121. CHECK(j[0] == 1);
  122. CHECK(j[1] == 2);
  123. CHECK(j[2] == 3);
  124. CHECK(j[3] == 7);
  125. using Sent1 = typename sentinel_type<Iter1>::type;
  126. using Sent2 = typename sentinel_type<Iter2>::type;
  127. r = ranges::swap_ranges(
  128. as_lvalue(ranges::make_subrange(Iter1(j), Sent1(j+4))),
  129. as_lvalue(ranges::make_subrange(Iter2(i), Sent2(i+3))));
  130. CHECK(base(r.in1) == j+3);
  131. CHECK(base(r.in2) == i+3);
  132. CHECK(i[0] == 1);
  133. CHECK(i[1] == 2);
  134. CHECK(i[2] == 3);
  135. CHECK(j[0] == 4);
  136. CHECK(j[1] == 5);
  137. CHECK(j[2] == 6);
  138. CHECK(j[3] == 7);
  139. auto r2 = ranges::swap_ranges(
  140. ranges::make_subrange(Iter1(j), Sent1(j+4)),
  141. ranges::make_subrange(Iter2(i), Sent2(i+3)));
  142. CHECK(base(r2.in1) == j+3);
  143. CHECK(base(r2.in2) == i+3);
  144. CHECK(i[0] == 4);
  145. CHECK(i[1] == 5);
  146. CHECK(i[2] == 6);
  147. CHECK(j[0] == 1);
  148. CHECK(j[1] == 2);
  149. CHECK(j[2] == 3);
  150. CHECK(j[3] == 7);
  151. }
  152. template<class Iter1, class Iter2>
  153. void test_move_only()
  154. {
  155. std::unique_ptr<int> i[3];
  156. for (int k = 0; k < 3; ++k)
  157. i[k].reset(new int(k+1));
  158. std::unique_ptr<int> j[3];
  159. for (int k = 0; k < 3; ++k)
  160. j[k].reset(new int(k+4));
  161. ranges::swap_ranges_result<Iter1, Iter2> r =
  162. ranges::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
  163. CHECK(base(r.in1) == i+3);
  164. CHECK(base(r.in2) == j+3);
  165. CHECK(*i[0] == 4);
  166. CHECK(*i[1] == 5);
  167. CHECK(*i[2] == 6);
  168. CHECK(*j[0] == 1);
  169. CHECK(*j[1] == 2);
  170. CHECK(*j[2] == 3);
  171. }
  172. template<class Iter1, class Iter2>
  173. void test()
  174. {
  175. test_iter_3<Iter1, Iter2>();
  176. test_iter_4<Iter1, Iter2>();
  177. test_rng_3<Iter1, Iter2>();
  178. test_rng_4<Iter1, Iter2>();
  179. }
  180. constexpr bool test_constexpr()
  181. {
  182. using namespace ranges;
  183. int i[3] = {1, 2, 3};
  184. int j[3] = {4, 5, 6};
  185. const auto r = ranges::swap_ranges(i, j);
  186. STATIC_CHECK_RETURN(r.in1 == i + 3);
  187. STATIC_CHECK_RETURN(r.in2 == j + 3);
  188. STATIC_CHECK_RETURN(i[0] == 4);
  189. STATIC_CHECK_RETURN(i[1] == 5);
  190. STATIC_CHECK_RETURN(i[2] == 6);
  191. STATIC_CHECK_RETURN(j[0] == 1);
  192. STATIC_CHECK_RETURN(j[1] == 2);
  193. STATIC_CHECK_RETURN(j[2] == 3);
  194. return true;
  195. }
  196. int main()
  197. {
  198. test<ForwardIterator<int*>, ForwardIterator<int*> >();
  199. test<ForwardIterator<int*>, BidirectionalIterator<int*> >();
  200. test<ForwardIterator<int*>, RandomAccessIterator<int*> >();
  201. test<ForwardIterator<int*>, int*>();
  202. test<BidirectionalIterator<int*>, ForwardIterator<int*> >();
  203. test<BidirectionalIterator<int*>, BidirectionalIterator<int*> >();
  204. test<BidirectionalIterator<int*>, RandomAccessIterator<int*> >();
  205. test<BidirectionalIterator<int*>, int*>();
  206. test<RandomAccessIterator<int*>, ForwardIterator<int*> >();
  207. test<RandomAccessIterator<int*>, BidirectionalIterator<int*> >();
  208. test<RandomAccessIterator<int*>, RandomAccessIterator<int*> >();
  209. test<RandomAccessIterator<int*>, int*>();
  210. test<int*, ForwardIterator<int*> >();
  211. test<int*, BidirectionalIterator<int*> >();
  212. test<int*, RandomAccessIterator<int*> >();
  213. test<int*, int*>();
  214. test_move_only<ForwardIterator<std::unique_ptr<int>*>, ForwardIterator<std::unique_ptr<int>*> >();
  215. test_move_only<ForwardIterator<std::unique_ptr<int>*>, BidirectionalIterator<std::unique_ptr<int>*> >();
  216. test_move_only<ForwardIterator<std::unique_ptr<int>*>, RandomAccessIterator<std::unique_ptr<int>*> >();
  217. test_move_only<ForwardIterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
  218. test_move_only<BidirectionalIterator<std::unique_ptr<int>*>, ForwardIterator<std::unique_ptr<int>*> >();
  219. test_move_only<BidirectionalIterator<std::unique_ptr<int>*>, BidirectionalIterator<std::unique_ptr<int>*> >();
  220. test_move_only<BidirectionalIterator<std::unique_ptr<int>*>, RandomAccessIterator<std::unique_ptr<int>*> >();
  221. test_move_only<BidirectionalIterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
  222. test_move_only<RandomAccessIterator<std::unique_ptr<int>*>, ForwardIterator<std::unique_ptr<int>*> >();
  223. test_move_only<RandomAccessIterator<std::unique_ptr<int>*>, BidirectionalIterator<std::unique_ptr<int>*> >();
  224. test_move_only<RandomAccessIterator<std::unique_ptr<int>*>, RandomAccessIterator<std::unique_ptr<int>*> >();
  225. test_move_only<RandomAccessIterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
  226. test_move_only<std::unique_ptr<int>*, ForwardIterator<std::unique_ptr<int>*> >();
  227. test_move_only<std::unique_ptr<int>*, BidirectionalIterator<std::unique_ptr<int>*> >();
  228. test_move_only<std::unique_ptr<int>*, RandomAccessIterator<std::unique_ptr<int>*> >();
  229. test_move_only<std::unique_ptr<int>*, std::unique_ptr<int>*>();
  230. {
  231. int a[4] = {1, 2, 3, 4};
  232. int b[4] = {5, 6, 7, 8};
  233. ranges::swap_ranges(a, a + 4, b);
  234. ::check_equal(a, {5, 6, 7, 8});
  235. ::check_equal(b, {1, 2, 3, 4});
  236. ranges::swap_ranges(std::array<int, 2>{{3,4}}, a+2);
  237. ::check_equal(a, {5, 6, 3, 4});
  238. }
  239. {
  240. STATIC_CHECK(test_constexpr());
  241. }
  242. return ::test_result();
  243. }