range_size_hash_equal_allocator.pass.cpp revision bc8d3f97eb5c958007f2713238472e0c1c8fe02c 
1//===----------------------------------------------------------------------===//
2//
3// ��������������������The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. 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_multimap
15
16// template <class InputIterator>
17//     unordered_multimap(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
25#include "../../../iterators.h"
26#include "../../../NotConstructible.h"
27#include "../../../test_compare.h"
28#include "../../../test_hash.h"
29#include "../../../test_allocator.h"
30
31int main()
32{
33    {
34        typedef std::unordered_multimap<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            7,
51            test_hash<std::hash<int> >(8),
52            test_compare<std::equal_to<int> >(9),
53            test_allocator<std::pair<const int, std::string> >(10)
54           );
55        assert(c.bucket_count() == 7);
56        assert(c.size() == 6);
57        typedef std::pair<C::const_iterator, C::const_iterator> Eq;
58        Eq eq = c.equal_range(1);
59        assert(std::distance(eq.first, eq.second) == 2);
60        C::const_iterator i = eq.first;
61        assert(i->first == 1);
62        assert(i->second == "one");
63        ++i;
64        assert(i->first == 1);
65        assert(i->second == "four");
66        eq = c.equal_range(2);
67        assert(std::distance(eq.first, eq.second) == 2);
68        i = eq.first;
69        assert(i->first == 2);
70        assert(i->second == "two");
71        ++i;
72        assert(i->first == 2);
73        assert(i->second == "four");
74
75        eq = c.equal_range(3);
76        assert(std::distance(eq.first, eq.second) == 1);
77        i = eq.first;
78        assert(i->first == 3);
79        assert(i->second == "three");
80        eq = c.equal_range(4);
81        assert(std::distance(eq.first, eq.second) == 1);
82        i = eq.first;
83        assert(i->first == 4);
84        assert(i->second == "four");
85        assert(std::distance(c.begin(), c.end()) == c.size());
86        assert(std::distance(c.cbegin(), c.cend()) == c.size());
87        assert(c.load_factor() == (float)c.size()/c.bucket_count());
88        assert(c.max_load_factor() == 1);
89        assert(c.hash_function() == test_hash<std::hash<int> >(8));
90        assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
91        assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >(10)));
92    }
93}
94