File: aggregate.pass.cpp

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (51 lines) | stat: -rw-r--r-- 1,562 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// Make sure std::array is an aggregate type.
// We can only check this in C++17 and above, because we don't have the
// trait before that.
// UNSUPPORTED: c++03, c++11, c++14

// libc++ doesn't implement std::is_aggregate on GCC 5 and GCC 6.
// UNSUPPORTED: libc++ && gcc-5
// UNSUPPORTED: libc++ && gcc-6

#include <array>
#include <type_traits>

template <typename T>
void check_aggregate()
{
    static_assert(std::is_aggregate<std::array<T, 0> >::value, "");
    static_assert(std::is_aggregate<std::array<T, 1> >::value, "");
    static_assert(std::is_aggregate<std::array<T, 2> >::value, "");
    static_assert(std::is_aggregate<std::array<T, 3> >::value, "");
    static_assert(std::is_aggregate<std::array<T, 4> >::value, "");
}

struct Empty { };
struct Trivial { int i; int j; };
struct NonTrivial {
    int i; int j;
    NonTrivial(NonTrivial const&) { }
};

int main(int, char**)
{
    check_aggregate<char>();
    check_aggregate<int>();
    check_aggregate<long>();
    check_aggregate<float>();
    check_aggregate<double>();
    check_aggregate<long double>();
    check_aggregate<Empty>();
    check_aggregate<Trivial>();
    check_aggregate<NonTrivial>();

    return 0;
}