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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
|
//===----------------------------------------------------------------------===//
//
// 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
// UNSUPPORTED: availability-pmr-missing
// <flat_map>
// Test various constructors with pmr
#include <algorithm>
#include <cassert>
#include <deque>
#include <flat_map>
#include <functional>
#include <memory_resource>
#include <ranges>
#include <vector>
#include <string>
#include "test_iterators.h"
#include "test_macros.h"
#include "test_allocator.h"
#include "../../../test_compare.h"
int main(int, char**) {
{
// flat_multimap(const Allocator& a);
using M = std::flat_multimap<int, short, std::less<int>, std::pmr::vector<int>, std::pmr::vector<short>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::polymorphic_allocator<int> pa = &mr;
auto m1 = M(pa);
assert(m1.empty());
assert(m1.keys().get_allocator() == pa);
assert(m1.values().get_allocator() == pa);
auto m2 = M(&mr);
assert(m2.empty());
assert(m2.keys().get_allocator() == pa);
assert(m2.values().get_allocator() == pa);
}
{
// flat_multimap(const key_compare& comp, const Alloc& a);
using M = std::flat_multimap<int, int, std::function<bool(int, int)>, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
vm.emplace_back(std::greater<int>());
assert(vm[0] == M{});
assert(vm[0].key_comp()(2, 1) == true);
assert(vm[0].value_comp()({2, 0}, {1, 0}) == true);
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(const key_container_type& key_cont, const mapped_container_type& mapped_cont,
// const Allocator& a);
using M = std::flat_multimap<int, int, std::less<int>, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::pmr::vector<int> ks = {1, 1, 1, 2, 2, 3, 2, 3, 3};
std::pmr::vector<int> vs = {1, 1, 1, 2, 2, 3, 2, 3, 3};
assert(ks.get_allocator().resource() != &mr);
assert(vs.get_allocator().resource() != &mr);
vm.emplace_back(ks, vs);
assert(ks.size() == 9); // ks' value is unchanged, since it was an lvalue above
assert(vs.size() == 9); // vs' value is unchanged, since it was an lvalue above
assert((vm[0] == M{{1, 1}, {1, 1}, {1, 1}, {2, 2}, {2, 2}, {2, 2}, {3, 3}, {3, 3}, {3, 3}}));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(const flat_multimap&, const allocator_type&);
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr1;
std::pmr::monotonic_buffer_resource mr2;
M mo = M({1, 2, 1}, {2, 2, 1}, C(5), &mr1);
M m = {mo, &mr2}; // also test the implicitness of this constructor
assert(m.key_comp() == C(5));
assert((m.keys() == std::pmr::vector<int>{1, 1, 2}));
assert((m.values() == std::pmr::vector<int>{2, 1, 2}));
assert(m.keys().get_allocator().resource() == &mr2);
assert(m.values().get_allocator().resource() == &mr2);
// mo is unchanged
assert(mo.key_comp() == C(5));
assert((mo.keys() == std::pmr::vector<int>{1, 1, 2}));
assert((mo.values() == std::pmr::vector<int>{2, 1, 2}));
assert(mo.keys().get_allocator().resource() == &mr1);
assert(mo.values().get_allocator().resource() == &mr1);
}
{
// flat_multimap(const flat_multimap&, const allocator_type&);
using M = std::flat_multimap<int, int, std::less<>, std::pmr::vector<int>, std::pmr::deque<int>>;
std::pmr::vector<M> vs;
M m = {{1, 2}, {1, 2}, {3, 1}};
vs.push_back(m);
assert(vs[0] == m);
}
{
// flat_multimap& operator=(const flat_multimap& m);
// pmr allocator is not propagated
using M = std::flat_multimap<int, int, std::less<>, std::pmr::deque<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr1;
std::pmr::monotonic_buffer_resource mr2;
M mo = M({{1, 1}, {1, 2}, {3, 3}}, &mr1);
M m = M({{4, 4}, {4, 5}}, &mr2);
m = mo;
assert((m == M{{1, 1}, {1, 2}, {3, 3}}));
assert(m.keys().get_allocator().resource() == &mr2);
assert(m.values().get_allocator().resource() == &mr2);
// mo is unchanged
assert((mo == M{{1, 1}, {1, 2}, {3, 3}}));
assert(mo.keys().get_allocator().resource() == &mr1);
}
{
// flat_multimap(const flat_multimap& m);
using C = test_less<int>;
std::pmr::monotonic_buffer_resource mr;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
auto mo = M({{1, 1}, {1, 2}, {3, 3}}, C(5), &mr);
auto m = mo;
assert(m.key_comp() == C(5));
assert((m == M{{1, 1}, {1, 2}, {3, 3}}));
auto [ks, vs] = std::move(m).extract();
assert(ks.get_allocator().resource() == std::pmr::get_default_resource());
assert(vs.get_allocator().resource() == std::pmr::get_default_resource());
// mo is unchanged
assert(mo.key_comp() == C(5));
assert((mo == M{{1, 1}, {1, 2}, {3, 3}}));
auto [kso, vso] = std::move(mo).extract();
assert(kso.get_allocator().resource() == &mr);
assert(vso.get_allocator().resource() == &mr);
}
{
// flat_multimap(initializer_list<value_type> il, const Alloc& a);
using M = std::flat_multimap<int, int, std::less<int>, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::initializer_list<M::value_type> il = {{3, 3}, {1, 1}, {4, 4}, {1, 1}, {5, 5}};
vm.emplace_back(il);
assert((vm[0] == M{{1, 1}, {1, 1}, {3, 3}, {4, 4}, {5, 5}}));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(initializer_list<value_type> il, const key_compare& comp, const Alloc& a);
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::deque<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::initializer_list<M::value_type> il = {{3, 3}, {1, 1}, {4, 4}, {1, 1}, {5, 5}};
vm.emplace_back(il, C(5));
assert((vm[0] == M{{1, 1}, {1, 1}, {3, 3}, {4, 4}, {5, 5}}));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
assert(vm[0].key_comp() == C(5));
}
{
// flat_multimap(InputIterator first, InputIterator last, const Allocator& a);
using P = std::pair<int, short>;
P ar[] = {{1, 1}, {1, 2}, {1, 3}, {2, 4}, {2, 5}, {3, 6}, {2, 7}, {3, 8}, {3, 9}};
P expected[] = {{1, 1}, {1, 2}, {1, 3}, {2, 4}, {2, 5}, {2, 7}, {3, 6}, {3, 8}, {3, 9}};
{
// cpp17 iterator
using M = std::flat_multimap<int, short, std::less<int>, std::pmr::vector<int>, std::pmr::vector<short>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
vm.emplace_back(cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<const P*>(ar + 9));
assert(std::ranges::equal(vm[0].keys(), expected | std::views::elements<0>));
LIBCPP_ASSERT(std::ranges::equal(vm[0], expected));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
using M = std::flat_multimap<int, short, std::less<int>, std::pmr::vector<int>, std::pmr::vector<short>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
vm.emplace_back(ar, ar);
assert(vm[0].empty());
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
}
{
// flat_multimap(flat_multimap&&, const allocator_type&);
std::pair<int, int> expected[] = {{1, 1}, {1, 1}, {2, 2}, {3, 1}};
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::deque<int>>;
std::pmr::monotonic_buffer_resource mr1;
std::pmr::monotonic_buffer_resource mr2;
M mo = M({{1, 1}, {3, 1}, {1, 1}, {2, 2}}, C(5), &mr1);
M m = {std::move(mo), &mr2}; // also test the implicitness of this constructor
assert(m.key_comp() == C(5));
assert(m.size() == 4);
assert(m.keys().get_allocator().resource() == &mr2);
assert(m.values().get_allocator().resource() == &mr2);
assert(std::ranges::equal(m, expected));
// The original flat_multimap is moved-from.
assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
assert(mo.key_comp() == C(5));
assert(mo.keys().get_allocator().resource() == &mr1);
assert(mo.values().get_allocator().resource() == &mr1);
}
{
// flat_multimap(flat_multimap&&, const allocator_type&);
using M = std::flat_multimap<int, int, std::less<>, std::pmr::deque<int>, std::pmr::vector<int>>;
std::pmr::vector<M> vs;
M m = {{1, 1}, {3, 1}, {1, 1}, {2, 2}};
vs.push_back(std::move(m));
assert((vs[0].keys() == std::pmr::deque<int>{1, 1, 2, 3}));
assert((vs[0].values() == std::pmr::vector<int>{1, 1, 2, 1}));
}
{
// flat_multimap& operator=(flat_multimap&&);
using M = std::
flat_multimap<std::pmr::string, int, std::less<>, std::pmr::vector<std::pmr::string>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr1;
std::pmr::monotonic_buffer_resource mr2;
M mo = M({{"short", 1},
{"very long string that definitely won't fit in the SSO buffer and therefore becomes empty on move", 2}},
&mr1);
M m = M({{"don't care", 3}}, &mr2);
m = std::move(mo);
assert(m.size() == 2);
assert(std::is_sorted(m.begin(), m.end(), m.value_comp()));
assert(m.begin()->first.get_allocator().resource() == &mr2);
assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
mo.insert({"foo", 1});
assert(mo.begin()->first.get_allocator().resource() == &mr1);
}
{
// flat_multimap(from_range_t, R&&, const Alloc&);
using P = std::pair<int, short>;
P ar[] = {{1, 1}, {1, 2}, {1, 3}, {2, 4}, {2, 5}, {3, 6}, {2, 7}, {3, 8}, {3, 9}};
P expected[] = {{1, 1}, {1, 2}, {1, 3}, {2, 4}, {2, 5}, {2, 7}, {3, 6}, {3, 8}, {3, 9}};
{
// input_range
using M = std::flat_multimap<int, short, std::less<int>, std::pmr::vector<int>, std::pmr::vector<short>>;
using Iter = cpp20_input_iterator<const P*>;
using Sent = sentinel_wrapper<Iter>;
using R = std::ranges::subrange<Iter, Sent>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
vm.emplace_back(std::from_range, R(Iter(ar), Sent(Iter(ar + 9))));
assert(std::ranges::equal(vm[0].keys(), expected | std::views::elements<0>));
LIBCPP_ASSERT(std::ranges::equal(vm[0], expected));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
using M = std::flat_multimap<int, short, std::less<int>, std::pmr::vector<int>, std::pmr::vector<short>>;
using R = std::ranges::subrange<const P*>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
vm.emplace_back(std::from_range, R(ar, ar));
assert(vm[0].empty());
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
}
{
// flat_multimap(sorted_equivalent_t, const key_container_type& key_cont,
// const mapped_container_type& mapped_cont, const Alloc& a);
using M = std::flat_multimap<int, int, std::less<int>, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::pmr::vector<int> ks = {1, 1, 4, 10};
std::pmr::vector<int> vs = {4, 3, 2, 1};
vm.emplace_back(std::sorted_equivalent, ks, vs);
assert(!ks.empty()); // it was an lvalue above
assert(!vs.empty()); // it was an lvalue above
assert((vm[0] == M{{1, 4}, {1, 3}, {4, 2}, {10, 1}}));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(sorted_equivalent_t, const key_container_type& key_cont,
// const mapped_container_type& mapped_cont, const Alloc& a);
using M = std::flat_multimap<int, int, std::less<int>, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::pmr::vector<int> ks({1, 1, 4, 10}, &mr);
std::pmr::vector<int> vs({4, 3, 2, 1}, &mr);
vm.emplace_back(std::sorted_equivalent, ks, vs);
assert((vm[0] == M{{1, 4}, {1, 3}, {4, 2}, {10, 1}}));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(sorted_equivalent_t, initializer_list<value_type> il, const Alloc& a);
// cpp_17
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
using P = std::pair<int, int>;
P ar[] = {{1, 1}, {1, 2}, {1, 4}, {5, 5}};
vm.emplace_back(
std::sorted_equivalent, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<const P*>(ar + 4), C(3));
assert((vm[0] == M{{1, 1}, {1, 2}, {1, 4}, {5, 5}}));
assert(vm[0].key_comp() == C(3));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(sorted_equivalent_t, initializer_list<value_type> il, const Alloc& a);
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::pair<int, int> ar[1] = {{42, 42}};
vm.emplace_back(std::sorted_equivalent, ar, ar, C(4));
assert(vm[0] == M{});
assert(vm[0].key_comp() == C(4));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(InputIterator first, InputIterator last, const Alloc& a);
// cpp_17
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
using P = std::pair<int, int>;
P ar[] = {{1, 1}, {1, 2}, {1, 4}, {5, 5}};
vm.emplace_back(
std::sorted_equivalent, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<const P*>(ar + 4), C(3));
assert((vm[0] == M{{1, 1}, {1, 2}, {1, 4}, {5, 5}}));
assert(vm[0].key_comp() == C(3));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
{
// flat_multimap(InputIterator first, InputIterator last, const Alloc& a);
using C = test_less<int>;
using M = std::flat_multimap<int, int, C, std::pmr::vector<int>, std::pmr::vector<int>>;
std::pmr::monotonic_buffer_resource mr;
std::pmr::vector<M> vm(&mr);
std::pair<int, int> ar[1] = {{42, 42}};
vm.emplace_back(std::sorted_equivalent, ar, ar, C(4));
assert(vm[0] == M{});
assert(vm[0].key_comp() == C(4));
assert(vm[0].keys().get_allocator().resource() == &mr);
assert(vm[0].values().get_allocator().resource() == &mr);
}
return 0;
}
|
