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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <algorithm>
#include <algorithm>
#include <functional>
#include "test_macros.h"
struct A {
int i = 0;
TEST_CONSTEXPR bool operator<(const A& rhs) const { return i < rhs.i; }
static TEST_CONSTEXPR bool isEven(const A& a) { return a.i % 2 == 0; }
};
void *operator new(std::size_t, A*) = delete;
TEST_CONSTEXPR_CXX20 bool test() {
A a[4] = {};
std::sort(a, a + 4);
std::sort(a, a + 4, std::less<A>());
std::partition(a, a + 4, A::isEven);
if (TEST_STD_AT_LEAST_26_OR_RUNTIME_EVALUATED) {
std::stable_sort(a, a + 4);
std::stable_sort(a, a + 4, std::less<A>());
std::stable_partition(a, a + 4, A::isEven);
std::inplace_merge(a, a + 2, a + 4);
std::inplace_merge(a, a + 2, a + 4, std::less<A>());
}
return true;
}
int main(int, char**) {
test();
#if TEST_STD_VER >= 20
static_assert(test());
#endif
return 0;
}
|
