1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// UNSUPPORTED: c++03
10
11// <map>
12
13// class map
14
15// map& operator=(map&& m);
16
17#include <map>
18#include <cassert>
19
20#include "test_macros.h"
21#include "MoveOnly.h"
22#include "../../../test_compare.h"
23#include "test_allocator.h"
24#include "min_allocator.h"
25
26int main(int, char**) {
27 {
28 typedef std::pair<MoveOnly, MoveOnly> V;
29 typedef std::pair<const MoveOnly, MoveOnly> VC;
30 typedef test_less<MoveOnly> C;
31 typedef test_allocator<VC> A;
32 typedef std::map<MoveOnly, MoveOnly, C, A> M;
33 typedef std::move_iterator<V*> I;
34 V a1[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
35 M m1(I(a1), I(a1 + sizeof(a1) / sizeof(a1[0])), C(5), A(7));
36 V a2[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
37 M m2(I(a2), I(a2 + sizeof(a2) / sizeof(a2[0])), C(5), A(7));
38 M m3(C(3), A(7));
39 m3 = std::move(m1);
40 assert(m3 == m2);
41 assert(m3.get_allocator() == A(7));
42 assert(m3.key_comp() == C(5));
43 assert(m1.empty());
44 }
45 {
46 typedef std::pair<MoveOnly, MoveOnly> V;
47 typedef std::pair<const MoveOnly, MoveOnly> VC;
48 typedef test_less<MoveOnly> C;
49 typedef test_allocator<VC> A;
50 typedef std::map<MoveOnly, MoveOnly, C, A> M;
51 typedef std::move_iterator<V*> I;
52 V a1[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
53 M m1(I(a1), I(a1 + sizeof(a1) / sizeof(a1[0])), C(5), A(7));
54 V a2[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
55 M m2(I(a2), I(a2 + sizeof(a2) / sizeof(a2[0])), C(5), A(7));
56 M m3(C(3), A(5));
57 m3 = std::move(m1);
58 assert(m3 == m2);
59 assert(m3.get_allocator() == A(5));
60 assert(m3.key_comp() == C(5));
61 LIBCPP_ASSERT(m1.empty());
62 }
63 {
64 typedef std::pair<MoveOnly, MoveOnly> V;
65 typedef std::pair<const MoveOnly, MoveOnly> VC;
66 typedef test_less<MoveOnly> C;
67 typedef other_allocator<VC> A;
68 typedef std::map<MoveOnly, MoveOnly, C, A> M;
69 typedef std::move_iterator<V*> I;
70 V a1[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
71 M m1(I(a1), I(a1 + sizeof(a1) / sizeof(a1[0])), C(5), A(7));
72 V a2[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
73 M m2(I(a2), I(a2 + sizeof(a2) / sizeof(a2[0])), C(5), A(7));
74 M m3(C(3), A(5));
75 m3 = std::move(m1);
76 assert(m3 == m2);
77 assert(m3.get_allocator() == A(7));
78 assert(m3.key_comp() == C(5));
79 assert(m1.empty());
80 }
81 {
82 typedef std::pair<MoveOnly, MoveOnly> V;
83 typedef std::pair<const MoveOnly, MoveOnly> VC;
84 typedef test_less<MoveOnly> C;
85 typedef min_allocator<VC> A;
86 typedef std::map<MoveOnly, MoveOnly, C, A> M;
87 typedef std::move_iterator<V*> I;
88 V a1[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
89 M m1(I(a1), I(a1 + sizeof(a1) / sizeof(a1[0])), C(5), A());
90 V a2[] = {V(1, 1), V(1, 2), V(1, 3), V(2, 1), V(2, 2), V(2, 3), V(3, 1), V(3, 2), V(3, 3)};
91 M m2(I(a2), I(a2 + sizeof(a2) / sizeof(a2[0])), C(5), A());
92 M m3(C(3), A());
93 m3 = std::move(m1);
94 assert(m3 == m2);
95 assert(m3.get_allocator() == A());
96 assert(m3.key_comp() == C(5));
97 assert(m1.empty());
98 }
99
100 return 0;
101}
102

source code of libcxx/test/std/containers/associative/map/map.cons/move_assign.pass.cpp