range.pass.cpp revision ad46d2248426e810edc5878c7cb086b7093f3cf5 
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_multimap
15
16// template <class InputIterator>
17//     unordered_multimap(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_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        assert(c.bucket_count() >= 7);
51        assert(c.size() == 6);
52        typedef std::pair<C::const_iterator, C::const_iterator> Eq;
53        Eq eq = c.equal_range(1);
54        assert(std::distance(eq.first, eq.second) == 2);
55        C::const_iterator i = eq.first;
56        assert(i->first == 1);
57        assert(i->second == "one");
58        ++i;
59        assert(i->first == 1);
60        assert(i->second == "four");
61        eq = c.equal_range(2);
62        assert(std::distance(eq.first, eq.second) == 2);
63        i = eq.first;
64        assert(i->first == 2);
65        assert(i->second == "two");
66        ++i;
67        assert(i->first == 2);
68        assert(i->second == "four");
69
70        eq = c.equal_range(3);
71        assert(std::distance(eq.first, eq.second) == 1);
72        i = eq.first;
73        assert(i->first == 3);
74        assert(i->second == "three");
75        eq = c.equal_range(4);
76        assert(std::distance(eq.first, eq.second) == 1);
77        i = eq.first;
78        assert(i->first == 4);
79        assert(i->second == "four");
80        assert(std::distance(c.begin(), c.end()) == c.size());
81        assert(std::distance(c.cbegin(), c.cend()) == c.size());
82        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
83        assert(c.max_load_factor() == 1);
84        assert(c.hash_function() == test_hash<std::hash<int> >());
85        assert(c.key_eq() == test_compare<std::equal_to<int> >());
86        assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
87    }
88#if __cplusplus >= 201103L
89    {
90        typedef std::unordered_multimap<int, std::string,
91                                   test_hash<std::hash<int> >,
92                                   test_compare<std::equal_to<int> >,
93                                   min_allocator<std::pair<const int, std::string> >
94                                   > C;
95        typedef std::pair<int, std::string> P;
96        P a[] =
97        {
98            P(1, "one"),
99            P(2, "two"),
100            P(3, "three"),
101            P(4, "four"),
102            P(1, "four"),
103            P(2, "four"),
104        };
105        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
106        assert(c.bucket_count() >= 7);
107        assert(c.size() == 6);
108        typedef std::pair<C::const_iterator, C::const_iterator> Eq;
109        Eq eq = c.equal_range(1);
110        assert(std::distance(eq.first, eq.second) == 2);
111        C::const_iterator i = eq.first;
112        assert(i->first == 1);
113        assert(i->second == "one");
114        ++i;
115        assert(i->first == 1);
116        assert(i->second == "four");
117        eq = c.equal_range(2);
118        assert(std::distance(eq.first, eq.second) == 2);
119        i = eq.first;
120        assert(i->first == 2);
121        assert(i->second == "two");
122        ++i;
123        assert(i->first == 2);
124        assert(i->second == "four");
125
126        eq = c.equal_range(3);
127        assert(std::distance(eq.first, eq.second) == 1);
128        i = eq.first;
129        assert(i->first == 3);
130        assert(i->second == "three");
131        eq = c.equal_range(4);
132        assert(std::distance(eq.first, eq.second) == 1);
133        i = eq.first;
134        assert(i->first == 4);
135        assert(i->second == "four");
136        assert(std::distance(c.begin(), c.end()) == c.size());
137        assert(std::distance(c.cbegin(), c.cend()) == c.size());
138        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
139        assert(c.max_load_factor() == 1);
140        assert(c.hash_function() == test_hash<std::hash<int> >());
141        assert(c.key_eq() == test_compare<std::equal_to<int> >());
142        assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
143    }
144#endif
145}
146