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
|
//===----------------------------------------------------------------------===//
//
// 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>
// iterator erase(iterator position);
// iterator erase(const_iterator position);
#include <compare>
#include <concepts>
#include <deque>
#include <flat_set>
#include <functional>
#include <utility>
#include <vector>
#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.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 I = M::iterator;
int ar[] = {
1,
2,
3,
4,
5,
6,
7,
8,
};
M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
auto make = [](std::initializer_list<int> il) {
M m2;
for (int i : il) {
m2.emplace(i);
}
return m2;
};
assert(m.size() == 8);
assert(m == make({1, 2, 3, 4, 5, 6, 7, 8}));
std::same_as<I> decltype(auto) i1 = m.erase(std::next(m.cbegin(), 3));
assert(m.size() == 7);
assert(i1 == std::next(m.begin(), 3));
assert(m == make({1, 2, 3, 5, 6, 7, 8}));
std::same_as<I> decltype(auto) i2 = m.erase(std::next(m.begin(), 0));
assert(m.size() == 6);
assert(i2 == m.begin());
assert(m == make({2, 3, 5, 6, 7, 8}));
std::same_as<I> decltype(auto) i3 = m.erase(std::next(m.cbegin(), 5));
assert(m.size() == 5);
assert(i3 == m.end());
assert(m == make({2, 3, 5, 6, 7}));
std::same_as<I> decltype(auto) i4 = m.erase(std::next(m.begin(), 1));
assert(m.size() == 4);
assert(i4 == std::next(m.begin()));
assert(m == make({2, 5, 6, 7}));
std::same_as<I> decltype(auto) i5 = m.erase(std::next(m.cbegin(), 2));
assert(m.size() == 3);
assert(i5 == std::next(m.begin(), 2));
assert(m == make({2, 5, 7}));
std::same_as<I> decltype(auto) i6 = m.erase(std::next(m.begin(), 2));
assert(m.size() == 2);
assert(i6 == std::next(m.begin(), 2));
assert(m == make({2, 5}));
std::same_as<I> decltype(auto) i7 = m.erase(std::next(m.cbegin(), 0));
assert(m.size() == 1);
assert(i7 == std::next(m.begin(), 0));
assert(m == make({5}));
std::same_as<I> decltype(auto) i8 = m.erase(m.begin());
assert(m.size() == 0);
assert(i8 == m.begin());
assert(i8 == m.end());
}
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>>>();
return true;
}
void test_exception() {
auto erase_function = [](auto& m, auto) { m.erase(m.begin() + 2); };
test_erase_exception_guarantee(erase_function);
}
int main(int, char**) {
test();
test_exception();
#if TEST_STD_VER >= 26
static_assert(test());
#endif
return 0;
}
|
