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
|
//===----------------------------------------------------------------------===//
//
// 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>
// template <class... Args>
// pair<iterator, bool> emplace(Args&&... args);
#include <flat_set>
#include <cassert>
#include <deque>
#include <tuple>
#include <functional>
#include <vector>
#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.h"
#include "../../../Emplaceable.h"
#include "DefaultOnly.h"
#include "min_allocator.h"
template <class KeyContainer>
constexpr void test_one() {
using Key = typename KeyContainer::value_type;
using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
using R = std::pair<typename M::iterator, bool>;
{
// was empty
M m;
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(r.second);
assert(r.first == m.begin());
assert(m.size() == 1);
assert(*r.first == 2);
}
{
// key does not exist and inserted at the begin
M m = {3, 5, 6, 7};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(r.second);
assert(r.first == m.begin());
assert(m.size() == 5);
assert(*r.first == 2);
}
{
// key does not exist and inserted in the middle
M m = {0, 1, 3, 4};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(r.second);
assert(r.first == m.begin() + 2);
assert(m.size() == 5);
assert(*r.first == 2);
}
{
// key does not exist and inserted at the end
M m = {0, 1};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(r.second);
assert(r.first == m.begin() + 2);
assert(m.size() == 3);
assert(*r.first == 2);
}
{
// key already exists and original at the begin
M m = {2, 3, 5, 6};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(!r.second);
assert(r.first == m.begin());
assert(m.size() == 4);
assert(*r.first == 2);
}
{
// key already exists and original in the middle
M m = {0, 2, 3, 4};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(!r.second);
assert(r.first == m.begin() + 1);
assert(m.size() == 4);
assert(*r.first == 2);
}
{
// key already exists and original at the end
M m = {0, 1, 2};
std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
assert(!r.second);
assert(r.first == m.begin() + 2);
assert(m.size() == 3);
assert(*r.first == 2);
}
}
template <class KeyContainer>
constexpr void test_emplaceable() {
using M = std::flat_set<Emplaceable, std::less<Emplaceable>, KeyContainer>;
using R = std::pair<typename M::iterator, bool>;
M m;
ASSERT_SAME_TYPE(decltype(m.emplace()), R);
R r = m.emplace(2, 0.0);
assert(r.second);
assert(r.first == m.begin());
assert(m.size() == 1);
assert(*m.begin() == Emplaceable(2, 0.0));
r = m.emplace(1, 3.5);
assert(r.second);
assert(r.first == m.begin());
assert(m.size() == 2);
assert(*m.begin() == Emplaceable(1, 3.5));
r = m.emplace(1, 3.5);
assert(!r.second);
assert(r.first == m.begin());
assert(m.size() == 2);
assert(*m.begin() == Emplaceable(1, 3.5));
}
constexpr bool test() {
test_one<std::vector<int>>();
#ifndef __cpp_lib_constexpr_deque
if (!TEST_IS_CONSTANT_EVALUATED)
#endif
test_one<std::deque<int>>();
test_one<MinSequenceContainer<int>>();
test_one<std::vector<int, min_allocator<int>>>();
test_emplaceable<std::vector<Emplaceable>>();
#ifndef __cpp_lib_constexpr_deque
if (!TEST_IS_CONSTANT_EVALUATED)
#endif
test_emplaceable<std::deque<Emplaceable>>();
test_emplaceable<MinSequenceContainer<Emplaceable>>();
test_emplaceable<std::vector<Emplaceable, min_allocator<Emplaceable>>>();
return true;
}
void test_exception() {
auto emplace_func = [](auto& m, auto key_arg) { m.emplace(key_arg); };
test_emplace_exception_guarantee(emplace_func);
}
int main(int, char**) {
test();
test_exception();
#if TEST_STD_VER >= 26
static_assert(test());
#endif
return 0;
}
|
