init.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// unordered_multimap(initializer_list<value_type> il);
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21#include <cfloat>
22
23#include "../../../test_compare.h"
24#include "../../../test_hash.h"
25#include "../../../test_allocator.h"
26
27int main()
28{
29#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
30    {
31        typedef std::unordered_multimap<int, std::string,
32                                   test_hash<std::hash<int> >,
33                                   test_compare<std::equal_to<int> >,
34                                   test_allocator<std::pair<const int, std::string> >
35                                   > C;
36        typedef std::pair<int, std::string> P;
37        C c = {
38                P(1, "one"),
39                P(2, "two"),
40                P(3, "three"),
41                P(4, "four"),
42                P(1, "four"),
43                P(2, "four"),
44              };
45        assert(c.bucket_count() >= 7);
46        assert(c.size() == 6);
47        typedef std::pair<C::const_iterator, C::const_iterator> Eq;
48        Eq eq = c.equal_range(1);
49        assert(std::distance(eq.first, eq.second) == 2);
50        C::const_iterator i = eq.first;
51        assert(i->first == 1);
52        assert(i->second == "one");
53        ++i;
54        assert(i->first == 1);
55        assert(i->second == "four");
56        eq = c.equal_range(2);
57        assert(std::distance(eq.first, eq.second) == 2);
58        i = eq.first;
59        assert(i->first == 2);
60        assert(i->second == "two");
61        ++i;
62        assert(i->first == 2);
63        assert(i->second == "four");
64
65        eq = c.equal_range(3);
66        assert(std::distance(eq.first, eq.second) == 1);
67        i = eq.first;
68        assert(i->first == 3);
69        assert(i->second == "three");
70        eq = c.equal_range(4);
71        assert(std::distance(eq.first, eq.second) == 1);
72        i = eq.first;
73        assert(i->first == 4);
74        assert(i->second == "four");
75        assert(std::distance(c.begin(), c.end()) == c.size());
76        assert(std::distance(c.cbegin(), c.cend()) == c.size());
77        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
78        assert(c.max_load_factor() == 1);
79        assert(c.hash_function() == test_hash<std::hash<int> >());
80        assert(c.key_eq() == test_compare<std::equal_to<int> >());
81        assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
82    }
83#endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
84}
85