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 | // <list> |
12 | |
13 | // list(list&& c, const allocator_type& a); |
14 | |
15 | #include <list> |
16 | #include <cassert> |
17 | #include "test_macros.h" |
18 | #include "MoveOnly.h" |
19 | #include "test_allocator.h" |
20 | #include "min_allocator.h" |
21 | |
22 | int main(int, char**) |
23 | { |
24 | { |
25 | std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5)); |
26 | std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); |
27 | for (int i = 1; i <= 3; ++i) |
28 | { |
29 | l.push_back(i); |
30 | lo.push_back(i); |
31 | } |
32 | std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6)); |
33 | assert(l2 == lo); |
34 | assert(!l.empty()); |
35 | assert(l2.get_allocator() == test_allocator<MoveOnly>(6)); |
36 | } |
37 | { |
38 | std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5)); |
39 | std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); |
40 | for (int i = 1; i <= 3; ++i) |
41 | { |
42 | l.push_back(i); |
43 | lo.push_back(i); |
44 | } |
45 | std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5)); |
46 | assert(l2 == lo); |
47 | assert(l.empty()); |
48 | assert(l2.get_allocator() == test_allocator<MoveOnly>(5)); |
49 | } |
50 | { |
51 | std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5)); |
52 | std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); |
53 | for (int i = 1; i <= 3; ++i) |
54 | { |
55 | l.push_back(i); |
56 | lo.push_back(i); |
57 | } |
58 | std::list<MoveOnly, other_allocator<MoveOnly> > l2(std::move(l), other_allocator<MoveOnly>(4)); |
59 | assert(l2 == lo); |
60 | assert(!l.empty()); |
61 | assert(l2.get_allocator() == other_allocator<MoveOnly>(4)); |
62 | } |
63 | { |
64 | std::list<MoveOnly, min_allocator<MoveOnly> > l(min_allocator<MoveOnly>{}); |
65 | std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); |
66 | for (int i = 1; i <= 3; ++i) |
67 | { |
68 | l.push_back(i); |
69 | lo.push_back(i); |
70 | } |
71 | std::list<MoveOnly, min_allocator<MoveOnly> > l2(std::move(l), min_allocator<MoveOnly>()); |
72 | assert(l2 == lo); |
73 | assert(l.empty()); |
74 | assert(l2.get_allocator() == min_allocator<MoveOnly>()); |
75 | } |
76 | |
77 | return 0; |
78 | } |
79 | |