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 | // <list> |
10 | |
11 | // void reverse(); |
12 | |
13 | #include <list> |
14 | #include <cassert> |
15 | |
16 | #include "test_macros.h" |
17 | #include "min_allocator.h" |
18 | |
19 | int main(int, char**) |
20 | { |
21 | { |
22 | int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; |
23 | int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; |
24 | std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); |
25 | c1.reverse(); |
26 | assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); |
27 | } |
28 | #if TEST_STD_VER >= 11 |
29 | { |
30 | int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; |
31 | int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; |
32 | std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); |
33 | c1.reverse(); |
34 | assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0])))); |
35 | } |
36 | #endif |
37 | |
38 | return 0; |
39 | } |
40 | |