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 find(const key_type& k);
17 
18 #include <unordered_map>
19 #include <string>
20 #include <cassert>
21 
22 #include "../../min_allocator.h"
23 
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(10, "ten"),
32             P(20, "twenty"),
33             P(30, "thirty"),
34             P(40, "fourty"),
35             P(50, "fifty"),
36             P(60, "sixty"),
37             P(70, "seventy"),
38             P(80, "eighty"),
39         };
40         C c(std::begin(a), std::end(a));
41         C::iterator i = c.find(30);
42         assert(i->first == 30);
43         assert(i->second == "thirty");
44         i = c.find(5);
45         assert(i == c.end());
46     }
47 #if __cplusplus >= 201103L
48     {
49         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
50                             min_allocator<std::pair<const int, std::string>>> C;
51         typedef std::pair<int, std::string> P;
52         P a[] =
53         {
54             P(10, "ten"),
55             P(20, "twenty"),
56             P(30, "thirty"),
57             P(40, "fourty"),
58             P(50, "fifty"),
59             P(60, "sixty"),
60             P(70, "seventy"),
61             P(80, "eighty"),
62         };
63         C c(std::begin(a), std::end(a));
64         C::iterator i = c.find(30);
65         assert(i->first == 30);
66         assert(i->second == "thirty");
67         i = c.find(5);
68         assert(i == c.end());
69     }
70 #endif
71 }
72