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_multimap
15 
16 // unordered_multimap(initializer_list<value_type> il, size_type n, const hasher& hf);
17 
18 #include <unordered_map>
19 #include <string>
20 #include <cassert>
21 #include <cfloat>
22 
23 #include "../../../test_compare.h"
24 #include "../../../test_hash.h"
25 #include "../../../test_allocator.h"
26 #include "../../../min_allocator.h"
27 
28 int main()
29 {
30 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
31     {
32         typedef std::unordered_multimap<int, std::string,
33                                    test_hash<std::hash<int> >,
34                                    test_compare<std::equal_to<int> >,
35                                    test_allocator<std::pair<const int, std::string> >
36                                    > C;
37         typedef std::pair<int, std::string> P;
38         C c({
39                 P(1, "one"),
40                 P(2, "two"),
41                 P(3, "three"),
42                 P(4, "four"),
43                 P(1, "four"),
44                 P(2, "four"),
45             },
46             7,
47             test_hash<std::hash<int> >(8)
48            );
49         assert(c.bucket_count() == 7);
50         assert(c.size() == 6);
51         typedef std::pair<C::const_iterator, C::const_iterator> Eq;
52         Eq eq = c.equal_range(1);
53         assert(std::distance(eq.first, eq.second) == 2);
54         C::const_iterator i = eq.first;
55         assert(i->first == 1);
56         assert(i->second == "one");
57         ++i;
58         assert(i->first == 1);
59         assert(i->second == "four");
60         eq = c.equal_range(2);
61         assert(std::distance(eq.first, eq.second) == 2);
62         i = eq.first;
63         assert(i->first == 2);
64         assert(i->second == "two");
65         ++i;
66         assert(i->first == 2);
67         assert(i->second == "four");
68 
69         eq = c.equal_range(3);
70         assert(std::distance(eq.first, eq.second) == 1);
71         i = eq.first;
72         assert(i->first == 3);
73         assert(i->second == "three");
74         eq = c.equal_range(4);
75         assert(std::distance(eq.first, eq.second) == 1);
76         i = eq.first;
77         assert(i->first == 4);
78         assert(i->second == "four");
79         assert(std::distance(c.begin(), c.end()) == c.size());
80         assert(std::distance(c.cbegin(), c.cend()) == c.size());
81         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
82         assert(c.max_load_factor() == 1);
83         assert(c.hash_function() == test_hash<std::hash<int> >(8));
84         assert(c.key_eq() == test_compare<std::equal_to<int> >());
85         assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
86     }
87 #if __cplusplus >= 201103L
88     {
89         typedef std::unordered_multimap<int, std::string,
90                                    test_hash<std::hash<int> >,
91                                    test_compare<std::equal_to<int> >,
92                                    min_allocator<std::pair<const int, std::string> >
93                                    > C;
94         typedef std::pair<int, std::string> P;
95         C c({
96                 P(1, "one"),
97                 P(2, "two"),
98                 P(3, "three"),
99                 P(4, "four"),
100                 P(1, "four"),
101                 P(2, "four"),
102             },
103             7,
104             test_hash<std::hash<int> >(8)
105            );
106         assert(c.bucket_count() == 7);
107         assert(c.size() == 6);
108         typedef std::pair<C::const_iterator, C::const_iterator> Eq;
109         Eq eq = c.equal_range(1);
110         assert(std::distance(eq.first, eq.second) == 2);
111         C::const_iterator i = eq.first;
112         assert(i->first == 1);
113         assert(i->second == "one");
114         ++i;
115         assert(i->first == 1);
116         assert(i->second == "four");
117         eq = c.equal_range(2);
118         assert(std::distance(eq.first, eq.second) == 2);
119         i = eq.first;
120         assert(i->first == 2);
121         assert(i->second == "two");
122         ++i;
123         assert(i->first == 2);
124         assert(i->second == "four");
125 
126         eq = c.equal_range(3);
127         assert(std::distance(eq.first, eq.second) == 1);
128         i = eq.first;
129         assert(i->first == 3);
130         assert(i->second == "three");
131         eq = c.equal_range(4);
132         assert(std::distance(eq.first, eq.second) == 1);
133         i = eq.first;
134         assert(i->first == 4);
135         assert(i->second == "four");
136         assert(std::distance(c.begin(), c.end()) == c.size());
137         assert(std::distance(c.cbegin(), c.cend()) == c.size());
138         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
139         assert(c.max_load_factor() == 1);
140         assert(c.hash_function() == test_hash<std::hash<int> >(8));
141         assert(c.key_eq() == test_compare<std::equal_to<int> >());
142         assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
143     }
144 #endif
145 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
146 }
147