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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17
// <compare>
// class strong_ordering
#include <compare>
#include <type_traits>
#include <cassert>
#include "test_macros.h"
const volatile void* volatile sink;
void test_static_members() {
DoNotOptimize(&std::strong_ordering::less);
DoNotOptimize(&std::strong_ordering::equal);
DoNotOptimize(&std::strong_ordering::equivalent);
DoNotOptimize(&std::strong_ordering::greater);
}
void test_signatures() {
auto& Eq = std::strong_ordering::equivalent;
ASSERT_NOEXCEPT(Eq == 0);
ASSERT_NOEXCEPT(0 == Eq);
ASSERT_NOEXCEPT(Eq != 0);
ASSERT_NOEXCEPT(0 != Eq);
ASSERT_NOEXCEPT(0 < Eq);
ASSERT_NOEXCEPT(Eq < 0);
ASSERT_NOEXCEPT(0 <= Eq);
ASSERT_NOEXCEPT(Eq <= 0);
ASSERT_NOEXCEPT(0 > Eq);
ASSERT_NOEXCEPT(Eq > 0);
ASSERT_NOEXCEPT(0 >= Eq);
ASSERT_NOEXCEPT(Eq >= 0);
#ifndef TEST_HAS_NO_SPACESHIP_OPERATOR
ASSERT_NOEXCEPT(0 <=> Eq);
ASSERT_NOEXCEPT(Eq <=> 0);
ASSERT_SAME_TYPE(decltype(Eq <=> 0), std::strong_ordering);
ASSERT_SAME_TYPE(decltype(0 <=> Eq), std::strong_ordering);
#endif
}
constexpr bool test_conversion() {
static_assert(std::is_convertible<const std::strong_ordering&,
std::weak_equality>::value, "");
{ // value == 0
auto V = std::strong_ordering::equivalent;
std::weak_equality WV = V;
assert(WV == 0);
}
std::strong_ordering WeakTestCases[] = {
std::strong_ordering::less,
std::strong_ordering::greater,
};
for (auto V : WeakTestCases)
{ // value != 0
std::weak_equality WV = V;
assert(WV != 0);
}
static_assert(std::is_convertible<const std::strong_ordering&,
std::strong_equality>::value, "");
{ // value == 0
auto V = std::strong_ordering::equivalent;
std::strong_equality WV = V;
assert(WV == 0);
}
{ // value == 0
auto V = std::strong_ordering::equal;
std::strong_equality WV = V;
assert(WV == 0);
}
std::strong_ordering StrongTestCases[] = {
std::strong_ordering::less,
std::strong_ordering::greater,
};
for (auto V : StrongTestCases)
{ // value != 0
std::strong_equality WV = V;
assert(WV != 0);
}
static_assert(std::is_convertible<const std::strong_ordering&,
std::partial_ordering>::value, "");
{ // value == 0
auto V = std::strong_ordering::equivalent;
std::partial_ordering WV = V;
assert(WV == 0);
}
{ // value < 0
auto V = std::strong_ordering::less;
std::partial_ordering WV = V;
assert(WV < 0);
}
{ // value > 0
auto V = std::strong_ordering::greater;
std::partial_ordering WV = V;
assert(WV > 0);
}
static_assert(std::is_convertible<const std::strong_ordering&,
std::weak_ordering>::value, "");
{ // value == 0
auto V = std::strong_ordering::equivalent;
std::weak_ordering WV = V;
assert(WV == 0);
}
{ // value < 0
auto V = std::strong_ordering::less;
std::weak_ordering WV = V;
assert(WV < 0);
}
{ // value > 0
auto V = std::strong_ordering::greater;
std::weak_ordering WV = V;
assert(WV > 0);
}
return true;
}
constexpr bool test_constexpr() {
auto& Eq = std::strong_ordering::equal;
auto& Equiv = std::strong_ordering::equivalent;
auto& Less = std::strong_ordering::less;
auto& Greater = std::strong_ordering::greater;
struct {
std::strong_ordering Value;
bool ExpectEq;
bool ExpectNeq;
bool ExpectLess;
bool ExpectGreater;
} TestCases[] = {
{Eq, true, false, false, false},
{Equiv, true, false, false, false},
{Less, false, true, true, false},
{Greater, false, true, false, true},
};
for (auto TC : TestCases) {
auto V = TC.Value;
assert((V == 0) == TC.ExpectEq);
assert((0 == V) == TC.ExpectEq);
assert((V != 0) == TC.ExpectNeq);
assert((0 != V) == TC.ExpectNeq);
assert((V < 0) == TC.ExpectLess);
assert((V > 0) == TC.ExpectGreater);
assert((V <= 0) == (TC.ExpectLess || TC.ExpectEq));
assert((V >= 0) == (TC.ExpectGreater || TC.ExpectEq));
assert((0 < V) == TC.ExpectGreater);
assert((0 > V) == TC.ExpectLess);
assert((0 <= V) == (TC.ExpectGreater || TC.ExpectEq));
assert((0 >= V) == (TC.ExpectLess || TC.ExpectEq));
}
#ifndef TEST_HAS_NO_SPACESHIP_OPERATOR
{
std::strong_ordering res = (Eq <=> 0);
((void)res);
res = (0 <=> Eq);
((void)res);
}
enum ExpectRes {
ER_Greater,
ER_Less,
ER_Equiv
};
struct {
std::strong_ordering Value;
ExpectRes Expect;
} SpaceshipTestCases[] = {
{std::strong_ordering::equivalent, ER_Equiv},
{std::strong_ordering::less, ER_Less},
{std::strong_ordering::greater, ER_Greater},
};
for (auto TC : SpaceshipTestCases)
{
std::strong_ordering Res = (0 <=> TC.Value);
switch (TC.Expect) {
case ER_Equiv:
assert(Res == 0);
assert(0 == Res);
break;
case ER_Less:
assert(Res < 0);
break;
case ER_Greater:
assert(Res > 0);
break;
}
}
#endif
return true;
}
int main() {
test_static_members();
test_signatures();
static_assert(test_conversion(), "conversion test failed");
static_assert(test_constexpr(), "constexpr test failed");
}
|
