set_symmetric_difference.hpp 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  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. //
  14. // The LLVM Compiler Infrastructure
  15. //
  16. // This file is dual licensed under the MIT and the University of Illinois Open
  17. // Source Licenses. See LICENSE.TXT for details.
  18. //
  19. //===----------------------------------------------------------------------===//
  20. #include <algorithm>
  21. #include <functional>
  22. #include <vector>
  23. #include <range/v3/core.hpp>
  24. #include <range/v3/algorithm/fill.hpp>
  25. #include <range/v3/algorithm/set_algorithm.hpp>
  26. #include <range/v3/algorithm/lexicographical_compare.hpp>
  27. #include "../simple_test.hpp"
  28. #include "../test_utils.hpp"
  29. #include "../test_iterators.hpp"
  30. template<class Iter1, class Iter2, class OutIter>
  31. void
  32. test_iter()
  33. {
  34. int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
  35. static const int sa = sizeof(ia)/sizeof(ia[0]);
  36. int ib[] = {2, 4, 4, 6};
  37. static const int sb = sizeof(ib)/sizeof(ib[0]);
  38. int ic[20];
  39. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  40. static const int sr = sizeof(ir)/sizeof(ir[0]);
  41. auto set_symmetric_difference = ::make_testable_2(ranges::set_symmetric_difference);
  42. set_symmetric_difference(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), OutIter(ic)).
  43. check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
  44. {
  45. CHECK((base(res.out) - ic) == sr);
  46. CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
  47. ranges::fill(ic, 0);
  48. }
  49. );
  50. set_symmetric_difference(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), OutIter(ic)).
  51. check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
  52. {
  53. CHECK((base(res.out) - ic) == sr);
  54. CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
  55. ranges::fill(ic, 0);
  56. }
  57. );
  58. }
  59. template<class Iter1, class Iter2, class OutIter>
  60. void
  61. test_comp()
  62. {
  63. int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
  64. static const int sa = sizeof(ia)/sizeof(ia[0]);
  65. int ib[] = {2, 4, 4, 6};
  66. static const int sb = sizeof(ib)/sizeof(ib[0]);
  67. int ic[20];
  68. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  69. static const int sr = sizeof(ir)/sizeof(ir[0]);
  70. auto set_symmetric_difference = ::make_testable_2(ranges::set_symmetric_difference);
  71. set_symmetric_difference(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>()).
  72. check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
  73. {
  74. CHECK((base(res.out) - ic) == sr);
  75. CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
  76. ranges::fill(ic, 0);
  77. }
  78. );
  79. set_symmetric_difference(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>()).
  80. check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
  81. {
  82. CHECK((base(res.out) - ic) == sr);
  83. CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
  84. ranges::fill(ic, 0);
  85. }
  86. );
  87. }
  88. template<class Iter1, class Iter2, class OutIter>
  89. void test()
  90. {
  91. test_iter<Iter1, Iter2, OutIter>();
  92. test_comp<Iter1, Iter2, OutIter>();
  93. }
  94. struct S
  95. {
  96. int i;
  97. };
  98. struct T
  99. {
  100. int j;
  101. };
  102. struct U
  103. {
  104. int k;
  105. U& operator=(S s) { k = s.i; return *this;}
  106. U& operator=(T t) { k = t.j; return *this;}
  107. };
  108. constexpr bool test_constexpr()
  109. {
  110. using namespace ranges;
  111. int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
  112. int ib[] = {2, 4, 4, 6};
  113. int ic[20] = {0};
  114. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  115. const int sr = sizeof(ir) / sizeof(ir[0]);
  116. const auto res1 = set_symmetric_difference(ia, ib, ic, less{});
  117. STATIC_CHECK_RETURN(res1.in1 == end(ia));
  118. STATIC_CHECK_RETURN(res1.in2 == end(ib));
  119. STATIC_CHECK_RETURN((res1.out - begin(ic)) == sr);
  120. STATIC_CHECK_RETURN(lexicographical_compare(ic, res1.out, ir, ir + sr, less{}) == 0);
  121. fill(ic, 0);
  122. const auto res2 = set_symmetric_difference(ib, ia, ic, less{});
  123. STATIC_CHECK_RETURN(res2.in1 == end(ib));
  124. STATIC_CHECK_RETURN(res2.in2 == end(ia));
  125. STATIC_CHECK_RETURN(res2.out - begin(ic) == sr);
  126. STATIC_CHECK_RETURN(lexicographical_compare(ic, res2.out, ir, ir + sr, less{}) == 0);
  127. return true;
  128. }
  129. int main()
  130. {
  131. #ifdef SET_SYMMETRIC_DIFFERENCE_1
  132. test<InputIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
  133. test<InputIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
  134. test<InputIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
  135. test<InputIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
  136. test<InputIterator<const int*>, InputIterator<const int*>, int*>();
  137. test<InputIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
  138. test<InputIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
  139. test<InputIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  140. test<InputIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  141. test<InputIterator<const int*>, ForwardIterator<const int*>, int*>();
  142. test<InputIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
  143. test<InputIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  144. test<InputIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  145. test<InputIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  146. test<InputIterator<const int*>, BidirectionalIterator<const int*>, int*>();
  147. test<InputIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
  148. test<InputIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  149. test<InputIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  150. test<InputIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  151. test<InputIterator<const int*>, RandomAccessIterator<const int*>, int*>();
  152. test<InputIterator<const int*>, const int*, OutputIterator<int*> >();
  153. test<InputIterator<const int*>, const int*, ForwardIterator<int*> >();
  154. test<InputIterator<const int*>, const int*, BidirectionalIterator<int*> >();
  155. test<InputIterator<const int*>, const int*, RandomAccessIterator<int*> >();
  156. test<InputIterator<const int*>, const int*, int*>();
  157. #endif
  158. #ifdef SET_SYMMETRIC_DIFFERENCE_2
  159. test<ForwardIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
  160. test<ForwardIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
  161. test<ForwardIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
  162. test<ForwardIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
  163. test<ForwardIterator<const int*>, InputIterator<const int*>, int*>();
  164. test<ForwardIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
  165. test<ForwardIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
  166. test<ForwardIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  167. test<ForwardIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  168. test<ForwardIterator<const int*>, ForwardIterator<const int*>, int*>();
  169. test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
  170. test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  171. test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  172. test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  173. test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, int*>();
  174. test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
  175. test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  176. test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  177. test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  178. test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, int*>();
  179. test<ForwardIterator<const int*>, const int*, OutputIterator<int*> >();
  180. test<ForwardIterator<const int*>, const int*, ForwardIterator<int*> >();
  181. test<ForwardIterator<const int*>, const int*, BidirectionalIterator<int*> >();
  182. test<ForwardIterator<const int*>, const int*, RandomAccessIterator<int*> >();
  183. test<ForwardIterator<const int*>, const int*, int*>();
  184. #endif
  185. #ifdef SET_SYMMETRIC_DIFFERENCE_3
  186. test<BidirectionalIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
  187. test<BidirectionalIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
  188. test<BidirectionalIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
  189. test<BidirectionalIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
  190. test<BidirectionalIterator<const int*>, InputIterator<const int*>, int*>();
  191. test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
  192. test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
  193. test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  194. test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  195. test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, int*>();
  196. test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
  197. test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  198. test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  199. test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  200. test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, int*>();
  201. test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
  202. test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  203. test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  204. test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  205. test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, int*>();
  206. test<BidirectionalIterator<const int*>, const int*, OutputIterator<int*> >();
  207. test<BidirectionalIterator<const int*>, const int*, ForwardIterator<int*> >();
  208. test<BidirectionalIterator<const int*>, const int*, BidirectionalIterator<int*> >();
  209. test<BidirectionalIterator<const int*>, const int*, RandomAccessIterator<int*> >();
  210. test<BidirectionalIterator<const int*>, const int*, int*>();
  211. #endif
  212. #ifdef SET_SYMMETRIC_DIFFERENCE_4
  213. test<RandomAccessIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
  214. test<RandomAccessIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
  215. test<RandomAccessIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
  216. test<RandomAccessIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
  217. test<RandomAccessIterator<const int*>, InputIterator<const int*>, int*>();
  218. test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
  219. test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
  220. test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  221. test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  222. test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, int*>();
  223. test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
  224. test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  225. test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  226. test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  227. test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, int*>();
  228. test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
  229. test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  230. test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  231. test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  232. test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, int*>();
  233. test<RandomAccessIterator<const int*>, const int*, OutputIterator<int*> >();
  234. test<RandomAccessIterator<const int*>, const int*, ForwardIterator<int*> >();
  235. test<RandomAccessIterator<const int*>, const int*, BidirectionalIterator<int*> >();
  236. test<RandomAccessIterator<const int*>, const int*, RandomAccessIterator<int*> >();
  237. test<RandomAccessIterator<const int*>, const int*, int*>();
  238. #endif
  239. #ifdef SET_SYMMETRIC_DIFFERENCE_5
  240. test<const int*, InputIterator<const int*>, OutputIterator<int*> >();
  241. test<const int*, InputIterator<const int*>, BidirectionalIterator<int*> >();
  242. test<const int*, InputIterator<const int*>, BidirectionalIterator<int*> >();
  243. test<const int*, InputIterator<const int*>, RandomAccessIterator<int*> >();
  244. test<const int*, InputIterator<const int*>, int*>();
  245. test<const int*, ForwardIterator<const int*>, OutputIterator<int*> >();
  246. test<const int*, ForwardIterator<const int*>, ForwardIterator<int*> >();
  247. test<const int*, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
  248. test<const int*, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
  249. test<const int*, ForwardIterator<const int*>, int*>();
  250. test<const int*, BidirectionalIterator<const int*>, OutputIterator<int*> >();
  251. test<const int*, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
  252. test<const int*, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
  253. test<const int*, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
  254. test<const int*, BidirectionalIterator<const int*>, int*>();
  255. test<const int*, RandomAccessIterator<const int*>, OutputIterator<int*> >();
  256. test<const int*, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
  257. test<const int*, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
  258. test<const int*, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
  259. test<const int*, RandomAccessIterator<const int*>, int*>();
  260. test<const int*, const int*, OutputIterator<int*> >();
  261. test<const int*, const int*, ForwardIterator<int*> >();
  262. test<const int*, const int*, BidirectionalIterator<int*> >();
  263. test<const int*, const int*, RandomAccessIterator<int*> >();
  264. test<const int*, const int*, int*>();
  265. #endif
  266. #ifdef SET_SYMMETRIC_DIFFERENCE_6
  267. // Test projections
  268. {
  269. S ia[] = {S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
  270. T ib[] = {T{2}, T{4}, T{4}, T{6}};
  271. U ic[20];
  272. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  273. static const int sr = sizeof(ir)/sizeof(ir[0]);
  274. ranges::set_symmetric_difference_result<S *, T *, U *> res1 =
  275. ranges::set_symmetric_difference(ia, ib, ic, std::less<int>(), &S::i, &T::j);
  276. CHECK((res1.out - ic) == sr);
  277. CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  278. ranges::fill(ic, U{0});
  279. ranges::set_symmetric_difference_result<T *, S *, U *> res2 =
  280. ranges::set_symmetric_difference(ib, ia, ic, std::less<int>(), &T::j, &S::i);
  281. CHECK((res2.out - ic) == sr);
  282. CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  283. }
  284. // Test rvalue ranges
  285. #ifndef RANGES_WORKAROUND_MSVC_573728
  286. {
  287. S ia[] = {S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
  288. T ib[] = {T{2}, T{4}, T{4}, T{6}};
  289. U ic[20];
  290. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  291. static const int sr = sizeof(ir)/sizeof(ir[0]);
  292. auto res1 =
  293. ranges::set_symmetric_difference(std::move(ia), ranges::views::all(ib), ic, std::less<int>(), &S::i, &T::j);
  294. CHECK(::is_dangling(res1.in1));
  295. CHECK(res1.in2 == ranges::end(ib));
  296. CHECK((res1.out - ic) == sr);
  297. CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  298. ranges::fill(ic, U{0});
  299. auto res2 =
  300. ranges::set_symmetric_difference(ranges::views::all(ib), std::move(ia), ic, std::less<int>(), &T::j, &S::i);
  301. CHECK(res2.in1 == ranges::end(ib));
  302. CHECK(::is_dangling(res2.in2));
  303. CHECK((res2.out - ic) == sr);
  304. CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  305. }
  306. #endif // RANGES_WORKAROUND_MSVC_573728
  307. {
  308. std::vector<S> ia{S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
  309. std::vector<T> ib{T{2}, T{4}, T{4}, T{6}};
  310. U ic[20];
  311. int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
  312. static const int sr = sizeof(ir)/sizeof(ir[0]);
  313. auto res1 =
  314. ranges::set_symmetric_difference(std::move(ia), ranges::views::all(ib), ic, std::less<int>(), &S::i, &T::j);
  315. CHECK(::is_dangling(res1.in1));
  316. CHECK(res1.in2 == ranges::end(ib));
  317. CHECK((res1.out - ic) == sr);
  318. CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  319. ranges::fill(ic, U{0});
  320. auto res2 =
  321. ranges::set_symmetric_difference(ranges::views::all(ib), std::move(ia), ic, std::less<int>(), &T::j, &S::i);
  322. CHECK(res2.in1 == ranges::end(ib));
  323. CHECK(::is_dangling(res2.in2));
  324. CHECK((res2.out - ic) == sr);
  325. CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
  326. }
  327. {
  328. STATIC_CHECK(test_constexpr());
  329. }
  330. #endif
  331. return ::test_result();
  332. }