Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / libcxx / 73d21a4f0774d3fadab98e690619a359cfb160a3 / . / test / containers / unord / unord.multiset / unord.multiset.cnstr / move_alloc.pass.cpp
blob: 1576557596bbb780a48248a70ce1c1fe38a8fb1f [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]1//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +0000[diff] [blame]3// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]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_set>
11
12// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
13// class Alloc = allocator<Value>>
14// class unordered_multiset
15
16// unordered_multiset(unordered_multiset&& u, const allocator_type& a);
17
18#include <unordered_set>
19#include <cassert>
20
21#include "../../../test_compare.h"
22#include "../../../test_hash.h"
23#include "../../../test_allocator.h"
24
25int main()
26{
Howard Hinnant73d21a42010-09-04 23:28:19 +0000[diff] [blame^]27#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]28 {
29 typedef int P;
30 typedef test_allocator<int> A;
31 typedef std::unordered_multiset<int,
32 test_hash<std::hash<int> >,
33 test_compare<std::equal_to<int> >,
34 A
35 > C;
36 P a[] =
37 {
38 P(1),
39 P(2),
40 P(3),
41 P(4),
42 P(1),
43 P(2)
44 };
45 C c0(a, a + sizeof(a)/sizeof(a[0]),
46 7,
47 test_hash<std::hash<int> >(8),
48 test_compare<std::equal_to<int> >(9),
49 A(10)
50 );
51 C c(std::move(c0), A(12));
52 assert(c.bucket_count() >= 7);
53 assert(c.size() == 6);
54 C::const_iterator i = c.cbegin();
55 assert(*i == 1);
56 ++i;
57 assert(*i == 1);
58 ++i;
59 assert(*i == 2);
60 ++i;
61 assert(*i == 2);
62 ++i;
63 assert(*i == 3);
64 ++i;
65 assert(*i == 4);
66 assert(c.hash_function() == test_hash<std::hash<int> >(8));
67 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
68 assert(c.get_allocator() == A(12));
69 assert(!c.empty());
70 assert(std::distance(c.begin(), c.end()) == c.size());
71 assert(std::distance(c.cbegin(), c.cend()) == c.size());
72 assert(c.load_factor() == (float)c.size()/c.bucket_count());
73 assert(c.max_load_factor() == 1);
74
75 assert(c0.empty());
76 }
77 {
78 typedef int P;
79 typedef test_allocator<int> A;
80 typedef std::unordered_multiset<int,
81 test_hash<std::hash<int> >,
82 test_compare<std::equal_to<int> >,
83 A
84 > C;
85 P a[] =
86 {
87 P(1),
88 P(2),
89 P(3),
90 P(4),
91 P(1),
92 P(2)
93 };
94 C c0(a, a + sizeof(a)/sizeof(a[0]),
95 7,
96 test_hash<std::hash<int> >(8),
97 test_compare<std::equal_to<int> >(9),
98 A(10)
99 );
100 C c(std::move(c0), A(10));
101 assert(c.bucket_count() == 7);
102 assert(c.size() == 6);
103 assert(c.count(1) == 2);
104 assert(c.count(2) == 2);
105 assert(c.count(3) == 1);
106 assert(c.count(4) == 1);
107 assert(c.hash_function() == test_hash<std::hash<int> >(8));
108 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
109 assert(c.get_allocator() == A(10));
110 assert(!c.empty());
111 assert(std::distance(c.begin(), c.end()) == c.size());
112 assert(std::distance(c.cbegin(), c.cend()) == c.size());
113 assert(c.load_factor() == (float)c.size()/c.bucket_count());
114 assert(c.max_load_factor() == 1);
115
116 assert(c0.empty());
117 }
Howard Hinnant73d21a42010-09-04 23:28:19 +0000[diff] [blame^]118#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]119}