5#ifndef DUNE_COMMON_STD_LAYOUT_RIGHT_HH
6#define DUNE_COMMON_STD_LAYOUT_RIGHT_HH
11#include <dune/common/indices.hh>
12#include <dune/common/std/impl/fwd_layouts.hh>
17template <
class Extents>
20 template <
class>
friend class mapping;
23 using extents_type = Extents;
24 using size_type =
typename extents_type::size_type;
25 using rank_type =
typename extents_type::rank_type;
26 using index_type =
typename extents_type::index_type;
36 constexpr
mapping (const extents_type& e) noexcept
41 template <
class OtherExtents,
42 std::enable_if_t<std::is_constructible_v<extents_type, OtherExtents>,
int> = 0>
43 #if __cpp_conditional_explicit >= 201806L
44 explicit(!std::is_convertible_v<OtherExtents, extents_type>)
47 : extents_(m.extents())
51 template <
class OtherExtents,
class E = extents_type,
52 std::enable_if_t<(E::rank() <= 1),
int> = 0,
53 std::enable_if_t<std::is_constructible_v<extents_type, OtherExtents>,
int> = 0>
54 #
if __cpp_conditional_explicit >= 201806L
55 explicit(!std::is_convertible_v<OtherExtents, extents_type>)
58 : extents_(m.extents())
62 template <
class OtherExtents,
63 std::enable_if_t<std::is_constructible_v<extents_type, OtherExtents>,
int> = 0>
64 #if __cpp_conditional_explicit >= 201806L
65 explicit(extents_type::rank() > 0)
68 : extents_(m.extents())
71 if constexpr(extents_type::rank() > 0) {
73 for (rank_type r = extents_type::rank()-1; r > 0; --r) {
75 prod *= m.extents().extent(r);
85 constexpr const extents_type&
extents () const noexcept {
return extents_; }
86 constexpr index_type required_span_size () const noexcept {
return extents_.product(); }
90 std::enable_if_t<(
sizeof...(Indices) == extents_type::rank()),
int> = 0,
91 std::enable_if_t<(std::is_convertible_v<Indices, index_type> && ...),
int> = 0,
92 std::enable_if_t<(std::is_nothrow_constructible_v<Indices, index_type> && ...),
int> = 0>
95 const std::array indices{index_type(std::move(ii))...};
96 index_type value = indices.front();
97 for (rank_type j = 0; j < extents_type::rank()-1; ++j) {
98 value = indices[j+1] + extents_.extent(j+1) * value;
109 static constexpr bool is_always_unique () noexcept {
return true; }
110 static constexpr bool is_always_exhaustive () noexcept {
return true; }
111 static constexpr bool is_always_strided () noexcept {
return true; }
113 static constexpr bool is_unique () noexcept {
return true; }
114 static constexpr bool is_exhaustive () noexcept {
return true; }
115 static constexpr bool is_strided () noexcept {
return true; }
118 template <
class E = extents_type,
119 std::enable_if_t<(E::rank() > 0),
int> = 0>
120 constexpr index_type
stride (rank_type i)
const noexcept
122 assert(i < extents_type::rank());
124 for (rank_type r = i+1; r < extents_type::rank(); ++r)
129 template <
class OtherExtents>
132 return a.extents_ == b.extents_;
136 [[no_unique_address]] extents_type extents_;
Multidimensional index space with dynamic and static extents.
Definition: extents.hh:54
constexpr index_type extent(rank_type r) const noexcept
Return the extent of dimension i
Definition: extents.hh:100
A layout mapping where the leftmost extent has stride 1.
Definition: layout_left.hh:19
A layout mapping where the rightmost extent has stride 1.
Definition: layout_right.hh:19
constexpr index_type operator()() const noexcept
The default offset for rank-0 tensors is 0.
Definition: layout_right.hh:104
constexpr mapping & operator=(const mapping &) noexcept=default
Copy-assignment for the mapping.
constexpr mapping() noexcept=default
The default construction is possible for default constructible extents.
constexpr index_type stride(rank_type i) const noexcept
The stride is the product of the extents E(n)*E(n-1)*...*E(i+1)
Definition: layout_right.hh:120
constexpr mapping(const layout_left::mapping< OtherExtents > &m) noexcept
Construct the mapping from a layout_left.
Definition: layout_right.hh:57
A layout mapping where the strides are user-defined.
Definition: layout_stride.hh:19
constexpr const strides_type & strides() const noexcept
Get the array of all strides.
Definition: layout_stride.hh:127
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition: iteratorfacades.hh:238
Namespace with predefined compile time indices for the range [0,19].
Definition: indices.hh:50
Namespace for features backported from new C++ standards.
Definition: default_accessor.hh:10
A layout where the rightmost extent has stride 1, and strides increase right-to-left as the product o...
Definition: fwd_layouts.hh:30