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_map>
11
12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
14 // class unordered_map
15
16 // iterator erase(const_iterator first, const_iterator last)
17
18 #include <unordered_map>
19 #include <string>
20 #include <cassert>
21
22 #include "min_allocator.h"
23
main()24 int main()
25 {
26 {
27 typedef std::unordered_map<int, std::string> C;
28 typedef std::pair<int, std::string> P;
29 P a[] =
30 {
31 P(1, "one"),
32 P(2, "two"),
33 P(3, "three"),
34 P(4, "four"),
35 P(1, "four"),
36 P(2, "four"),
37 };
38 C c(a, a + sizeof(a)/sizeof(a[0]));
39 C::const_iterator i = c.find(2);
40 C::const_iterator j = next(i, 1);
41 C::iterator k = c.erase(i, i);
42 assert(k == i);
43 assert(c.size() == 4);
44 assert(c.at(1) == "one");
45 assert(c.at(2) == "two");
46 assert(c.at(3) == "three");
47 assert(c.at(4) == "four");
48
49 k = c.erase(i, j);
50 assert(c.size() == 3);
51 assert(k == j);
52 assert(c.at(1) == "one");
53 assert(c.at(3) == "three");
54 assert(c.at(4) == "four");
55
56 k = c.erase(c.cbegin(), c.cend());
57 assert(k == c.cend());
58 assert(c.size() == 0);
59 assert(k == c.end());
60 }
61 #if __cplusplus >= 201103L
62 {
63 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
64 min_allocator<std::pair<const int, std::string>>> C;
65 typedef std::pair<int, std::string> P;
66 P a[] =
67 {
68 P(1, "one"),
69 P(2, "two"),
70 P(3, "three"),
71 P(4, "four"),
72 P(1, "four"),
73 P(2, "four"),
74 };
75 C c(a, a + sizeof(a)/sizeof(a[0]));
76 C::const_iterator i = c.find(2);
77 C::const_iterator j = next(i, 1);
78 C::iterator k = c.erase(i, i);
79 assert(k == i);
80 assert(c.size() == 4);
81 assert(c.at(1) == "one");
82 assert(c.at(2) == "two");
83 assert(c.at(3) == "three");
84 assert(c.at(4) == "four");
85
86 k = c.erase(i, j);
87 assert(c.size() == 3);
88 assert(k == j);
89 assert(c.at(1) == "one");
90 assert(c.at(3) == "three");
91 assert(c.at(4) == "four");
92
93 k = c.erase(c.cbegin(), c.cend());
94 assert(k == c.cend());
95 assert(c.size() == 0);
96 assert(k == c.end());
97 }
98 #endif
99 }
100