| static constexpr bool is_unique() noexcept; |
(1) | (since C++23) |
| constexpr bool is_exhaustive() const noexcept; |
(2) | (since C++23) |
| static constexpr bool is_strided() noexcept; |
(3) | (since C++23) |
| static constexpr bool is_always_unique() noexcept; |
(4) | (since C++23) |
| static constexpr bool is_always_exhaustive() noexcept; |
(5) | (since C++23) |
| static constexpr bool is_always_strided() noexcept; |
(6) | (since C++23) |
Every instance of every specialization of mapping is unique and strided.
The mapping is exhaustive if one of the following conditions is true:
-
rank_is0, or - there exists a permutation
pof the integers in the range[0,rank_)such that:
-
stride(p[0])equals1and -
stride(p[i])equalsstride(p[i - 1]) * extents().extent(p[i - 1])
-
- for all
iin[1,rank_), wherep[i]is the ith element ofp.
(rank_ is an exposition-only static member constant defined in std::layout_stride::mapping.)
See LayoutMapping for the semantics of these predicate mapping traits.
Parameters
(none)
Return value
truetrue if the mapping is exhaustive (see above)falseExample
Reason: no example
See also
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.