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
|
//===----------------------------------------------------------------------===//
//
// 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>
// void replace(key_container_type&& key_cont, mapped_container_type&& mapped_cont);
#include <algorithm>
#include <deque>
#include <concepts>
#include <flat_map>
#include <functional>
#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.h"
#include "min_allocator.h"
template <class T, class... Args>
concept CanReplace = requires(T t, Args&&... args) { t.replace(std::forward<Args>(args)...); };
using Map = std::flat_map<int, int>;
static_assert(CanReplace<Map, std::vector<int>, std::vector<int>>);
static_assert(!CanReplace<Map, const std::vector<int>&, std::vector<int>>);
static_assert(!CanReplace<Map, std::vector<int>, const std::vector<int>&>);
static_assert(!CanReplace<Map, const std::vector<int>&, const std::vector<int>&>);
template <class KeyContainer, class ValueContainer>
void test() {
using Key = typename KeyContainer::value_type;
using Value = typename ValueContainer::value_type;
using M = std::flat_map<Key, Value, std::less<Key>, KeyContainer, ValueContainer>;
M m = M({1, 2, 3}, {4, 5, 6});
KeyContainer new_keys = {7, 8};
ValueContainer new_values = {9, 10};
auto expected_keys = new_keys;
auto expected_values = new_values;
m.replace(std::move(new_keys), std::move(new_values));
assert(m.size() == 2);
assert(std::ranges::equal(m.keys(), expected_keys));
assert(std::ranges::equal(m.values(), expected_values));
}
int main(int, char**) {
test<std::vector<int>, std::vector<double>>();
test<std::deque<int>, std::vector<double>>();
test<MinSequenceContainer<int>, MinSequenceContainer<double>>();
test<std::vector<int, min_allocator<int>>, std::vector<double, min_allocator<double>>>();
{
#ifndef TEST_HAS_NO_EXCEPTIONS
using KeyContainer = std::vector<int>;
using ValueContainer = ThrowOnMoveContainer<int>;
using M = std::flat_map<int, int, std::ranges::less, KeyContainer, ValueContainer>;
M m;
m.emplace(1, 1);
m.emplace(2, 2);
try {
KeyContainer new_keys{3, 4};
ValueContainer new_values{5, 6};
m.replace(std::move(new_keys), std::move(new_values));
assert(false);
} catch (int) {
check_invariant(m);
// In libc++, we clear the map
LIBCPP_ASSERT(m.size() == 0);
}
#endif
}
return 0;
}
|
