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
|
//===----------------------------------------------------------------------===//
//
// 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>
// flat_multiset& operator=(const flat_multiset& m);
#include <algorithm>
#include <flat_set>
#include <functional>
#include <vector>
#include "operator_hijacker.h"
#include "test_macros.h"
#include "../../../test_compare.h"
#include "test_allocator.h"
void test() {
{
// test_allocator is not propagated
using C = test_less<int>;
std::vector<int, test_allocator<int>> ks({1, 3, 5, 5}, test_allocator<int>(6));
using M = std::flat_multiset<int, C, decltype(ks)>;
auto mo = M(ks, C(5));
auto m = M({{3, 4, 5, 4}}, C(3), test_allocator<int>(2));
m = mo;
assert(m.key_comp() == C(5));
assert(std::ranges::equal(m, ks));
auto keys = std::move(m).extract();
assert(keys.get_allocator() == test_allocator<int>(2));
// mo is unchanged
assert(mo.key_comp() == C(5));
assert(std::ranges::equal(mo, ks));
auto keys2 = std::move(mo).extract();
assert(keys2.get_allocator() == test_allocator<int>(6));
}
{
// other_allocator is propagated
using C = test_less<int>;
using Ks = std::vector<int, other_allocator<int>>;
auto ks = Ks({1, 3, 5, 3}, other_allocator<int>(6));
const int expected[] = {1, 3, 3, 5};
using M = std::flat_multiset<int, C, Ks>;
auto mo = M(Ks(ks, other_allocator<int>(6)), C(5));
auto m = M({3, 4, 5}, C(3), other_allocator<int>(2));
m = mo;
assert(m.key_comp() == C(5));
assert(std::ranges::equal(m, expected));
auto keys = std::move(m).extract();
assert(keys.get_allocator() == other_allocator<int>(6));
// mo is unchanged
assert(mo.key_comp() == C(5));
assert(std::ranges::equal(mo, expected));
auto keys2 = std::move(mo).extract();
assert(keys2.get_allocator() == other_allocator<int>(6));
}
{
// comparator is copied and invariant is preserved
using M = std::flat_multiset<int, std::function<bool(int, int)>>;
M mo = M({1, 2}, std::less<int>());
M m = M({1, 2}, std::greater<int>());
assert(m.key_comp()(2, 1) == true);
assert(m != mo);
m = mo;
assert(m.key_comp()(2, 1) == false);
assert(m == mo);
}
{
// self-assignment
using M = std::flat_multiset<int>;
M m = {{1, 2}};
m = std::as_const(m);
assert((m == M{{1, 2}}));
}
{
// was empty
using M = std::flat_multiset<int>;
M m;
assert(m.size() == 0);
m = {3, 1, 2, 2, 3, 4, 3, 5, 6, 5};
int expected[] = {1, 2, 2, 3, 3, 3, 4, 5, 5, 6};
assert(std::ranges::equal(m, expected));
}
{
// Validate whether the container can be copy-assigned (move-assigned, swapped)
// with an ADL-hijacking operator&
std::flat_multiset<operator_hijacker> so;
std::flat_multiset<operator_hijacker> s;
s = so;
s = std::move(so);
swap(s, so);
}
}
int main(int, char**) {
test();
return 0;
}
|
