range.pass.cpp revision 7a6b7cedcb3359ad7d77e355b02ab982d9d2b25b 
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// template <class InputIterator>
17//     unordered_map(InputIterator first, InputIterator last);
18
19#include <unordered_map>
20#include <string>
21#include <cassert>
22#include <cfloat>
23
24#include "test_iterators.h"
25#include "../../../NotConstructible.h"
26#include "../../../test_compare.h"
27#include "../../../test_hash.h"
28#include "../../../test_allocator.h"
29#include "../../../min_allocator.h"
30
31int main()
32{
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        P a[] =
41        {
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        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
50        assert(c.bucket_count() >= 5);
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(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
64        assert(c.max_load_factor() == 1);
65    }
66#if __cplusplus >= 201103L
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        P a[] =
75        {
76            P(1, "one"),
77            P(2, "two"),
78            P(3, "three"),
79            P(4, "four"),
80            P(1, "four"),
81            P(2, "four"),
82        };
83        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
84        assert(c.bucket_count() >= 5);
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(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
98        assert(c.max_load_factor() == 1);
99    }
100#endif
101}
102