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
|
//===----------------------------------------------------------------------===//
//
// 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_map>
// class flat_multimap
// friend bool operator==(const flat_multimap& x, const flat_multimap& y);
// friend synth-three-way-result<value_type>
// operator<=>(const flat_multimap& x, const flat_multimap& y);
#include <algorithm>
#include <cassert>
#include <deque>
#include <compare>
#include <flat_map>
#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, class ValueContainer>
void test() {
using Key = typename KeyContainer::value_type;
using Value = typename ValueContainer::value_type;
{
using C = std::flat_multimap<Key, Value>;
C s1 = {{1, 1}};
C s2 = {{2, 0}}; // {{1,1}} versus {{2,0}}
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisons(s1, s2, false, true));
s2 = {{1, 1}}; // {{1,1}} versus {{1,1}}
assert(testComparisons(s1, s2, true, false));
s2 = {{1, 1}, {2, 0}}; // {{1,1}} versus {{1,1},{2,0}}
assert(testComparisons(s1, s2, false, true));
s1 = {{0, 0}, {1, 1}, {2, 2}}; // {{0,0},{1,1},{2,2}} versus {{1,1},{2,0}}
assert(testComparisons(s1, s2, false, true));
s2 = {{0, 0}, {1, 1}, {2, 3}}; // {{0,0},{1,1},{2,2}} versus {{0,0},{1,1},{2,3}}
assert(testComparisons(s1, s2, false, true));
s1 = {{1, 1}, {1, 1}};
s2 = {{1, 1}, {1, 1}};
assert(testComparisons(s1, s2, true, false));
s2 = {{1, 1}, {1, 1}, {2, 2}};
assert(testComparisons(s1, s2, false, true));
s2 = {{1, 1}, {2, 2}, {2, 2}};
assert(testComparisons(s1, s2, false, true));
s2 = {{0, 0}, {1, 1}, {1, 1}};
assert(testComparisons(s1, s2, false, false));
}
{
// Comparisons use value_type's native operators, not the comparator
using C = std::flat_multimap<Key, Value, std::greater<Key>>;
C s1 = {{1, 1}};
C s2 = {{2, 0}}; // {{1,1}} versus {{2,0}}
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisons(s1, s2, false, true));
s2 = {{1, 1}}; // {{1,1}} versus {{1,1}}
assert(testComparisons(s1, s2, true, false));
s2 = {{1, 1}, {2, 0}}; // {{1,1}} versus {{2,0},{1,1}}
assert(testComparisons(s1, s2, false, true));
s1 = {{0, 0}, {1, 1}, {2, 2}}; // {{2,2},{1,1},{0,0}} versus {2,0},{1,1}}
assert(testComparisons(s1, s2, false, false));
s2 = {{0, 0}, {1, 1}, {2, 3}}; // {{2,2},{1,1},{0,0}} versus {{2,3},{1,1},{0,0}}
assert(testComparisons(s1, s2, false, true));
}
}
int main(int, char**) {
test<std::vector<int>, std::vector<int>>();
test<std::deque<int>, std::deque<int>>();
test<MinSequenceContainer<int>, MinSequenceContainer<int>>();
test<std::vector<int, min_allocator<int>>, std::vector<int, min_allocator<int>>>();
test<std::vector<int, min_allocator<int>>, std::vector<int, min_allocator<int>>>();
{
using C = std::flat_multimap<double, int>;
C s1 = {{1, 1}};
C s2 = C(std::sorted_equivalent, {{std::numeric_limits<double>::quiet_NaN(), 2}});
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisonsComplete(s1, s2, false, false, false));
}
{
using C = std::flat_multimap<int, double>;
C s1 = {{1, 1}};
C s2 = C(std::sorted_equivalent, {{2, std::numeric_limits<double>::quiet_NaN()}});
ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
AssertComparisonsReturnBool<C>();
assert(testComparisonsComplete(s1, s2, false, true, false));
s2 = C(std::sorted_equivalent, {{1, std::numeric_limits<double>::quiet_NaN()}});
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_multimap<double, double, StrongComp>;
C s1 = {{1, 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, 1}, {std::numeric_limits<double>::quiet_NaN(), 1}}};
s2 = {{{std::numeric_limits<double>::quiet_NaN(), 1}, {1, 1}}};
assert(std::lexicographical_compare_three_way(
s1.keys().begin(), s1.keys().end(), s2.keys().begin(), s2.keys().end(), std::strong_order) ==
std::strong_ordering::equal);
assert(s1 != s2);
assert((s1 <=> s2) == std::partial_ordering::unordered);
}
return 0;
}
|
