]> CyberLeo.Net >> Repos - FreeBSD/FreeBSD.git/blob - test/std/containers/unord/unord.map/unord.map.cnstr/init_size_hash_equal_allocator.pass.cpp
Vendor import of libc++ trunk r290819:
[FreeBSD/FreeBSD.git] / test / std / containers / unord / unord.map / unord.map.cnstr / init_size_hash_equal_allocator.pass.cpp
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 // unordered_map(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 #include <cmath>
24 #include <cstddef>
25
26 #include "test_macros.h"
27 #include "../../../test_compare.h"
28 #include "../../../test_hash.h"
29 #include "test_allocator.h"
30 #include "min_allocator.h"
31
32 int main()
33 {
34 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
35     {
36         typedef std::unordered_map<int, std::string,
37                                    test_hash<std::hash<int> >,
38                                    test_compare<std::equal_to<int> >,
39                                    test_allocator<std::pair<const int, std::string> >
40                                    > C;
41         typedef std::pair<int, std::string> P;
42         C c({
43                 P(1, "one"),
44                 P(2, "two"),
45                 P(3, "three"),
46                 P(4, "four"),
47                 P(1, "four"),
48                 P(2, "four"),
49             },
50             7,
51             test_hash<std::hash<int> >(8),
52             test_compare<std::equal_to<int> >(9),
53             test_allocator<std::pair<const int, std::string> >(10)
54            );
55         LIBCPP_ASSERT(c.bucket_count() == 7);
56         assert(c.size() == 4);
57         assert(c.at(1) == "one");
58         assert(c.at(2) == "two");
59         assert(c.at(3) == "three");
60         assert(c.at(4) == "four");
61         assert(c.hash_function() == test_hash<std::hash<int> >(8));
62         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
63         assert(c.get_allocator() ==
64                (test_allocator<std::pair<const int, std::string> >(10)));
65         assert(!c.empty());
66         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
67         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
68         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
69         assert(c.max_load_factor() == 1);
70     }
71 #if TEST_STD_VER >= 11
72     {
73         typedef std::unordered_map<int, std::string,
74                                    test_hash<std::hash<int> >,
75                                    test_compare<std::equal_to<int> >,
76                                    min_allocator<std::pair<const int, std::string> >
77                                    > C;
78         typedef std::pair<int, std::string> P;
79         C c({
80                 P(1, "one"),
81                 P(2, "two"),
82                 P(3, "three"),
83                 P(4, "four"),
84                 P(1, "four"),
85                 P(2, "four"),
86             },
87             7,
88             test_hash<std::hash<int> >(8),
89             test_compare<std::equal_to<int> >(9),
90             min_allocator<std::pair<const int, std::string> >()
91            );
92         LIBCPP_ASSERT(c.bucket_count() == 7);
93         assert(c.size() == 4);
94         assert(c.at(1) == "one");
95         assert(c.at(2) == "two");
96         assert(c.at(3) == "three");
97         assert(c.at(4) == "four");
98         assert(c.hash_function() == test_hash<std::hash<int> >(8));
99         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
100         assert(c.get_allocator() ==
101                (min_allocator<std::pair<const int, std::string> >()));
102         assert(!c.empty());
103         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
104         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
105         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
106         assert(c.max_load_factor() == 1);
107     }
108     {
109         typedef explicit_allocator<std::pair<const int, std::string>> A;
110         typedef std::unordered_map<int, std::string,
111                                    test_hash<std::hash<int> >,
112                                    test_compare<std::equal_to<int> >,
113                                    A
114                                    > C;
115         typedef std::pair<int, std::string> P;
116         C c({
117                 P(1, "one"),
118                 P(2, "two"),
119                 P(3, "three"),
120                 P(4, "four"),
121                 P(1, "four"),
122                 P(2, "four"),
123             },
124             7,
125             test_hash<std::hash<int> >(8),
126             test_compare<std::equal_to<int> >(9),
127             A{}
128            );
129         LIBCPP_ASSERT(c.bucket_count() == 7);
130         assert(c.size() == 4);
131         assert(c.at(1) == "one");
132         assert(c.at(2) == "two");
133         assert(c.at(3) == "three");
134         assert(c.at(4) == "four");
135         assert(c.hash_function() == test_hash<std::hash<int> >(8));
136         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
137         assert(c.get_allocator() == A{});
138         assert(!c.empty());
139         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
140         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
141         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
142         assert(c.max_load_factor() == 1);
143     }
144 #endif
145 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
146 }