range_size_hash_equal_allocator.pass.cpp revision 83e2c4d877fe2d7793868b1c6a5d9525a7c4d431 
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, size_type n,
18//                   const hasher& hf, const key_equal& eql,
19//                   const allocator_type& a);
20
21#include <unordered_map>
22#include <string>
23#include <cassert>
24#include <cfloat>
25
26#include "test_iterators.h"
27#include "../../../NotConstructible.h"
28#include "../../../test_compare.h"
29#include "../../../test_hash.h"
30#include "../../../test_allocator.h"
31
32int main()
33{
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        P a[] =
42        {
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        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
51            7,
52            test_hash<std::hash<int> >(8),
53            test_compare<std::equal_to<int> >(9),
54            test_allocator<std::pair<const int, std::string> >(10)
55           );
56        assert(c.bucket_count() == 7);
57        assert(c.size() == 4);
58        assert(c.at(1) == "one");
59        assert(c.at(2) == "two");
60        assert(c.at(3) == "three");
61        assert(c.at(4) == "four");
62        assert(c.hash_function() == test_hash<std::hash<int> >(8));
63        assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
64        assert(c.get_allocator() ==
65               (test_allocator<std::pair<const int, std::string> >(10)));
66        assert(!c.empty());
67        assert(std::distance(c.begin(), c.end()) == c.size());
68        assert(std::distance(c.cbegin(), c.cend()) == c.size());
69        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
70        assert(c.max_load_factor() == 1);
71    }
72}
73