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