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