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
|
//===----------------------------------------------------------------------===//
//
// 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>
// iterator erase(const_iterator first, const_iterator last);
#include <compare>
#include <concepts>
#include <deque>
#include <flat_map>
#include <functional>
#include <utility>
#include <vector>
#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.h"
#include "min_allocator.h"
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>;
using P = std::pair<Key, Value>;
using I = M::iterator;
P ar[] = {
P(1, 1.5),
P(2, 2.5),
P(3, 3.5),
P(4, 4.5),
P(5, 5.5),
P(6, 6.5),
P(7, 7.5),
P(8, 8.5),
};
M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
assert(m.size() == 8);
std::same_as<I> decltype(auto) i1 = m.erase(m.cbegin(), m.cbegin());
assert(m.size() == 8);
assert(i1 == m.begin());
assert(m.begin()->first == 1);
assert(m.begin()->second == 1.5);
assert(std::next(m.begin())->first == 2);
assert(std::next(m.begin())->second == 2.5);
assert(std::next(m.begin(), 2)->first == 3);
assert(std::next(m.begin(), 2)->second == 3.5);
assert(std::next(m.begin(), 3)->first == 4);
assert(std::next(m.begin(), 3)->second == 4.5);
assert(std::next(m.begin(), 4)->first == 5);
assert(std::next(m.begin(), 4)->second == 5.5);
assert(std::next(m.begin(), 5)->first == 6);
assert(std::next(m.begin(), 5)->second == 6.5);
assert(std::next(m.begin(), 6)->first == 7);
assert(std::next(m.begin(), 6)->second == 7.5);
assert(std::next(m.begin(), 7)->first == 8);
assert(std::next(m.begin(), 7)->second == 8.5);
std::same_as<I> decltype(auto) i2 = m.erase(m.cbegin(), std::next(m.cbegin(), 2));
assert(m.size() == 6);
assert(i2 == m.begin());
assert(std::next(m.begin(), 0)->first == 3);
assert(std::next(m.begin(), 0)->second == 3.5);
assert(std::next(m.begin(), 1)->first == 4);
assert(std::next(m.begin(), 1)->second == 4.5);
assert(std::next(m.begin(), 2)->first == 5);
assert(std::next(m.begin(), 2)->second == 5.5);
assert(std::next(m.begin(), 3)->first == 6);
assert(std::next(m.begin(), 3)->second == 6.5);
assert(std::next(m.begin(), 4)->first == 7);
assert(std::next(m.begin(), 4)->second == 7.5);
assert(std::next(m.begin(), 5)->first == 8);
assert(std::next(m.begin(), 5)->second == 8.5);
std::same_as<I> decltype(auto) i3 = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6));
assert(m.size() == 2);
assert(i3 == std::next(m.begin(), 2));
assert(std::next(m.begin(), 0)->first == 3);
assert(std::next(m.begin(), 0)->second == 3.5);
assert(std::next(m.begin(), 1)->first == 4);
assert(std::next(m.begin(), 1)->second == 4.5);
std::same_as<I> decltype(auto) i4 = m.erase(m.cbegin(), m.cend());
assert(m.size() == 0);
assert(i4 == m.begin());
assert(i4 == m.end());
}
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>>>();
{
auto erase_function = [](auto& m, auto) { m.erase(m.begin(), m.begin() + 2); };
test_erase_exception_guarantee(erase_function);
}
return 0;
}
|
