range.pass.cpp revision a8bf9de8057ad254cc642f33bd7d0a48dc1ae55c 
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
30int main()
31{
32    {
33        typedef std::unordered_multimap<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        assert(c.bucket_count() >= 7);
50        assert(c.size() == 6);
51        typedef std::pair<C::const_iterator, C::const_iterator> Eq;
52        Eq eq = c.equal_range(1);
53        assert(std::distance(eq.first, eq.second) == 2);
54        C::const_iterator i = eq.first;
55        assert(i->first == 1);
56        assert(i->second == "one");
57        ++i;
58        assert(i->first == 1);
59        assert(i->second == "four");
60        eq = c.equal_range(2);
61        assert(std::distance(eq.first, eq.second) == 2);
62        i = eq.first;
63        assert(i->first == 2);
64        assert(i->second == "two");
65        ++i;
66        assert(i->first == 2);
67        assert(i->second == "four");
68
69        eq = c.equal_range(3);
70        assert(std::distance(eq.first, eq.second) == 1);
71        i = eq.first;
72        assert(i->first == 3);
73        assert(i->second == "three");
74        eq = c.equal_range(4);
75        assert(std::distance(eq.first, eq.second) == 1);
76        i = eq.first;
77        assert(i->first == 4);
78        assert(i->second == "four");
79        assert(std::distance(c.begin(), c.end()) == c.size());
80        assert(std::distance(c.cbegin(), c.cend()) == c.size());
81        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
82        assert(c.max_load_factor() == 1);
83        assert(c.hash_function() == test_hash<std::hash<int> >());
84        assert(c.key_eq() == test_compare<std::equal_to<int> >());
85        assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
86    }
87}
88