File: erase_iter.pass.cpp

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (303 lines) | stat: -rw-r--r-- 11,901 bytes parent folder | download | duplicates (11)
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// <map>

// class multimap

// iterator erase(const_iterator position);

#include <map>
#include <cassert>

#include "test_macros.h"
#include "min_allocator.h"

struct TemplateConstructor
{
    template<typename T>
    TemplateConstructor (const T&) {}
};

bool operator<(const TemplateConstructor&, const TemplateConstructor&) { return false; }

int main(int, char**)
{
    {
        typedef std::multimap<int, double> M;
        typedef std::pair<int, double> P;
        typedef M::iterator I;
        P ar[] =
        {
            P(1, 1),
            P(1, 1.5),
            P(1, 2),
            P(2, 1),
            P(2, 1.5),
            P(2, 2),
            P(3, 1),
            P(3, 1.5),
            P(3, 2),
        };
        M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
        assert(m.size() == 9);
        I i = m.erase(std::next(m.cbegin(), 3));
        assert(m.size() == 8);
        assert(i == std::next(m.begin(), 3));
        assert(m.begin()->first == 1);
        assert(m.begin()->second == 1);
        assert(std::next(m.begin())->first == 1);
        assert(std::next(m.begin())->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 1);
        assert(std::next(m.begin(), 2)->second == 2);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 1.5);
        assert(std::next(m.begin(), 4)->first == 2);
        assert(std::next(m.begin(), 4)->second == 2);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 1);
        assert(std::next(m.begin(), 6)->first == 3);
        assert(std::next(m.begin(), 6)->second == 1.5);
        assert(std::next(m.begin(), 7)->first == 3);
        assert(std::next(m.begin(), 7)->second == 2);

        i = m.erase(std::next(m.cbegin(), 0));
        assert(m.size() == 7);
        assert(i == m.begin());
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 1);
        assert(std::next(m.begin(), 1)->second == 2);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 1.5);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 2);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 1);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 1.5);
        assert(std::next(m.begin(), 6)->first == 3);
        assert(std::next(m.begin(), 6)->second == 2);

        i = m.erase(std::next(m.cbegin(), 5));
        assert(m.size() == 6);
        assert(i == std::prev(m.end()));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 1);
        assert(std::next(m.begin(), 1)->second == 2);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 1.5);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 2);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 1);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 2);

        i = m.erase(std::next(m.cbegin(), 1));
        assert(m.size() == 5);
        assert(i == std::next(m.begin()));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 2);
        assert(std::next(m.begin(), 3)->first == 3);
        assert(std::next(m.begin(), 3)->second == 1);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 2);

        i = m.erase(std::next(m.cbegin(), 2));
        assert(m.size() == 4);
        assert(i == std::next(m.begin(), 2));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 3);
        assert(std::next(m.begin(), 2)->second == 1);
        assert(std::next(m.begin(), 3)->first == 3);
        assert(std::next(m.begin(), 3)->second == 2);

        i = m.erase(std::next(m.cbegin(), 2));
        assert(m.size() == 3);
        assert(i == std::next(m.begin(), 2));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 3);
        assert(std::next(m.begin(), 2)->second == 2);

        i = m.erase(std::next(m.cbegin(), 0));
        assert(m.size() == 2);
        assert(i == std::next(m.begin(), 0));
        assert(std::next(m.begin(), 0)->first == 2);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 3);
        assert(std::next(m.begin(), 1)->second == 2);

        i = m.erase(std::next(m.cbegin(), 1));
        assert(m.size() == 1);
        assert(i == m.end());
        assert(std::next(m.begin(), 0)->first == 2);
        assert(std::next(m.begin(), 0)->second == 1.5);

        i = m.erase(m.cbegin());
        assert(m.size() == 0);
        assert(i == m.begin());
        assert(i == m.end());
    }
