|
3238 | 3238 | \requires \tcode{(is_same_v<T, U> \&\& ...)} is \tcode{true}. Otherwise the program is ill-formed.
|
3239 | 3239 | \end{itemdescr}
|
3240 | 3240 |
|
3241 |
| -\rSec3[array.special]{\tcode{array} specialized algorithms} |
3242 |
| - |
3243 |
| -\indexlibrarymember{array}{swap}% |
3244 |
| -\begin{itemdecl} |
3245 |
| -template <class T, size_t N> |
3246 |
| - void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y))); |
3247 |
| -\end{itemdecl} |
3248 |
| - |
3249 |
| -\begin{itemdescr} |
3250 |
| -\pnum\remarks |
3251 |
| -This function shall not participate in overload resolution |
3252 |
| -unless \tcode{N == 0} or \tcode{is_swappable_v<T>} is \tcode{true}. |
3253 |
| - |
3254 |
| -\pnum\effects |
3255 |
| -As if by \tcode{x.swap(y)}. |
3256 |
| - |
3257 |
| -\pnum |
3258 |
| -\complexity Linear in \tcode{N}. |
3259 |
| -\end{itemdescr} |
3260 |
| - |
3261 |
| -\rSec3[array.size]{\tcode{array::size}} |
| 3241 | +\rSec3[array.members]{\tcode{array} member functions} |
3262 | 3242 |
|
3263 | 3243 | \indexlibrarymember{array}{size}%
|
3264 | 3244 | \begin{itemdecl}
|
|
3269 | 3249 | \pnum\returns \tcode{N}.
|
3270 | 3250 | \end{itemdescr}
|
3271 | 3251 |
|
3272 |
| -\rSec3[array.data]{\tcode{array::data}} |
3273 | 3252 | \indexlibrarymember{array}{data}%
|
3274 | 3253 | \begin{itemdecl}
|
3275 | 3254 | constexpr T* data() noexcept;
|
|
3282 | 3261 | and \range{data()}{data() + size()} is a valid range.
|
3283 | 3262 | \end{itemdescr}
|
3284 | 3263 |
|
3285 |
| -\rSec3[array.fill]{\tcode{array::fill}} |
3286 |
| - |
3287 | 3264 | \indexlibrarymember{array}{fill}%
|
3288 | 3265 | \begin{itemdecl}
|
3289 | 3266 | void fill(const T& u);
|
|
3294 | 3271 | \effects As if by \tcode{fill_n(begin(), N, u)}.
|
3295 | 3272 | \end{itemdescr}
|
3296 | 3273 |
|
3297 |
| -\rSec3[array.swap]{\tcode{array::swap}} |
3298 |
| - |
3299 | 3274 | \indexlibrarymember{array}{swap}%
|
3300 | 3275 | \begin{itemdecl}
|
3301 | 3276 | void swap(array& y) noexcept(is_nothrow_swappable_v<T>);
|
|
3313 | 3288 | \end{note}
|
3314 | 3289 | \end{itemdescr}
|
3315 | 3290 |
|
| 3291 | +\rSec3[array.special]{\tcode{array} specialized algorithms} |
| 3292 | + |
| 3293 | +\indexlibrarymember{array}{swap}% |
| 3294 | +\begin{itemdecl} |
| 3295 | +template <class T, size_t N> |
| 3296 | + void swap(array<T, N>& x, array<T, N>& y) noexcept(noexcept(x.swap(y))); |
| 3297 | +\end{itemdecl} |
| 3298 | + |
| 3299 | +\begin{itemdescr} |
| 3300 | +\pnum\remarks |
| 3301 | +This function shall not participate in overload resolution |
| 3302 | +unless \tcode{N == 0} or \tcode{is_swappable_v<T>} is \tcode{true}. |
| 3303 | + |
| 3304 | +\pnum\effects |
| 3305 | +As if by \tcode{x.swap(y)}. |
| 3306 | + |
| 3307 | +\pnum |
| 3308 | +\complexity Linear in \tcode{N}. |
| 3309 | +\end{itemdescr} |
| 3310 | + |
3316 | 3311 | \rSec3[array.zero]{Zero sized arrays}
|
3317 | 3312 |
|
3318 | 3313 | \indextext{\idxcode{array}!zero sized}%
|
|
0 commit comments