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
|
//===----------------------------------------------------------------------===//
//
// 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: c++03, c++11, c++14, c++17, c++20
// <flat_set>
// friend bool operator==(const flat_multiset& x, const flat_multiset& y);
// friend synth-three-way-result<value_type>
// operator<=>(const flat_multiset& x, const flat_multiset& y);
#include <algorithm>
#include <cassert>
#include <deque>
#include <compare>
#include <flat_set>
#include <functional>
#include <limits>
#include <vector>
#include "MinSequenceContainer.h"
#include "test_macros.h"
#include "min_allocator.h"
#include "test_allocator.h"
#include "test_comparisons.h"
#include "test_container_comparisons.h"
template <class KeyContainer>
void test_one() {
using Key = typename KeyContainer::value_type;
{
using C = std::flat_multiset<Key>;
C s1, s2;
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisons(C{1, 1, 2}, C{1, 1, 3}, false, true));
assert(testComparisons(C{1, 1}, C{1, 1}, true, false));
assert(testComparisons(C{1, 10}, C{2, 2}, false, true));
assert(testComparisons(C{}, C{1}, false, true));
assert(testComparisons(C{2}, C{1, 1, 1, 1, 1}, false, false));
}
{
// Comparisons use value_type's native operators, not the comparator
using C = std::flat_multiset<Key, std::greater<Key>>;
C s1 = {1, 1};
C s2 = {2, 2};
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisons(s1, s2, false, true));
s2 = {1, 1};
assert(testComparisons(s1, s2, true, false));
s2 = {1, 2};
assert(testComparisons(s1, s2, false, true));
s1 = {0, 1, 2};
assert(testComparisons(s1, s2, false, false));
s2 = {0, 1, 3};
assert(testComparisons(s1, s2, false, true));
}
}
void test() {
test_one<std::vector<int>>();
test_one<std::deque<int>>();
test_one<MinSequenceContainer<int>>();
test_one<std::vector<int, min_allocator<int>>>();
{
using C = std::flat_multiset<double>;
C s1 = {1};
C s2 = C(std::sorted_equivalent, {std::numeric_limits<double>::quiet_NaN()});
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisonsComplete(s1, s2, false, false, false));
}
{
// Comparisons use value_type's native operators, not the comparator
struct StrongComp {
bool operator()(double a, double b) const { return std::strong_order(a, b) < 0; }
};
using C = std::flat_multiset<double, StrongComp>;
C s1 = {1};
C s2 = {std::numeric_limits<double>::quiet_NaN(), std::numeric_limits<double>::quiet_NaN()};
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisonsComplete(s1, s2, false, false, false));
s1 = {1, std::numeric_limits<double>::quiet_NaN(), 1};
s2 = {1, std::numeric_limits<double>::quiet_NaN(), 1};
assert(std::lexicographical_compare_three_way(s1.begin(), s1.end(), s2.begin(), s2.end(), std::strong_order) ==
std::strong_ordering::equal);
assert(s1 != s2);
assert((s1 <=> s2) == std::partial_ordering::unordered);
}
}
int main(int, char**) {
test();
return 0;
}
|