#if TEST_STD_VER >= 11
    {
        typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
        typedef std::pair<int, double> P;
        typedef M::iterator I;
        P ar[] =
        {
            P(1, 1),
            P(1, 1.5),
            P(1, 2),
            P(2, 1),
            P(2, 1.5),
            P(2, 2),
            P(3, 1),
            P(3, 1.5),
            P(3, 2),
        };
        M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
        assert(m.size() == 9);
        I i = m.erase(std::next(m.cbegin(), 3));
        assert(m.size() == 8);
        assert(i == std::next(m.begin(), 3));
        assert(m.begin()->first == 1);
        assert(m.begin()->second == 1);
        assert(std::next(m.begin())->first == 1);
        assert(std::next(m.begin())->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 1);
        assert(std::next(m.begin(), 2)->second == 2);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 1.5);
        assert(std::next(m.begin(), 4)->first == 2);
        assert(std::next(m.begin(), 4)->second == 2);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 1);
        assert(std::next(m.begin(), 6)->first == 3);
        assert(std::next(m.begin(), 6)->second == 1.5);
        assert(std::next(m.begin(), 7)->first == 3);
        assert(std::next(m.begin(), 7)->second == 2);

        i = m.erase(std::next(m.cbegin(), 0));
        assert(m.size() == 7);
        assert(i == m.begin());
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 1);
        assert(std::next(m.begin(), 1)->second == 2);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 1.5);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 2);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 1);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 1.5);
        assert(std::next(m.begin(), 6)->first == 3);
        assert(std::next(m.begin(), 6)->second == 2);

        i = m.erase(std::next(m.cbegin(), 5));
        assert(m.size() == 6);
        assert(i == std::prev(m.end()));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 1);
        assert(std::next(m.begin(), 1)->second == 2);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 1.5);
        assert(std::next(m.begin(), 3)->first == 2);
        assert(std::next(m.begin(), 3)->second == 2);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 1);
        assert(std::next(m.begin(), 5)->first == 3);
        assert(std::next(m.begin(), 5)->second == 2);

        i = m.erase(std::next(m.cbegin(), 1));
        assert(m.size() == 5);
        assert(i == std::next(m.begin()));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 2);
        assert(std::next(m.begin(), 2)->second == 2);
        assert(std::next(m.begin(), 3)->first == 3);
        assert(std::next(m.begin(), 3)->second == 1);
        assert(std::next(m.begin(), 4)->first == 3);
        assert(std::next(m.begin(), 4)->second == 2);

        i = m.erase(std::next(m.cbegin(), 2));
        assert(m.size() == 4);
        assert(i == std::next(m.begin(), 2));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 3);
        assert(std::next(m.begin(), 2)->second == 1);
        assert(std::next(m.begin(), 3)->first == 3);
        assert(std::next(m.begin(), 3)->second == 2);

        i = m.erase(std::next(m.cbegin(), 2));
        assert(m.size() == 3);
        assert(i == std::next(m.begin(), 2));
        assert(std::next(m.begin(), 0)->first == 1);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 2);
        assert(std::next(m.begin(), 1)->second == 1.5);
        assert(std::next(m.begin(), 2)->first == 3);
        assert(std::next(m.begin(), 2)->second == 2);

        i = m.erase(std::next(m.cbegin(), 0));
        assert(m.size() == 2);
        assert(i == std::next(m.begin(), 0));
        assert(std::next(m.begin(), 0)->first == 2);
        assert(std::next(m.begin(), 0)->second == 1.5);
        assert(std::next(m.begin(), 1)->first == 3);
        assert(std::next(m.begin(), 1)->second == 2);

        i = m.erase(std::next(m.cbegin(), 1));
        assert(m.size() == 1);
        assert(i == m.end());
        assert(std::next(m.begin(), 0)->first == 2);
        assert(std::next(m.begin(), 0)->second == 1.5);

        i = m.erase(m.cbegin());
        assert(m.size() == 0);
        assert(i == m.begin());
        assert(i == m.end());
    }
#endif
#if TEST_STD_VER >= 14
    {
    //  This is LWG #2059
        typedef TemplateConstructor T;
        typedef std::multimap<T, int> C;
        typedef C::iterator I;

        C c;
        T a{0};
        I it = c.find(a);
        if (it != c.end())
            c.erase(it);
    }
#endif

  return 0;
}