range_size_hash_equal.pass.cpp revision f5256e16dfc425c1d466f6308d4026d529ce9e0b 
1d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//===----------------------------------------------------------------------===//
2d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//
3d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//                     The LLVM Compiler Infrastructure
4d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//
5d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks// This file is distributed under the University of Illinois Open Source
6d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks// License. See LICENSE.TXT for details.
7d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//
8d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks//===----------------------------------------------------------------------===//
9d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks
10d94466c4c8054cbe68cffb132d0ad90d924dca01Dave Sparks// <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
20#include <unordered_map>
21#include <string>
22#include <cassert>
23
24#include "../../../iterators.h"
25#include "../../../NotConstructible.h"
26#include "../../../test_compare.h"
27#include "../../../test_hash.h"
28#include "../../../test_allocator.h"
29
30int main()
31{
32    {
33        typedef std::unordered_map<int, std::string,
34                                   test_hash<std::hash<int> >,
35                                   test_compare<std::equal_to<int> >,
36                                   test_allocator<std::pair<const int, std::string> >
37                                   > C;
38        typedef std::pair<int, std::string> P;
39        P a[] =
40        {
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        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
49            7,
50            test_hash<std::hash<int> >(8),
51            test_compare<std::equal_to<int> >(9)
52           );
53        assert(c.bucket_count() == 7);
54        assert(c.size() == 4);
55        assert(c.at(1) == "one");
56        assert(c.at(2) == "two");
57        assert(c.at(3) == "three");
58        assert(c.at(4) == "four");
59        assert(c.hash_function() == test_hash<std::hash<int> >(8));
60        assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
61        assert(c.get_allocator() ==
62               (test_allocator<std::pair<const int, std::string> >()));
63        assert(!c.empty());
64        assert(std::distance(c.begin(), c.end()) == c.size());
65        assert(std::distance(c.cbegin(), c.cend()) == c.size());
66        assert(c.load_factor() == (float)c.size()/c.bucket_count());
67        assert(c.max_load_factor() == 1);
68    }
69}
70