1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <map>
10
11// class map
12
13// iterator erase(const_iterator first, const_iterator last);
14
15#include <map>
16#include <cassert>
17
18#include "test_macros.h"
19#include "min_allocator.h"
20
21int main(int, char**) {
22 {
23 typedef std::map<int, double> M;
24 typedef std::pair<int, double> P;
25 typedef M::iterator I;
26 P ar[] = {
27 P(1, 1.5),
28 P(2, 2.5),
29 P(3, 3.5),
30 P(4, 4.5),
31 P(5, 5.5),
32 P(6, 6.5),
33 P(7, 7.5),
34 P(8, 8.5),
35 };
36 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
37 assert(m.size() == 8);
38 I i = m.erase(first: m.cbegin(), last: m.cbegin());
39 assert(m.size() == 8);
40 assert(i == m.begin());
41 assert(m.begin()->first == 1);
42 assert(m.begin()->second == 1.5);
43 assert(std::next(m.begin())->first == 2);
44 assert(std::next(m.begin())->second == 2.5);
45 assert(std::next(m.begin(), 2)->first == 3);
46 assert(std::next(m.begin(), 2)->second == 3.5);
47 assert(std::next(m.begin(), 3)->first == 4);
48 assert(std::next(m.begin(), 3)->second == 4.5);
49 assert(std::next(m.begin(), 4)->first == 5);
50 assert(std::next(m.begin(), 4)->second == 5.5);
51 assert(std::next(m.begin(), 5)->first == 6);
52 assert(std::next(m.begin(), 5)->second == 6.5);
53 assert(std::next(m.begin(), 6)->first == 7);
54 assert(std::next(m.begin(), 6)->second == 7.5);
55 assert(std::next(m.begin(), 7)->first == 8);
56 assert(std::next(m.begin(), 7)->second == 8.5);
57
58 i = m.erase(first: m.cbegin(), last: std::next(x: m.cbegin(), n: 2));
59 assert(m.size() == 6);
60 assert(i == m.begin());
61 assert(std::next(m.begin(), 0)->first == 3);
62 assert(std::next(m.begin(), 0)->second == 3.5);
63 assert(std::next(m.begin(), 1)->first == 4);
64 assert(std::next(m.begin(), 1)->second == 4.5);
65 assert(std::next(m.begin(), 2)->first == 5);
66 assert(std::next(m.begin(), 2)->second == 5.5);
67 assert(std::next(m.begin(), 3)->first == 6);
68 assert(std::next(m.begin(), 3)->second == 6.5);
69 assert(std::next(m.begin(), 4)->first == 7);
70 assert(std::next(m.begin(), 4)->second == 7.5);
71 assert(std::next(m.begin(), 5)->first == 8);
72 assert(std::next(m.begin(), 5)->second == 8.5);
73
74 i = m.erase(first: std::next(x: m.cbegin(), n: 2), last: std::next(x: m.cbegin(), n: 6));
75 assert(m.size() == 2);
76 assert(i == std::next(m.begin(), 2));
77 assert(std::next(m.begin(), 0)->first == 3);
78 assert(std::next(m.begin(), 0)->second == 3.5);
79 assert(std::next(m.begin(), 1)->first == 4);
80 assert(std::next(m.begin(), 1)->second == 4.5);
81
82 i = m.erase(first: m.cbegin(), last: m.cend());
83 assert(m.size() == 0);
84 assert(i == m.begin());
85 assert(i == m.end());
86 }
87#if TEST_STD_VER >= 11
88 {
89 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
90 typedef std::pair<int, double> P;
91 typedef M::iterator I;
92 P ar[] = {
93 P(1, 1.5),
94 P(2, 2.5),
95 P(3, 3.5),
96 P(4, 4.5),
97 P(5, 5.5),
98 P(6, 6.5),
99 P(7, 7.5),
100 P(8, 8.5),
101 };
102 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
103 assert(m.size() == 8);
104 I i = m.erase(m.cbegin(), m.cbegin());
105 assert(m.size() == 8);
106 assert(i == m.begin());
107 assert(m.begin()->first == 1);
108 assert(m.begin()->second == 1.5);
109 assert(std::next(m.begin())->first == 2);
110 assert(std::next(m.begin())->second == 2.5);
111 assert(std::next(m.begin(), 2)->first == 3);
112 assert(std::next(m.begin(), 2)->second == 3.5);
113 assert(std::next(m.begin(), 3)->first == 4);
114 assert(std::next(m.begin(), 3)->second == 4.5);
115 assert(std::next(m.begin(), 4)->first == 5);
116 assert(std::next(m.begin(), 4)->second == 5.5);
117 assert(std::next(m.begin(), 5)->first == 6);
118 assert(std::next(m.begin(), 5)->second == 6.5);
119 assert(std::next(m.begin(), 6)->first == 7);
120 assert(std::next(m.begin(), 6)->second == 7.5);
121 assert(std::next(m.begin(), 7)->first == 8);
122 assert(std::next(m.begin(), 7)->second == 8.5);
123
124 i = m.erase(m.cbegin(), std::next(m.cbegin(), 2));
125 assert(m.size() == 6);
126 assert(i == m.begin());
127 assert(std::next(m.begin(), 0)->first == 3);
128 assert(std::next(m.begin(), 0)->second == 3.5);
129 assert(std::next(m.begin(), 1)->first == 4);
130 assert(std::next(m.begin(), 1)->second == 4.5);
131 assert(std::next(m.begin(), 2)->first == 5);
132 assert(std::next(m.begin(), 2)->second == 5.5);
133 assert(std::next(m.begin(), 3)->first == 6);
134 assert(std::next(m.begin(), 3)->second == 6.5);
135 assert(std::next(m.begin(), 4)->first == 7);
136 assert(std::next(m.begin(), 4)->second == 7.5);
137 assert(std::next(m.begin(), 5)->first == 8);
138 assert(std::next(m.begin(), 5)->second == 8.5);
139
140 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6));
141 assert(m.size() == 2);
142 assert(i == std::next(m.begin(), 2));
143 assert(std::next(m.begin(), 0)->first == 3);
144 assert(std::next(m.begin(), 0)->second == 3.5);
145 assert(std::next(m.begin(), 1)->first == 4);
146 assert(std::next(m.begin(), 1)->second == 4.5);
147
148 i = m.erase(m.cbegin(), m.cend());
149 assert(m.size() == 0);
150 assert(i == m.begin());
151 assert(i == m.end());
152 }
153#endif
154
155 return 0;
156}
157

source code of libcxx/test/std/containers/associative/map/map.modifiers/erase_iter_iter.pass.cpp