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
|
//===----------------------------------------------------------------------===//
//
// 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>
// iterator emplace_hint(const_iterator position, Args&&... args);
#include <flat_set>
#include <cassert>
#include <deque>
#include <functional>
#include <vector>
#include "MinSequenceContainer.h"
#include "test_macros.h"
#include "../../../Emplaceable.h"
#include "DefaultOnly.h"
#include "min_allocator.h"
#include "../helpers.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 = M::iterator;
{
// was empty
M m;
std::same_as<R> decltype(auto) r = m.emplace_hint(m.end(), typename M::value_type(2));
assert(r == m.begin());
assert(m.size() == 1);
assert(*r == 2);
}
{
// hints correct at the begin
M m = {3, 4};
auto hint = m.begin();
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin());
assert(m.size() == 3);
assert(*r == 2);
}
{
// hints correct in the middle
M m = {0, 1, 3, 4};
auto hint = m.begin() + 2;
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 2);
assert(m.size() == 5);
assert(*r == 2);
}
{
// hints correct at the end
M m = {0, 1};
auto hint = m.end();
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 2);
assert(m.size() == 3);
assert(*r == 2);
}
{
// hints correct but key already exists
M m = {0, 1, 2, 3, 4};
auto hint = m.begin() + 2;
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 2);
assert(m.size() == 5);
assert(*r == 2);
}
{
// hints incorrectly at the begin
M m = {1, 4};
auto hint = m.begin();
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 1);
assert(m.size() == 3);
assert(*r == 2);
}
{
// hints incorrectly in the middle
M m = {0, 1, 3, 4};
auto hint = m.begin() + 1;
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 2);
assert(m.size() == 5);
assert(*r == 2);
}
{
// hints incorrectly at the end
M m = {0, 3};
auto hint = m.end();
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 1);
assert(m.size() == 3);
assert(*r == 2);
}
{
// hints incorrect and key already exists
M m = {0, 1, 2, 3, 4};
auto hint = m.begin();
std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
assert(r == m.begin() + 2);
assert(m.size() == 5);
assert(*r == 2);
}
}
template <class KeyContainer>
constexpr void test_emplaceable() {
using M = std::flat_set<Emplaceable, std::less<Emplaceable>, KeyContainer>;
using R = M::iterator;
M m;
ASSERT_SAME_TYPE(decltype(m.emplace_hint(m.cbegin())), R);
R r = m.emplace_hint(m.end(), 2, 0.0);
assert(r == m.begin());
assert(m.size() == 1);
assert(*m.begin() == Emplaceable(2, 0.0));
r = m.emplace_hint(m.end(), 1, 3.5);
assert(r == m.begin());
assert(m.size() == 2);
assert(*m.begin() == Emplaceable(1, 3.5));
r = m.emplace_hint(m.end(), 1, 3.5);
assert(r == 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_hint(m.begin(), 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;
}
|
