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_set
15
16 // iterator erase(const_iterator p)
17
18 #include <unordered_set>
19 #include <cassert>
20
21 #include "min_allocator.h"
22
main()23 int main()
24 {
25 {
26 typedef std::unordered_set<int> C;
27 typedef int P;
28 P a[] =
29 {
30 P(1),
31 P(2),
32 P(3),
33 P(4),
34 P(1),
35 P(2)
36 };
37 C c(a, a + sizeof(a)/sizeof(a[0]));
38 C::const_iterator i = c.find(2);
39 C::iterator j = c.erase(i);
40 assert(c.size() == 3);
41 assert(c.count(1) == 1);
42 assert(c.count(3) == 1);
43 assert(c.count(4) == 1);
44 }
45 #if __cplusplus >= 201103L
46 {
47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
48 typedef int P;
49 P a[] =
50 {
51 P(1),
52 P(2),
53 P(3),
54 P(4),
55 P(1),
56 P(2)
57 };
58 C c(a, a + sizeof(a)/sizeof(a[0]));
59 C::const_iterator i = c.find(2);
60 C::iterator j = c.erase(i);
61 assert(c.size() == 3);
62 assert(c.count(1) == 1);
63 assert(c.count(3) == 1);
64 assert(c.count(4) == 1);
65 }
66 #endif
67 }
68