brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.3 KiB · 43e894f Raw
48 lines · cpp
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-exception6//7//===----------------------------------------------------------------------===//8 9// <list>10 11// void reverse(); // constexpr since C++2612 13#include <list>14#include <cassert>15 16#include "test_macros.h"17#include "min_allocator.h"18 19TEST_CONSTEXPR_CXX26 bool test() {20  {21    int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};22    int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};23    std::list<int> c1(a1, a1 + sizeof(a1) / sizeof(a1[0]));24    c1.reverse();25    assert(c1 == std::list<int>(a2, a2 + sizeof(a2) / sizeof(a2[0])));26  }27#if TEST_STD_VER >= 1128  {29    int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};30    int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};31    std::list<int, min_allocator<int>> c1(a1, a1 + sizeof(a1) / sizeof(a1[0]));32    c1.reverse();33    assert((c1 == std::list<int, min_allocator<int>>(a2, a2 + sizeof(a2) / sizeof(a2[0]))));34  }35#endif36 37  return true;38}39 40int main(int, char**) {41  assert(test());42#if TEST_STD_VER >= 2643  static_assert(test());44#endif45 46  return 0;47}48