File: array-type-trait-with-template.cpp

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.8-1~exp1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,388 kB
  • sloc: cpp: 7,438,767; ansic: 1,393,871; asm: 1,012,926; python: 241,728; f90: 86,635; objc: 75,411; lisp: 42,144; pascal: 17,286; sh: 10,027; ml: 5,082; perl: 4,730; awk: 3,523; makefile: 3,349; javascript: 2,251; xml: 892; fortran: 672
file content (129 lines) | stat: -rw-r--r-- 3,022 bytes parent folder | download | duplicates (9)
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
// RUN: %clang_cc1 -fsyntax-only %s
// RUN: %clang_cc1 -fsyntax-only -std=c++20 -DWITH_AUTO_FUNCTION_PARAMETER=1 %s

// When __array_rank is used with a template type parameter, this test
// ensures clang considers the final expression could be used with
// static_assert/constexpr.
//
// Although array_extent was handled well, we add it as a precaution.

template <typename T>
using remove_reference_t = __remove_reference_t(T);

template <typename T, int N>
constexpr int array_rank(T (&lhs)[N]) {
  return __array_rank(T[N]);
}

template <int I, typename T, int N>
 constexpr int array_extent(T (&lhs)[N]) {
  return __array_extent(T[N], I);
}

template <typename T>
struct Rank {
  using ArrayT = remove_reference_t<T>;

  template <int N>
  static constexpr int call(ArrayT (&lhs)[N]) {
    return __array_rank(ArrayT[N]);
  }
};

template <typename T>
struct Extent {
  using ArrayT = remove_reference_t<T>;

  template <int I, int N>
  static constexpr int call(ArrayT (&lhs)[N]) {
    return __array_extent(ArrayT[N], I);
  }
};

#ifdef WITH_AUTO_FUNCTION_PARAMETER
template <int N>
constexpr int array_rank_auto(auto (&lhs)[N]) {
  return __array_rank(remove_reference_t<decltype(lhs[0])>[N]);
}

template <int I, int N>
constexpr int array_extent_auto(auto (&lhs)[N]) {
  return __array_extent(remove_reference_t<decltype(lhs[0])>[N], I);
}
#endif

template <int N>
constexpr int array_rank_int(const int (&lhs)[N]) {
  return __array_rank(const int[N]);
}

template <int I, int N>
constexpr int array_extent_int(const int (&lhs)[N]) {
  return __array_extent(const int[N], I);
}

template <int M, int N>
constexpr int array_rank_int(const int (&lhs)[M][N]) {
  return __array_rank(const int[M][N]);
}

template <int I, int M, int N>
constexpr int array_extent_int(const int (&lhs)[M][N]) {
  return __array_extent(const int[M][N], I);
}

int main() {
  constexpr int vec[] = {0, 1, 2, 1};
  constexpr int mat[4][4] = {
    {1, 0, 0, 0},
    {0, 1, 0, 0},
    {0, 0, 1, 0},
    {0, 0, 0, 1}
  };

#define ATT_TESTS_WITH_ASSERT(ATT_ASSERT)	\
  { ATT_ASSERT(RANK(vec) == 1);	}		\
  { ATT_ASSERT(RANK(mat) == 2);	}		\
  { ATT_ASSERT(EXTENT(vec, 0) == 4); }		\
  { ATT_ASSERT(EXTENT(vec, 1) == 0); }		\
  { ATT_ASSERT(EXTENT(mat, 1) == 4); }

#define ATT_TESTS()				\
  ATT_TESTS_WITH_ASSERT( constexpr bool cst = )	\
  ATT_TESTS_WITH_ASSERT( (void) )		\
  ATT_TESTS_WITH_ASSERT( static_assert )

  {
#define RANK(lhs) array_rank(lhs)
#define EXTENT(lhs, i) array_extent<i>(lhs)
    ATT_TESTS();
#undef RANK
#undef EXTENT
  }

  {
#define RANK(lhs) Rank<decltype(lhs[0])>::call(lhs)
#define EXTENT(lhs, i) Extent<decltype(lhs[0])>::call<i>(lhs)
    ATT_TESTS();
#undef RANK
#undef EXTENT
  }

#ifdef WITH_AUTO_FUNCTION_PARAMETER
  {
#define RANK(lhs) array_rank_auto(lhs)
#define EXTENT(lhs, i) array_extent_auto<i>(lhs)
    ATT_TESTS();
#undef RANK
#undef EXTENT
  }
#endif

  {
#define RANK(lhs) array_rank_int(lhs)
#define EXTENT(lhs, i) array_extent_int<i>(lhs)
    ATT_TESTS();
#undef RANK
#undef EXTENT
  }
}