xref: /llvm-project/pstl/test/std/algorithms/alg.merge/merge.pass.cpp (revision 3491119f9ba466ed871a789eb91e3b7577e36272)
1 // -*- C++ -*-
2 //===-- merge.pass.cpp ----------------------------------------------------===//
3 //
4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5 // See https://llvm.org/LICENSE.txt for license information.
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //
8 //===----------------------------------------------------------------------===//
9 
10 #include "support/pstl_test_config.h"
11 
12 #include <execution>
13 #include <algorithm>
14 #include <functional>
15 
16 #include "support/utils.h"
17 
18 using namespace TestUtils;
19 
20 struct test_merge
21 {
22     template <typename Policy, typename InputIterator1, typename InputIterator2, typename OutputIterator,
23               typename Compare>
24     void
25     operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2,
26                OutputIterator out_first, OutputIterator out_last, Compare comp)
27     {
28         using namespace std;
29         {
30             const auto res = merge(exec, first1, last1, first2, last2, out_first, comp);
31             EXPECT_TRUE(res == out_last, "wrong return result from merge with predicate");
32             EXPECT_TRUE(is_sorted(out_first, res, comp), "wrong result from merge with predicate");
33             EXPECT_TRUE(includes(out_first, res, first1, last1, comp), "first sequence is not a part of result");
34             EXPECT_TRUE(includes(out_first, res, first2, last2, comp), "second sequence is not a part of result");
35         }
36         {
37             const auto res = merge(exec, first1, last1, first2, last2, out_first);
38             EXPECT_TRUE(res == out_last, "wrong return result from merge");
39             EXPECT_TRUE(is_sorted(out_first, res), "wrong result from merge");
40         }
41     }
42 
43     // for reverse iterators
44     template <typename Policy, typename InputIterator1, typename InputIterator2, typename OutputIterator,
45               typename Compare>
46     void
47     operator()(Policy&& exec, std::reverse_iterator<InputIterator1> first1, std::reverse_iterator<InputIterator1> last1,
48                std::reverse_iterator<InputIterator2> first2, std::reverse_iterator<InputIterator2> last2,
49                std::reverse_iterator<OutputIterator> out_first, std::reverse_iterator<OutputIterator> out_last,
50                Compare)
51     {
52         using namespace std;
53         typedef typename std::iterator_traits<std::reverse_iterator<InputIterator1>>::value_type T;
54         const auto res = merge(exec, first1, last1, first2, last2, out_first, std::greater<T>());
55 
56         EXPECT_TRUE(res == out_last, "wrong return result from merge with predicate");
57         EXPECT_TRUE(is_sorted(out_first, res, std::greater<T>()), "wrong result from merge with predicate");
58         EXPECT_TRUE(includes(out_first, res, first1, last1, std::greater<T>()),
59                     "first sequence is not a part of result");
60         EXPECT_TRUE(includes(out_first, res, first2, last2, std::greater<T>()),
61                     "second sequence is not a part of result");
62     }
63 };
64 
65 template <typename T, typename Generator1, typename Generator2>
66 void
67 test_merge_by_type(Generator1 generator1, Generator2 generator2)
68 {
69     using namespace std;
70     size_t max_size = 100000;
71     Sequence<T> in1(max_size, generator1);
72     Sequence<T> in2(max_size / 2, generator2);
73     Sequence<T> out(in1.size() + in2.size());
74     std::sort(in1.begin(), in1.end());
75     std::sort(in2.begin(), in2.end());
76 
77     for (size_t size = 0; size <= max_size; size = size <= 16 ? size + 1 : size_t(3.1415 * size))
78     {
79         invoke_on_all_policies(test_merge(), in1.cbegin(), in1.cbegin() + size, in2.data(), in2.data() + size / 2,
80                                out.begin(), out.begin() + 1.5 * size, std::less<T>());
81         invoke_on_all_policies(test_merge(), in1.data(), in1.data() + size, in2.cbegin(), in2.cbegin() + size / 2,
82                                out.begin(), out.begin() + 3 * size / 2, std::less<T>());
83     }
84 }
85 
86 template <typename T>
87 struct test_non_const
88 {
89     template <typename Policy, typename InputIterator, typename OutputIterator>
90     void
91     operator()(Policy&& exec, InputIterator input_iter, OutputIterator out_iter)
92     {
93         merge(exec, input_iter, input_iter, input_iter, input_iter, out_iter, non_const(std::less<T>()));
94     }
95 };
96 
97 int32_t
98 main()
99 {
100     test_merge_by_type<int32_t>([](size_t v) { return (v % 2 == 0 ? v : -v) * 3; }, [](size_t v) { return v * 2; });
101     test_merge_by_type<float64_t>([](size_t v) { return float64_t(v); }, [](size_t v) { return float64_t(v - 100); });
102 
103 #if !_PSTL_ICC_16_17_TEST_64_TIMEOUT
104     test_merge_by_type<Wrapper<int16_t>>([](size_t v) { return Wrapper<int16_t>(v % 100); },
105                                          [](size_t v) { return Wrapper<int16_t>(v % 10); });
106 #endif
107 
108     test_algo_basic_double<int32_t>(run_for_rnd_fw<test_non_const<int32_t>>());
109 
110     std::cout << done() << std::endl;
111     return 0;
112 }
113