24 Containers library [containers]

24.7 Views [views]

24.7.3 Multidimensional access [views.multidim]

24.7.3.7 submdspan [mdspan.sub]

24.7.3.7.6 Specializations of submdspan_mapping [mdspan.sub.map]

24.7.3.7.6.1 Common [mdspan.sub.map.common]

The following elements apply to all functions in [mdspan.sub.map].

Constraints: sizeof...(slices) equals extents_type::rank().

Mandates: For each rank index k of extents(), exactly one of the following is true:

(3.1)
$S_{k}$ models convertible_to<index_type>,
(3.2)
$S_{k}$ models index-pair-like<index_type>,
(3.3)
is_convertible_v< $S_{k}$ , full_extent_t> is true, or
(3.4)
$S_{k}$ is a specialization of strided_slice.

Preconditions: For each rank index k of extents(), all of the following are true:

(4.1)
if $S_{k}$ is a specialization of strided_slice, $s_{k}$ .extent is equal to zero or $s_{k}$ .stride is greater than zero; and
(4.2)
0 ≤ first_<index_type, k>(slices...)
0 ≤ last_<k>(extents(), slices...)
0 ≤ extents().extent(k)

Let sub_ext be the result of submdspan_extents(extents(), slices...) and let SubExtents be decltype(sub_ext).

Let sub_strides be an array<SubExtents::index_type, SubExtents::rank()> such that for each rank index k of extents() for which map-rank[k] is not dynamic_extent, sub_strides[map-rank[k]] equals:

(6.1)
stride(k) * de-ice( $s_{k}$ .stride) if $S_{k}$ is a specialization of strided_slice and $s_{k}$ .stride < $s_{k}$ .
extent is true;
(6.2)
otherwise, stride(k).

Let P be a parameter pack such that is_same_v<make_index_sequence<rank()>, index_sequence<P...>> is true.

Let offset be a value of type size_t equal to (*this)(first_<index_type, P>(slices...)...).