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 // <map> 11 12 // class map 13 14 // map& operator=(map&& m); 15 16 #include <map> 17 #include <cassert> 18 19 #include "../../../MoveOnly.h" 20 #include "../../../test_compare.h" 21 #include "../../../test_allocator.h" 22 23 int main() 24 { 25 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 26 { 27 typedef std::pair<MoveOnly, MoveOnly> V; 28 typedef std::pair<const MoveOnly, MoveOnly> VC; 29 typedef test_compare<std::less<MoveOnly> > C; 30 typedef test_allocator<VC> A; 31 typedef std::map<MoveOnly, MoveOnly, C, A> M; 32 typedef std::move_iterator<V*> I; 33 V a1[] = 34 { 35 V(1, 1), 36 V(1, 2), 37 V(1, 3), 38 V(2, 1), 39 V(2, 2), 40 V(2, 3), 41 V(3, 1), 42 V(3, 2), 43 V(3, 3) 44 }; 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 46 V a2[] = 47 { 48 V(1, 1), 49 V(1, 2), 50 V(1, 3), 51 V(2, 1), 52 V(2, 2), 53 V(2, 3), 54 V(3, 1), 55 V(3, 2), 56 V(3, 3) 57 }; 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 59 M m3(C(3), A(7)); 60 m3 = std::move(m1); 61 assert(m3 == m2); 62 assert(m3.get_allocator() == A(7)); 63 assert(m3.key_comp() == C(5)); 64 assert(m1.empty()); 65 } 66 { 67 typedef std::pair<MoveOnly, MoveOnly> V; 68 typedef std::pair<const MoveOnly, MoveOnly> VC; 69 typedef test_compare<std::less<MoveOnly> > C; 70 typedef test_allocator<VC> A; 71 typedef std::map<MoveOnly, MoveOnly, C, A> M; 72 typedef std::move_iterator<V*> I; 73 V a1[] = 74 { 75 V(1, 1), 76 V(1, 2), 77 V(1, 3), 78 V(2, 1), 79 V(2, 2), 80 V(2, 3), 81 V(3, 1), 82 V(3, 2), 83 V(3, 3) 84 }; 85 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 86 V a2[] = 87 { 88 V(1, 1), 89 V(1, 2), 90 V(1, 3), 91 V(2, 1), 92 V(2, 2), 93 V(2, 3), 94 V(3, 1), 95 V(3, 2), 96 V(3, 3) 97 }; 98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 99 M m3(C(3), A(5)); 100 m3 = std::move(m1); 101 assert(m3 == m2); 102 assert(m3.get_allocator() == A(5)); 103 assert(m3.key_comp() == C(5)); 104 assert(m1.empty()); 105 } 106 { 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::map<MoveOnly, MoveOnly, C, A> M; 112 typedef std::move_iterator<V*> I; 113 V a1[] = 114 { 115 V(1, 1), 116 V(1, 2), 117 V(1, 3), 118 V(2, 1), 119 V(2, 2), 120 V(2, 3), 121 V(3, 1), 122 V(3, 2), 123 V(3, 3) 124 }; 125 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 126 V a2[] = 127 { 128 V(1, 1), 129 V(1, 2), 130 V(1, 3), 131 V(2, 1), 132 V(2, 2), 133 V(2, 3), 134 V(3, 1), 135 V(3, 2), 136 V(3, 3) 137 }; 138 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 139 M m3(C(3), A(5)); 140 m3 = std::move(m1); 141 assert(m3 == m2); 142 assert(m3.get_allocator() == A(7)); 143 assert(m3.key_comp() == C(5)); 144 assert(m1.empty()); 145 } 146 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 147 } 148
