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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <set>
// class multiset
// size_type erase(const key_type& k);
#include <set>
#include <cassert>
#include "min_allocator.h"
int main()
{
{
typedef std::multiset<int> M;
typedef int V;
typedef M::size_type I;
V ar[] =
{
3,
3,
3,
5,
5,
5,
7,
7,
7
};
M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
assert(m.size() == 9);
I i = m.erase(6);
assert(m.size() == 9);
assert(i == 0);
assert(*next(m.begin(), 0) == 3);
assert(*next(m.begin(), 1) == 3);
assert(*next(m.begin(), 2) == 3);
assert(*next(m.begin(), 3) == 5);
assert(*next(m.begin(), 4) == 5);
assert(*next(m.begin(), 5) == 5);
assert(*next(m.begin(), 6) == 7);
assert(*next(m.begin(), 7) == 7);
assert(*next(m.begin(), 8) == 7);
i = m.erase(5);
assert(m.size() == 6);
assert(i == 3);
assert(*next(m.begin(), 0) == 3);
assert(*next(m.begin(), 1) == 3);
assert(*next(m.begin(), 2) == 3);
assert(*next(m.begin(), 3) == 7);
assert(*next(m.begin(), 4) == 7);
assert(*next(m.begin(), 5) == 7);
i = m.erase(3);
assert(m.size() == 3);
assert(i == 3);
assert(*next(m.begin(), 0) == 7);
assert(*next(m.begin(), 1) == 7);
assert(*next(m.begin(), 2) == 7);
i = m.erase(7);
assert(m.size() == 0);
assert(i == 3);
}
#if __cplusplus >= 201103L
{
typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
typedef int V;
typedef M::size_type I;
V ar[] =
{
3,
3,
3,
5,
5,
5,
7,
7,
7
};
M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
assert(m.size() == 9);
I i = m.erase(6);
assert(m.size() == 9);
assert(i == 0);
assert(*next(m.begin(), 0) == 3);
assert(*next(m.begin(), 1) == 3);
assert(*next(m.begin(), 2) == 3);
assert(*next(m.begin(), 3) == 5);
assert(*next(m.begin(), 4) == 5);
assert(*next(m.begin(), 5) == 5);
assert(*next(m.begin(), 6) == 7);
assert(*next(m.begin(), 7) == 7);
assert(*next(m.begin(), 8) == 7);
i = m.erase(5);
assert(m.size() == 6);
assert(i == 3);
assert(*next(m.begin(), 0) == 3);
assert(*next(m.begin(), 1) == 3);
assert(*next(m.begin(), 2) == 3);
assert(*next(m.begin(), 3) == 7);
assert(*next(m.begin(), 4) == 7);
assert(*next(m.begin(), 5) == 7);
i = m.erase(3);
assert(m.size() == 3);
assert(i == 3);
assert(*next(m.begin(), 0) == 7);
assert(*next(m.begin(), 1) == 7);
assert(*next(m.begin(), 2) == 7);
i = m.erase(7);
assert(m.size() == 0);
assert(i == 3);
}
#endif
}
|
