blob: 8cc774457614f9dc4864b2aa9d31e3b1be2236bb [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
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_map
15
16// unordered_map(unordered_map&& u);
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21
22#include "../../../test_compare.h"
23#include "../../../test_hash.h"
24#include "../../../test_allocator.h"
25
26int main()
27{
Howard Hinnant73d21a42010-09-04 23:28:19 +000028#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000029 {
30 typedef std::unordered_map<int, std::string,
31 test_hash<std::hash<int> >,
32 test_compare<std::equal_to<int> >,
33 test_allocator<std::pair<const int, std::string> >
34 > C;
35 typedef std::pair<int, std::string> P;
36 P a[] =
37 {
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 C c0(7,
46 test_hash<std::hash<int> >(8),
47 test_compare<std::equal_to<int> >(9),
48 test_allocator<std::pair<const int, std::string> >(10)
49 );
50 C c = std::move(c0);
51 assert(c.bucket_count() == 7);
52 assert(c.size() == 0);
53 assert(c.hash_function() == test_hash<std::hash<int> >(8));
54 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
55 assert(c.get_allocator() ==
56 (test_allocator<std::pair<const int, std::string> >(10)));
57 assert(c.empty());
58 assert(std::distance(c.begin(), c.end()) == c.size());
59 assert(std::distance(c.cbegin(), c.cend()) == c.size());
60 assert(c.load_factor() == 0);
61 assert(c.max_load_factor() == 1);
62
63 assert(c0.empty());
64 }
65 {
66 typedef std::unordered_map<int, std::string,
67 test_hash<std::hash<int> >,
68 test_compare<std::equal_to<int> >,
69 test_allocator<std::pair<const int, std::string> >
70 > C;
71 typedef std::pair<int, std::string> P;
72 P a[] =
73 {
74 P(1, "one"),
75 P(2, "two"),
76 P(3, "three"),
77 P(4, "four"),
78 P(1, "four"),
79 P(2, "four"),
80 };
81 C c0(a, a + sizeof(a)/sizeof(a[0]),
82 7,
83 test_hash<std::hash<int> >(8),
84 test_compare<std::equal_to<int> >(9),
85 test_allocator<std::pair<const int, std::string> >(10)
86 );
87 C c = std::move(c0);
88 assert(c.bucket_count() == 7);
89 assert(c.size() == 4);
90 assert(c.at(1) == "one");
91 assert(c.at(2) == "two");
92 assert(c.at(3) == "three");
93 assert(c.at(4) == "four");
94 assert(c.hash_function() == test_hash<std::hash<int> >(8));
95 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
96 assert(c.get_allocator() ==
97 (test_allocator<std::pair<const int, std::string> >(10)));
98 assert(!c.empty());
99 assert(std::distance(c.begin(), c.end()) == c.size());
100 assert(std::distance(c.cbegin(), c.cend()) == c.size());
101 assert(c.load_factor() == (float)c.size()/c.bucket_count());
102 assert(c.max_load_factor() == 1);
103
104 assert(c0.empty());
105 }
Howard Hinnant73d21a42010-09-04 23:28:19 +0000106#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000107}