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
|
//===----------------------------------------------------------------------===//
//
// 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
// size_type erase(const key_type& k);
#include <map>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef std::multimap<int, double> M;
typedef std::pair<int, double> P;
typedef M::size_type 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(2);
assert(m.size() == 6);
assert(i == 3);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->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 == 3);
assert(std::next(m.begin(), 3)->second == 1);
assert(std::next(m.begin(), 4)->first == 3);
assert(std::next(m.begin(), 4)->second == 1.5);
assert(std::next(m.begin(), 5)->first == 3);
assert(std::next(m.begin(), 5)->second == 2);
i = m.erase(2);
assert(m.size() == 6);
assert(i == 0);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->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 == 3);
assert(std::next(m.begin(), 3)->second == 1);
assert(std::next(m.begin(), 4)->first == 3);
assert(std::next(m.begin(), 4)->second == 1.5);
assert(std::next(m.begin(), 5)->first == 3);
assert(std::next(m.begin(), 5)->second == 2);
i = m.erase(3);
assert(i == 3);
assert(m.size() == 3);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->second == 1.5);
assert(std::next(m.begin(), 2)->first == 1);
assert(std::next(m.begin(), 2)->second == 2);
i = m.erase(1);
assert(m.size() == 0);
assert(i == 3);
}
#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::size_type 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(2);
assert(m.size() == 6);
assert(i == 3);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->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 == 3);
assert(std::next(m.begin(), 3)->second == 1);
assert(std::next(m.begin(), 4)->first == 3);
assert(std::next(m.begin(), 4)->second == 1.5);
assert(std::next(m.begin(), 5)->first == 3);
assert(std::next(m.begin(), 5)->second == 2);
i = m.erase(2);
assert(m.size() == 6);
assert(i == 0);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->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 == 3);
assert(std::next(m.begin(), 3)->second == 1);
assert(std::next(m.begin(), 4)->first == 3);
assert(std::next(m.begin(), 4)->second == 1.5);
assert(std::next(m.begin(), 5)->first == 3);
assert(std::next(m.begin(), 5)->second == 2);
i = m.erase(3);
assert(i == 3);
assert(m.size() == 3);
assert(std::next(m.begin(), 0)->first == 1);
assert(std::next(m.begin(), 0)->second == 1);
assert(std::next(m.begin(), 1)->first == 1);
assert(std::next(m.begin(), 1)->second == 1.5);
assert(std::next(m.begin(), 2)->first == 1);
assert(std::next(m.begin(), 2)->second == 2);
i = m.erase(1);
assert(m.size() == 0);
assert(i == 3);
}
#endif
return 0;
}
|
