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 // UNSUPPORTED: c++98, c++03 11 12 // <deque> 13 14 // deque& operator=(deque&& c); 15 16 #include <deque> 17 #include <cassert> 18 19 #include "MoveOnly.h" 20 #include "test_allocator.h" 21 #include "min_allocator.h" 22 23 int main() 24 { 25 { 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); 28 typedef test_allocator<MoveOnly> A; 29 std::deque<MoveOnly, A> c1(A(5)); 30 for (int* p = ab; p < an; ++p) 31 c1.push_back(MoveOnly(*p)); 32 std::deque<MoveOnly, A> c2(A(5)); 33 for (int* p = ab; p < an; ++p) 34 c2.push_back(MoveOnly(*p)); 35 std::deque<MoveOnly, A> c3(A(5)); 36 c3 = std::move(c1); 37 assert(c2 == c3); 38 assert(c1.size() == 0); 39 assert(c3.get_allocator() == A(5)); 40 } 41 { 42 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; 43 int* an = ab + sizeof(ab)/sizeof(ab[0]); 44 typedef test_allocator<MoveOnly> A; 45 std::deque<MoveOnly, A> c1(A(5)); 46 for (int* p = ab; p < an; ++p) 47 c1.push_back(MoveOnly(*p)); 48 std::deque<MoveOnly, A> c2(A(5)); 49 for (int* p = ab; p < an; ++p) 50 c2.push_back(MoveOnly(*p)); 51 std::deque<MoveOnly, A> c3(A(6)); 52 c3 = std::move(c1); 53 assert(c2 == c3); 54 assert(c1.size() != 0); 55 assert(c3.get_allocator() == A(6)); 56 } 57 { 58 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); 60 typedef other_allocator<MoveOnly> A; 61 std::deque<MoveOnly, A> c1(A(5)); 62 for (int* p = ab; p < an; ++p) 63 c1.push_back(MoveOnly(*p)); 64 std::deque<MoveOnly, A> c2(A(5)); 65 for (int* p = ab; p < an; ++p) 66 c2.push_back(MoveOnly(*p)); 67 std::deque<MoveOnly, A> c3(A(6)); 68 c3 = std::move(c1); 69 assert(c2 == c3); 70 assert(c1.size() == 0); 71 assert(c3.get_allocator() == A(5)); 72 } 73 { 74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; 75 int* an = ab + sizeof(ab)/sizeof(ab[0]); 76 typedef min_allocator<MoveOnly> A; 77 std::deque<MoveOnly, A> c1(A{}); 78 for (int* p = ab; p < an; ++p) 79 c1.push_back(MoveOnly(*p)); 80 std::deque<MoveOnly, A> c2(A{}); 81 for (int* p = ab; p < an; ++p) 82 c2.push_back(MoveOnly(*p)); 83 std::deque<MoveOnly, A> c3(A{}); 84 c3 = std::move(c1); 85 assert(c2 == c3); 86 assert(c1.size() == 0); 87 assert(c3.get_allocator() == A()); 88 } 89 } 90
