]> CyberLeo.Net >> Repos - FreeBSD/FreeBSD.git/blob - test/std/containers/unord/unord.map/unord.map.cnstr/init_size_hash.pass.cpp
Vendor import of libc++ trunk r290819:
[FreeBSD/FreeBSD.git] / test / std / containers / unord / unord.map / unord.map.cnstr / init_size_hash.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, const hasher& hf);
17
18 #include <unordered_map>
19 #include <string>
20 #include <cassert>
21 #include <cfloat>
22 #include <cmath>
23 #include <cstddef>
24
25 #include "test_macros.h"
26 #include "../../../test_compare.h"
27 #include "../../../test_hash.h"
28 #include "test_allocator.h"
29 #include "min_allocator.h"
30
31 int main()
32 {
33 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
34     {
35         typedef std::unordered_map<int, std::string,
36                                    test_hash<std::hash<int> >,
37                                    test_compare<std::equal_to<int> >,
38                                    test_allocator<std::pair<const int, std::string> >
39                                    > C;
40         typedef std::pair<int, std::string> P;
41         C c({
42                 P(1, "one"),
43                 P(2, "two"),
44                 P(3, "three"),
45                 P(4, "four"),
46                 P(1, "four"),
47                 P(2, "four"),
48             },
49             7,
50             test_hash<std::hash<int> >(8)
51            );
52         LIBCPP_ASSERT(c.bucket_count() == 7);
53         assert(c.size() == 4);
54         assert(c.at(1) == "one");
55         assert(c.at(2) == "two");
56         assert(c.at(3) == "three");
57         assert(c.at(4) == "four");
58         assert(c.hash_function() == test_hash<std::hash<int> >(8));
59         assert(c.key_eq() == test_compare<std::equal_to<int> >());
60         assert(c.get_allocator() ==
61                (test_allocator<std::pair<const int, std::string> >()));
62         assert(!c.empty());
63         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
64         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
65         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
66         assert(c.max_load_factor() == 1);
67     }
68 #if TEST_STD_VER >= 11
69     {
70         typedef std::unordered_map<int, std::string,
71                                    test_hash<std::hash<int> >,
72                                    test_compare<std::equal_to<int> >,
73                                    min_allocator<std::pair<const int, std::string> >
74                                    > C;
75         typedef std::pair<int, std::string> P;
76         C c({
77                 P(1, "one"),
78                 P(2, "two"),
79                 P(3, "three"),
80                 P(4, "four"),
81                 P(1, "four"),
82                 P(2, "four"),
83             },
84             7,
85             test_hash<std::hash<int> >(8)
86            );
87         LIBCPP_ASSERT(c.bucket_count() == 7);
88         assert(c.size() == 4);
89         assert(c.at(1) == "one");
90         assert(c.at(2) == "two");
91         assert(c.at(3) == "three");
92         assert(c.at(4) == "four");
93         assert(c.hash_function() == test_hash<std::hash<int> >(8));
94         assert(c.key_eq() == test_compare<std::equal_to<int> >());
95         assert(c.get_allocator() ==
96                (min_allocator<std::pair<const int, std::string> >()));
97         assert(!c.empty());
98         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
99         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
100         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
101         assert(c.max_load_factor() == 1);
102     }
103 #endif
104 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
105 }