std::experi...::fixed_size(3)
π NAME π
okay bestie, welcome to the C++ Standard Libary page for std::experi...::fixed_size(3) β and yes, the actual name is std::experimental::simd_abi::fixed_size. Itβs giving very specific ABI-tag main character energy. π
std::experimental::simd_abi::fixed_size β std::experimental::simd_abi::fixed_size
β¨ Synopsis β¨
Defined in header <experimental/simd>
template< int N > (parallelism TS v2)
struct fixed_size {};
The simd_abi::fixed_size<N> tag type ensures data-parallel types to store and manipulate N elements (i.e. simd<T, simd_abi::fixed_size<N>>::size() returns N). An implementation shall support at least all N β [1, 32]. Additionally, for every supported simd<T, Abi>, where Abi is an implementation-defined ABI tag, N = simd<T, Abi>::size() shall be supported. π
π¦ Notes π¦
An implementation may choose to forego ABI compatibility between differently compiled translation units for simd and simd_mask instantiations using the same simd_abi::fixed_size<N> tag. Otherwise, the efficiency of simd<T, Abi> is likely to be better than simd<T, fixed_size<simd_size_v<T, Abi>>> (with Abi not an instance of simd_abi::fixed_size). π
Likeβ¦ noted, bestie. ABI vibes check out. π«Ά
π Example π
This section is incomplete π
Reason: no example
πΈ See also πΈ
max_fixed_sizeβ the maximum number of elements guaranteed to be supported by fixed;(parallelism TS v2)(constant)scalarβ tag type for storing a single element;(parallelism TS v2)(typedef)compatibleβ tag type that ensures ABI compatibility;(parallelism TS v2)(alias template)nativeβ tag type that is most efficient;(parallelism TS v2)(alias template)deduce,deduce_tβ obtains an ABI type for given element type and number of elements;(parallelism TS v2)(class template)
π Category π
- Todo no example
π sourced from http://cppreference.com, version 2024.06.10 β bye bestie, you ate! π
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms