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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
// <mdspan>
// constexpr index_type stride(rank_type i) const noexcept;
//
// Constraints: extents_type::rank() > 0 is true.
//
// Preconditions: i < extents_type::rank() is true.
//
// Returns: extents().rev-prod-of-extents(i).
#include <mdspan>
#include <array>
#include <cassert>
#include <cstdint>
#include <cstdio>
#include <span> // dynamic_extent
#include "test_macros.h"
template <class E, class... Args>
constexpr void test_stride(std::array<typename E::index_type, E::rank()> strides, Args... args) {
using M = std::layout_stride::mapping<E>;
M m(E(args...), strides);
ASSERT_NOEXCEPT(m.stride(0));
for (size_t r = 0; r < E::rank(); r++)
assert(strides[r] == m.stride(r));
ASSERT_NOEXCEPT(m.strides());
auto strides_out = m.strides();
static_assert(std::is_same_v<decltype(strides_out), std::array<typename E::index_type, E::rank()>>);
for (size_t r = 0; r < E::rank(); r++)
assert(strides[r] == strides_out[r]);
}
constexpr bool test() {
constexpr size_t D = std::dynamic_extent;
test_stride<std::extents<unsigned, D>>(std::array<unsigned, 1>{1}, 7);
test_stride<std::extents<unsigned, 7>>(std::array<unsigned, 1>{1});
test_stride<std::extents<unsigned, 7, 8>>(std::array<unsigned, 2>{8, 1});
test_stride<std::extents<int64_t, D, 8, D, D>>(std::array<int64_t, 4>{720, 90, 10, 1}, 7, 9, 10);
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}
|
