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