1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: clang-8
// <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// && HasLess<InIter1::value_type, InIter2::value_type>
// constexpr OutIter // constexpr after C++17
// merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
// OutIter result);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#include "../sortable_helpers.h"
template<class T, class Iter1, class Iter2, class OutIter>
TEST_CONSTEXPR_CXX20 void test4()
{
const T a[] = {11, 33, 31, 41};
const T b[] = {22, 32, 43, 42, 52};
{
T result[20] = {};
T expected[] = {11, 22, 33, 31, 32, 41, 43, 42, 52};
OutIter end = std::merge(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result));
assert(std::lexicographical_compare(result, base(end), expected, expected+9, T::less) == 0);
for (const T *it = base(end); it != result+20; ++it) {
assert(it->value == 0);
}
}
{
T result[20] = {};
T expected[] = {11, 22, 32, 33, 31, 43, 42, 41, 52};
OutIter end = std::merge(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result));
assert(std::lexicographical_compare(result, base(end), expected, expected+9, T::less) == 0);
for (const T *it = base(end); it != result+20; ++it) {
assert(it->value == 0);
}
}
}
template<class T, class Iter1, class Iter2>
TEST_CONSTEXPR_CXX20 void test3()
{
test4<T, Iter1, Iter2, output_iterator<T*> >();
test4<T, Iter1, Iter2, forward_iterator<T*> >();
test4<T, Iter1, Iter2, bidirectional_iterator<T*> >();
test4<T, Iter1, Iter2, random_access_iterator<T*> >();
test4<T, Iter1, Iter2, T*>();
}
template<class T, class Iter1>
TEST_CONSTEXPR_CXX20 void test2()
{
test3<T, Iter1, cpp17_input_iterator<const T*> >();
test3<T, Iter1, forward_iterator<const T*> >();
test3<T, Iter1, bidirectional_iterator<const T*> >();
test3<T, Iter1, random_access_iterator<const T*> >();
test3<T, Iter1, const T*>();
}
template<class T>
TEST_CONSTEXPR_CXX20 void test1()
{
test2<T, cpp17_input_iterator<const T*> >();
test2<T, forward_iterator<const T*> >();
test2<T, bidirectional_iterator<const T*> >();
test2<T, random_access_iterator<const T*> >();
test2<T, const T*>();
}
TEST_CONSTEXPR_CXX20 bool test()
{
test1<TrivialSortable>();
test1<NonTrivialSortable>();
return true;
}
int main(int, char**)
{
test();
#if TEST_STD_VER > 17
static_assert(test());
#endif
return 0;
}
|
