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 // void clear()
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.clear();
40 assert(c.size() == 0);
41 }
42 #if __cplusplus >= 201103L
43 {
44 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
45 min_allocator<std::pair<const int, std::string>>> C;
46 typedef std::pair<int, std::string> P;
47 P a[] =
48 {
49 P(1, "one"),
50 P(2, "two"),
51 P(3, "three"),
52 P(4, "four"),
53 P(1, "four"),
54 P(2, "four"),
55 };
56 C c(a, a + sizeof(a)/sizeof(a[0]));
57 c.clear();
58 assert(c.size() == 0);
59 }
60 #endif
61 }
62