1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <unordered_set>
11 
12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
13 //           class Alloc = allocator<Value>>
14 // class unordered_multiset
15 
16 // size_type erase(const key_type& k);
17 
18 #include <unordered_set>
19 #include <string>
20 #include <cassert>
21 
22 #include "../../min_allocator.h"
23 
24 int main()
25 {
26     {
27         typedef std::unordered_multiset<int> C;
28         typedef int P;
29         P a[] =
30         {
31             P(1),
32             P(2),
33             P(3),
34             P(4),
35             P(1),
36             P(2)
37         };
38         C c(a, a + sizeof(a)/sizeof(a[0]));
39         assert(c.erase(5) == 0);
40         assert(c.size() == 6);
41         assert(c.count(1) == 2);
42         assert(c.count(2) == 2);
43         assert(c.count(3) == 1);
44         assert(c.count(4) == 1);
45 
46         assert(c.erase(2) == 2);
47         assert(c.size() == 4);
48         assert(c.count(1) == 2);
49         assert(c.count(3) == 1);
50         assert(c.count(4) == 1);
51 
52         assert(c.erase(2) == 0);
53         assert(c.size() == 4);
54         assert(c.count(1) == 2);
55         assert(c.count(3) == 1);
56         assert(c.count(4) == 1);
57 
58         assert(c.erase(4) == 1);
59         assert(c.size() == 3);
60         assert(c.count(1) == 2);
61         assert(c.count(3) == 1);
62 
63         assert(c.erase(4) == 0);
64         assert(c.size() == 3);
65         assert(c.count(1) == 2);
66         assert(c.count(3) == 1);
67 
68         assert(c.erase(1) == 2);
69         assert(c.size() == 1);
70         assert(c.count(3) == 1);
71 
72         assert(c.erase(1) == 0);
73         assert(c.size() == 1);
74         assert(c.count(3) == 1);
75 
76         assert(c.erase(3) == 1);
77         assert(c.size() == 0);
78 
79         assert(c.erase(3) == 0);
80         assert(c.size() == 0);
81     }
82 #if __cplusplus >= 201103L
83     {
84         typedef std::unordered_multiset<int, std::hash<int>,
85                                       std::equal_to<int>, min_allocator<int>> C;
86         typedef int P;
87         P a[] =
88         {
89             P(1),
90             P(2),
91             P(3),
92             P(4),
93             P(1),
94             P(2)
95         };
96         C c(a, a + sizeof(a)/sizeof(a[0]));
97         assert(c.erase(5) == 0);
98         assert(c.size() == 6);
99         assert(c.count(1) == 2);
100         assert(c.count(2) == 2);
101         assert(c.count(3) == 1);
102         assert(c.count(4) == 1);
103 
104         assert(c.erase(2) == 2);
105         assert(c.size() == 4);
106         assert(c.count(1) == 2);
107         assert(c.count(3) == 1);
108         assert(c.count(4) == 1);
109 
110         assert(c.erase(2) == 0);
111         assert(c.size() == 4);
112         assert(c.count(1) == 2);
113         assert(c.count(3) == 1);
114         assert(c.count(4) == 1);
115 
116         assert(c.erase(4) == 1);
117         assert(c.size() == 3);
118         assert(c.count(1) == 2);
119         assert(c.count(3) == 1);
120 
121         assert(c.erase(4) == 0);
122         assert(c.size() == 3);
123         assert(c.count(1) == 2);
124         assert(c.count(3) == 1);
125 
126         assert(c.erase(1) == 2);
127         assert(c.size() == 1);
128         assert(c.count(3) == 1);
129 
130         assert(c.erase(1) == 0);
131         assert(c.size() == 1);
132         assert(c.count(3) == 1);
133 
134         assert(c.erase(3) == 1);
135         assert(c.size() == 0);
136 
137         assert(c.erase(3) == 0);
138         assert(c.size() == 0);
139     }
140 #endif
141 }
142