Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-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 | // <deque> |
| 11 | |
| 12 | // deque(deque&& c, const allocator_type& a); |
| 13 | |
| 14 | #include <deque> |
| 15 | #include <cassert> |
| 16 | |
| 17 | #include "../../../MoveOnly.h" |
| 18 | #include "../../../test_allocator.h" |
| 19 | |
| 20 | int main() |
| 21 | { |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 22 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 23 | { |
| 24 | int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; |
| 25 | int* an = ab + sizeof(ab)/sizeof(ab[0]); |
| 26 | typedef test_allocator<MoveOnly> A; |
| 27 | std::deque<MoveOnly, A> c1(A(1)); |
| 28 | for (int* p = ab; p < an; ++p) |
| 29 | c1.push_back(MoveOnly(*p)); |
| 30 | std::deque<MoveOnly, A> c2(A(1)); |
| 31 | for (int* p = ab; p < an; ++p) |
| 32 | c2.push_back(MoveOnly(*p)); |
| 33 | std::deque<MoveOnly, A> c3(std::move(c1), A(3)); |
| 34 | assert(c2 == c3); |
| 35 | assert(c3.get_allocator() == A(3)); |
| 36 | assert(c1.size() != 0); |
| 37 | } |
| 38 | { |
| 39 | int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; |
| 40 | int* an = ab + sizeof(ab)/sizeof(ab[0]); |
| 41 | typedef test_allocator<MoveOnly> A; |
| 42 | std::deque<MoveOnly, A> c1(A(1)); |
| 43 | for (int* p = ab; p < an; ++p) |
| 44 | c1.push_back(MoveOnly(*p)); |
| 45 | std::deque<MoveOnly, A> c2(A(1)); |
| 46 | for (int* p = ab; p < an; ++p) |
| 47 | c2.push_back(MoveOnly(*p)); |
| 48 | std::deque<MoveOnly, A> c3(std::move(c1), A(1)); |
| 49 | assert(c2 == c3); |
| 50 | assert(c3.get_allocator() == A(1)); |
| 51 | assert(c1.size() == 0); |
| 52 | } |
| 53 | { |
| 54 | int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; |
| 55 | int* an = ab + sizeof(ab)/sizeof(ab[0]); |
| 56 | typedef other_allocator<MoveOnly> A; |
| 57 | std::deque<MoveOnly, A> c1(A(1)); |
| 58 | for (int* p = ab; p < an; ++p) |
| 59 | c1.push_back(MoveOnly(*p)); |
| 60 | std::deque<MoveOnly, A> c2(A(1)); |
| 61 | for (int* p = ab; p < an; ++p) |
| 62 | c2.push_back(MoveOnly(*p)); |
| 63 | std::deque<MoveOnly, A> c3(std::move(c1), A(3)); |
| 64 | assert(c2 == c3); |
| 65 | assert(c3.get_allocator() == A(3)); |
| 66 | assert(c1.size() != 0); |
| 67 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 68 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 69 | } |