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
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
// class Alloc = allocator<Value>>
// class unordered_multiset
// iterator erase(const_iterator first, const_iterator last)
#include <unordered_set>
#include <cassert>
#include "min_allocator.h"
int main()
{
{
typedef std::unordered_multiset<int> C;
typedef int P;
P a[] =
{
P(1),
P(2),
P(3),
P(4),
P(1),
P(2)
};
C c(a, a + sizeof(a)/sizeof(a[0]));
C::const_iterator i = c.find(2);
C::const_iterator j = next(i, 2);
C::iterator k = c.erase(i, i);
assert(k == i);
assert(c.size() == 6);
assert(c.count(1) == 2);
assert(c.count(2) == 2);
assert(c.count(3) == 1);
assert(c.count(4) == 1);
k = c.erase(i, j);
assert(c.size() == 4);
assert(c.count(1) == 2);
assert(c.count(3) == 1);
assert(c.count(4) == 1);
k = c.erase(c.cbegin(), c.cend());
assert(c.size() == 0);
assert(k == c.end());
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_multiset<int, std::hash<int>,
std::equal_to<int>, min_allocator<int>> C;
typedef int P;
P a[] =
{
P(1),
P(2),
P(3),
P(4),
P(1),
P(2)
};
C c(a, a + sizeof(a)/sizeof(a[0]));
C::const_iterator i = c.find(2);
C::const_iterator j = next(i, 2);
C::iterator k = c.erase(i, i);
assert(k == i);
assert(c.size() == 6);
assert(c.count(1) == 2);
assert(c.count(2) == 2);
assert(c.count(3) == 1);
assert(c.count(4) == 1);
k = c.erase(i, j);
assert(c.size() == 4);
assert(c.count(1) == 2);
assert(c.count(3) == 1);
assert(c.count(4) == 1);
k = c.erase(c.cbegin(), c.cend());
assert(c.size() == 0);
assert(k == c.end());
}
#endif
}
|
