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