1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
14 // multimap(multimap&& m, const allocator_type& a);
20 #include "../../../test_compare.h"
21 #include "test_allocator.h"
22 #include "min_allocator.h"
27 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
29 typedef std::pair<MoveOnly, MoveOnly> V;
30 typedef std::pair<const MoveOnly, MoveOnly> VC;
31 typedef test_compare<std::less<MoveOnly> > C;
32 typedef test_allocator<VC> A;
33 typedef std::multimap<MoveOnly, MoveOnly, C, A> M;
34 typedef std::move_iterator<V*> I;
47 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
60 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
61 M m3(std::move(m1), A(7));
63 assert(m3.get_allocator() == A(7));
64 assert(m3.key_comp() == C(5));
68 typedef std::pair<MoveOnly, MoveOnly> V;
69 typedef std::pair<const MoveOnly, MoveOnly> VC;
70 typedef test_compare<std::less<MoveOnly> > C;
71 typedef test_allocator<VC> A;
72 typedef std::multimap<MoveOnly, MoveOnly, C, A> M;
73 typedef std::move_iterator<V*> I;
86 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
99 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
100 M m3(std::move(m1), A(5));
102 assert(m3.get_allocator() == A(5));
103 assert(m3.key_comp() == C(5));
107 typedef std::pair<MoveOnly, MoveOnly> V;
108 typedef std::pair<const MoveOnly, MoveOnly> VC;
109 typedef test_compare<std::less<MoveOnly> > C;
110 typedef other_allocator<VC> A;
111 typedef std::multimap<MoveOnly, MoveOnly, C, A> M;
112 typedef std::move_iterator<V*> I;
125 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
138 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
139 M m3(std::move(m1), A(5));
141 assert(m3.get_allocator() == A(5));
142 assert(m3.key_comp() == C(5));
146 typedef Counter<int> T;
147 typedef std::pair<int, T> V;
148 typedef std::pair<const int, T> VC;
149 typedef test_allocator<VC> A;
150 typedef std::less<int> C;
151 typedef std::multimap<const int, T, C, A> M;
153 Counter_base::gConstructed = 0;
167 const size_t num = sizeof(a1)/sizeof(a1[0]);
168 assert(Counter_base::gConstructed == num);
170 M m1(I(a1), I(a1+num), C(), A());
171 assert(Counter_base::gConstructed == 2*num);
175 assert(Counter_base::gConstructed == 3*num);
177 M m3(std::move(m1), A());
180 assert(Counter_base::gConstructed == 3*num);
183 M m4(std::move(m2), A(5));
184 assert(Counter_base::gConstructed == 3*num);
188 assert(Counter_base::gConstructed == 2*num);
190 assert(Counter_base::gConstructed == 0);
192 #if TEST_STD_VER >= 11
194 typedef std::pair<MoveOnly, MoveOnly> V;
195 typedef std::pair<const MoveOnly, MoveOnly> VC;
196 typedef test_compare<std::less<MoveOnly> > C;
197 typedef min_allocator<VC> A;
198 typedef std::multimap<MoveOnly, MoveOnly, C, A> M;
199 typedef std::move_iterator<V*> I;
212 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A());
225 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A());
226 M m3(std::move(m1), A());
228 assert(m3.get_allocator() == A());
229 assert(m3.key_comp() == C(5));
233 typedef std::pair<MoveOnly, MoveOnly> V;
234 typedef std::pair<const MoveOnly, MoveOnly> VC;
235 typedef test_compare<std::less<MoveOnly> > C;
236 typedef explicit_allocator<VC> A;
237 typedef std::multimap<MoveOnly, MoveOnly, C, A> M;
238 typedef std::move_iterator<V*> I;
251 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A{});
264 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A{});
265 M m3(std::move(m1), A{});
267 assert(m3.get_allocator() == A{});
268 assert(m3.key_comp() == C(5));
272 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES