rotate_copy.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359
  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. // Copyright 2005 - 2007 Adobe Systems Incorporated
  13. // Distributed under the MIT License(see accompanying file LICENSE_1_0_0.txt
  14. // or a copy at http://stlab.adobe.com/licenses.html)
  15. //===----------------------------------------------------------------------===//
  16. //
  17. // The LLVM Compiler Infrastructure
  18. //
  19. // This file is dual licensed under the MIT and the University of Illinois Open
  20. // Source Licenses. See LICENSE.TXT for details.
  21. //
  22. //===----------------------------------------------------------------------===//
  23. #include <utility>
  24. #include <vector>
  25. #include <range/v3/core.hpp>
  26. #include <range/v3/algorithm/rotate_copy.hpp>
  27. #include "../simple_test.hpp"
  28. #include "../test_iterators.hpp"
  29. #include "../test_utils.hpp"
  30. template<class InIter, class OutIter, typename Sent = InIter>
  31. void test_iter()
  32. {
  33. int ia[] = {0, 1, 2, 3};
  34. const unsigned sa = sizeof(ia)/sizeof(ia[0]);
  35. int ib[sa] = {0};
  36. ranges::rotate_copy_result<InIter, OutIter> r = ranges::rotate_copy(InIter(ia), InIter(ia), Sent(ia), OutIter(ib));
  37. CHECK(base(r.in) == ia);
  38. CHECK(base(r.out) == ib);
  39. r = ranges::rotate_copy(InIter(ia), InIter(ia), Sent(ia+1), OutIter(ib));
  40. CHECK(base(r.in) == ia+1);
  41. CHECK(base(r.out) == ib+1);
  42. CHECK(ib[0] == 0);
  43. r = ranges::rotate_copy(InIter(ia), InIter(ia+1), Sent(ia+1), OutIter(ib));
  44. CHECK(base(r.in) == ia+1);
  45. CHECK(base(r.out) == ib+1);
  46. CHECK(ib[0] == 0);
  47. r = ranges::rotate_copy(InIter(ia), InIter(ia), Sent(ia+2), OutIter(ib));
  48. CHECK(base(r.in) == ia+2);
  49. CHECK(base(r.out) == ib+2);
  50. CHECK(ib[0] == 0);
  51. CHECK(ib[1] == 1);
  52. r = ranges::rotate_copy(InIter(ia), InIter(ia+1), Sent(ia+2), OutIter(ib));
  53. CHECK(base(r.in) == ia+2);
  54. CHECK(base(r.out) == ib+2);
  55. CHECK(ib[0] == 1);
  56. CHECK(ib[1] == 0);
  57. r = ranges::rotate_copy(InIter(ia), InIter(ia+2), Sent(ia+2), OutIter(ib));
  58. CHECK(base(r.in) == ia+2);
  59. CHECK(base(r.out) == ib+2);
  60. CHECK(ib[0] == 0);
  61. CHECK(ib[1] == 1);
  62. r = ranges::rotate_copy(InIter(ia), InIter(ia), Sent(ia+3), OutIter(ib));
  63. CHECK(base(r.in) == ia+3);
  64. CHECK(base(r.out) == ib+3);
  65. CHECK(ib[0] == 0);
  66. CHECK(ib[1] == 1);
  67. CHECK(ib[2] == 2);
  68. r = ranges::rotate_copy(InIter(ia), InIter(ia+1), Sent(ia+3), OutIter(ib));
  69. CHECK(base(r.in) == ia+3);
  70. CHECK(base(r.out) == ib+3);
  71. CHECK(ib[0] == 1);
  72. CHECK(ib[1] == 2);
  73. CHECK(ib[2] == 0);
  74. r = ranges::rotate_copy(InIter(ia), InIter(ia+2), Sent(ia+3), OutIter(ib));
  75. CHECK(base(r.in) == ia+3);
  76. CHECK(base(r.out) == ib+3);
  77. CHECK(ib[0] == 2);
  78. CHECK(ib[1] == 0);
  79. CHECK(ib[2] == 1);
  80. r = ranges::rotate_copy(InIter(ia), InIter(ia+3), Sent(ia+3), OutIter(ib));
  81. CHECK(base(r.in) == ia+3);
  82. CHECK(base(r.out) == ib+3);
  83. CHECK(ib[0] == 0);
  84. CHECK(ib[1] == 1);
  85. CHECK(ib[2] == 2);
  86. r = ranges::rotate_copy(InIter(ia), InIter(ia), Sent(ia+4), OutIter(ib));
  87. CHECK(base(r.in) == ia+4);
  88. CHECK(base(r.out) == ib+4);
  89. CHECK(ib[0] == 0);
  90. CHECK(ib[1] == 1);
  91. CHECK(ib[2] == 2);
  92. CHECK(ib[3] == 3);
  93. r = ranges::rotate_copy(InIter(ia), InIter(ia+1), Sent(ia+4), OutIter(ib));
  94. CHECK(base(r.in) == ia+4);
  95. CHECK(base(r.out) == ib+4);
  96. CHECK(ib[0] == 1);
  97. CHECK(ib[1] == 2);
  98. CHECK(ib[2] == 3);
  99. CHECK(ib[3] == 0);
  100. r = ranges::rotate_copy(InIter(ia), InIter(ia+2), Sent(ia+4), OutIter(ib));
  101. CHECK(base(r.in) == ia+4);
  102. CHECK(base(r.out) == ib+4);
  103. CHECK(ib[0] == 2);
  104. CHECK(ib[1] == 3);
  105. CHECK(ib[2] == 0);
  106. CHECK(ib[3] == 1);
  107. r = ranges::rotate_copy(InIter(ia), InIter(ia+3), Sent(ia+4), OutIter(ib));
  108. CHECK(base(r.in) == ia+4);
  109. CHECK(base(r.out) == ib+4);
  110. CHECK(ib[0] == 3);
  111. CHECK(ib[1] == 0);
  112. CHECK(ib[2] == 1);
  113. CHECK(ib[3] == 2);
  114. r = ranges::rotate_copy(InIter(ia), InIter(ia+4), Sent(ia+4), OutIter(ib));
  115. CHECK(base(r.in) == ia+4);
  116. CHECK(base(r.out) == ib+4);
  117. CHECK(ib[0] == 0);
  118. CHECK(ib[1] == 1);
  119. CHECK(ib[2] == 2);
  120. CHECK(ib[3] == 3);
  121. }
  122. template<class InIter, class OutIter, typename Sent = InIter>
  123. void test_rng()
  124. {
  125. int ia[] = {0, 1, 2, 3};
  126. const unsigned sa = sizeof(ia)/sizeof(ia[0]);
  127. int ib[sa] = {0};
  128. ranges::rotate_copy_result<InIter, OutIter> r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia))), InIter(ia), OutIter(ib));
  129. CHECK(base(r.in) == ia);
  130. CHECK(base(r.out) == ib);
  131. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+1))), InIter(ia), OutIter(ib));
  132. CHECK(base(r.in) == ia+1);
  133. CHECK(base(r.out) == ib+1);
  134. CHECK(ib[0] == 0);
  135. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+1))), InIter(ia+1), OutIter(ib));
  136. CHECK(base(r.in) == ia+1);
  137. CHECK(base(r.out) == ib+1);
  138. CHECK(ib[0] == 0);
  139. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+2))), InIter(ia), OutIter(ib));
  140. CHECK(base(r.in) == ia+2);
  141. CHECK(base(r.out) == ib+2);
  142. CHECK(ib[0] == 0);
  143. CHECK(ib[1] == 1);
  144. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+2))), InIter(ia+1), OutIter(ib));
  145. CHECK(base(r.in) == ia+2);
  146. CHECK(base(r.out) == ib+2);
  147. CHECK(ib[0] == 1);
  148. CHECK(ib[1] == 0);
  149. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+2))), InIter(ia+2), OutIter(ib));
  150. CHECK(base(r.in) == ia+2);
  151. CHECK(base(r.out) == ib+2);
  152. CHECK(ib[0] == 0);
  153. CHECK(ib[1] == 1);
  154. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+3))), InIter(ia), OutIter(ib));
  155. CHECK(base(r.in) == ia+3);
  156. CHECK(base(r.out) == ib+3);
  157. CHECK(ib[0] == 0);
  158. CHECK(ib[1] == 1);
  159. CHECK(ib[2] == 2);
  160. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+3))), InIter(ia+1), OutIter(ib));
  161. CHECK(base(r.in) == ia+3);
  162. CHECK(base(r.out) == ib+3);
  163. CHECK(ib[0] == 1);
  164. CHECK(ib[1] == 2);
  165. CHECK(ib[2] == 0);
  166. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+3))), InIter(ia+2), OutIter(ib));
  167. CHECK(base(r.in) == ia+3);
  168. CHECK(base(r.out) == ib+3);
  169. CHECK(ib[0] == 2);
  170. CHECK(ib[1] == 0);
  171. CHECK(ib[2] == 1);
  172. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+3))), InIter(ia+3), OutIter(ib));
  173. CHECK(base(r.in) == ia+3);
  174. CHECK(base(r.out) == ib+3);
  175. CHECK(ib[0] == 0);
  176. CHECK(ib[1] == 1);
  177. CHECK(ib[2] == 2);
  178. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+4))), InIter(ia), OutIter(ib));
  179. CHECK(base(r.in) == ia+4);
  180. CHECK(base(r.out) == ib+4);
  181. CHECK(ib[0] == 0);
  182. CHECK(ib[1] == 1);
  183. CHECK(ib[2] == 2);
  184. CHECK(ib[3] == 3);
  185. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+4))), InIter(ia+1), OutIter(ib));
  186. CHECK(base(r.in) == ia+4);
  187. CHECK(base(r.out) == ib+4);
  188. CHECK(ib[0] == 1);
  189. CHECK(ib[1] == 2);
  190. CHECK(ib[2] == 3);
  191. CHECK(ib[3] == 0);
  192. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+4))), InIter(ia+2), OutIter(ib));
  193. CHECK(base(r.in) == ia+4);
  194. CHECK(base(r.out) == ib+4);
  195. CHECK(ib[0] == 2);
  196. CHECK(ib[1] == 3);
  197. CHECK(ib[2] == 0);
  198. CHECK(ib[3] == 1);
  199. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+4))), InIter(ia+3), OutIter(ib));
  200. CHECK(base(r.in) == ia+4);
  201. CHECK(base(r.out) == ib+4);
  202. CHECK(ib[0] == 3);
  203. CHECK(ib[1] == 0);
  204. CHECK(ib[2] == 1);
  205. CHECK(ib[3] == 2);
  206. r = ranges::rotate_copy(::as_lvalue(ranges::make_subrange(InIter(ia), Sent(ia+4))), InIter(ia+4), OutIter(ib));
  207. CHECK(base(r.in) == ia+4);
  208. CHECK(base(r.out) == ib+4);
  209. CHECK(ib[0] == 0);
  210. CHECK(ib[1] == 1);
  211. CHECK(ib[2] == 2);
  212. CHECK(ib[3] == 3);
  213. }
  214. template<class InIter, class OutIter, typename Sent = InIter>
  215. void test()
  216. {
  217. test_iter<InIter, OutIter, Sent>();
  218. test_rng<InIter, OutIter, Sent>();
  219. }
  220. struct S
  221. {
  222. int i;
  223. };
  224. constexpr bool test_constexpr()
  225. {
  226. using namespace ranges;
  227. int rgi[] = {0, 1, 2, 3, 4, 5};
  228. int rgo[6] = {0};
  229. const auto r = ranges::rotate_copy(rgi, rgi + 2, rgo);
  230. STATIC_CHECK_RETURN(r.in == ranges::end(rgi));
  231. STATIC_CHECK_RETURN(r.out == ranges::end(rgo));
  232. STATIC_CHECK_RETURN(rgo[0] == 2);
  233. STATIC_CHECK_RETURN(rgo[1] == 3);
  234. STATIC_CHECK_RETURN(rgo[2] == 4);
  235. STATIC_CHECK_RETURN(rgo[3] == 5);
  236. STATIC_CHECK_RETURN(rgo[4] == 0);
  237. STATIC_CHECK_RETURN(rgo[5] == 1);
  238. return true;
  239. }
  240. int main()
  241. {
  242. test<ForwardIterator<const int*>, OutputIterator<int*> >();
  243. test<ForwardIterator<const int*>, ForwardIterator<int*> >();
  244. test<ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  245. test<ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  246. test<ForwardIterator<const int*>, int*>();
  247. test<BidirectionalIterator<const int*>, OutputIterator<int*> >();
  248. test<BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  249. test<BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  250. test<BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  251. test<BidirectionalIterator<const int*>, int*>();
  252. test<RandomAccessIterator<const int*>, OutputIterator<int*> >();
  253. test<RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  254. test<RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  255. test<RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  256. test<RandomAccessIterator<const int*>, int*>();
  257. test<ForwardIterator<const int*>, OutputIterator<int*>, Sentinel<const int*> >();
  258. test<ForwardIterator<const int*>, ForwardIterator<int*>, Sentinel<const int*> >();
  259. test<ForwardIterator<const int*>, BidirectionalIterator<int*>, Sentinel<const int*> >();
  260. test<ForwardIterator<const int*>, RandomAccessIterator<int*>, Sentinel<const int*> >();
  261. test<ForwardIterator<const int*>, int*, Sentinel<const int*> >();
  262. test<BidirectionalIterator<const int*>, OutputIterator<int*>, Sentinel<const int*> >();
  263. test<BidirectionalIterator<const int*>, ForwardIterator<int*>, Sentinel<const int*> >();
  264. test<BidirectionalIterator<const int*>, BidirectionalIterator<int*>, Sentinel<const int*> >();
  265. test<BidirectionalIterator<const int*>, RandomAccessIterator<int*>, Sentinel<const int*> >();
  266. test<BidirectionalIterator<const int*>, int*, Sentinel<const int*> >();
  267. test<RandomAccessIterator<const int*>, OutputIterator<int*>, Sentinel<const int*> >();
  268. test<RandomAccessIterator<const int*>, ForwardIterator<int*>, Sentinel<const int*> >();
  269. test<RandomAccessIterator<const int*>, BidirectionalIterator<int*>, Sentinel<const int*> >();
  270. test<RandomAccessIterator<const int*>, RandomAccessIterator<int*>, Sentinel<const int*> >();
  271. test<RandomAccessIterator<const int*>, int*, Sentinel<const int*> >();
  272. test<const int*, OutputIterator<int*> >();
  273. test<const int*, ForwardIterator<int*> >();
  274. test<const int*, BidirectionalIterator<int*> >();
  275. test<const int*, RandomAccessIterator<int*> >();
  276. test<const int*, int*>();
  277. // test rvalue ranges
  278. {
  279. int rgi[] = {0,1,2,3,4,5};
  280. int rgo[6] = {0};
  281. auto r = ranges::rotate_copy(std::move(rgi), rgi+2, rgo);
  282. #ifndef RANGES_WORKAROUND_MSVC_573728
  283. CHECK(::is_dangling(r.in));
  284. #endif // RANGES_WORKAROUND_MSVC_573728
  285. CHECK(r.out == ranges::end(rgo));
  286. CHECK(rgo[0] == 2);
  287. CHECK(rgo[1] == 3);
  288. CHECK(rgo[2] == 4);
  289. CHECK(rgo[3] == 5);
  290. CHECK(rgo[4] == 0);
  291. CHECK(rgo[5] == 1);
  292. }
  293. {
  294. std::vector<int> rgi{0,1,2,3,4,5};
  295. int rgo[6] = {0};
  296. auto r = ranges::rotate_copy(std::move(rgi), rgi.begin()+2, rgo);
  297. CHECK(::is_dangling(r.in));
  298. CHECK(r.out == ranges::end(rgo));
  299. CHECK(rgo[0] == 2);
  300. CHECK(rgo[1] == 3);
  301. CHECK(rgo[2] == 4);
  302. CHECK(rgo[3] == 5);
  303. CHECK(rgo[4] == 0);
  304. CHECK(rgo[5] == 1);
  305. }
  306. {
  307. STATIC_CHECK(test_constexpr());
  308. }
  309. return ::test_result();
  310. }