|
213 | 213 | }
|
214 | 214 |
|
215 | 215 | template<class NoThrowForwardIterator>
|
216 |
| - void uninitialized_value_construct(NoThrowForwardIterator first, // freestanding |
217 |
| - NoThrowForwardIterator last); |
| 216 | + constexpr void uninitialized_value_construct(NoThrowForwardIterator first, // freestanding |
| 217 | + NoThrowForwardIterator last); |
218 | 218 | template<class ExecutionPolicy, class NoThrowForwardIterator>
|
219 | 219 | void uninitialized_value_construct(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
|
220 | 220 | NoThrowForwardIterator first,
|
221 | 221 | NoThrowForwardIterator last);
|
222 | 222 | template<class NoThrowForwardIterator, class Size>
|
223 |
| - NoThrowForwardIterator |
| 223 | + constexpr NoThrowForwardIterator |
224 | 224 | uninitialized_value_construct_n(NoThrowForwardIterator first, Size n); // freestanding
|
225 | 225 | template<class ExecutionPolicy, class NoThrowForwardIterator, class Size>
|
226 | 226 | NoThrowForwardIterator
|
|
230 | 230 | namespace ranges {
|
231 | 231 | template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S>
|
232 | 232 | requires @\libconcept{default_initializable}@<iter_value_t<I>>
|
233 |
| - I uninitialized_value_construct(I first, S last); // freestanding |
| 233 | + constexpr I uninitialized_value_construct(I first, S last); // freestanding |
234 | 234 | template<@\exposconcept{nothrow-forward-range}@ R>
|
235 | 235 | requires @\libconcept{default_initializable}@<range_value_t<R>>
|
236 |
| - borrowed_iterator_t<R> uninitialized_value_construct(R&& r); // freestanding |
| 236 | + constexpr borrowed_iterator_t<R> uninitialized_value_construct(R&& r); // freestanding |
237 | 237 |
|
238 | 238 | template<@\exposconcept{nothrow-forward-iterator}@ I>
|
239 | 239 | requires @\libconcept{default_initializable}@<iter_value_t<I>>
|
240 |
| - I uninitialized_value_construct_n(I first, iter_difference_t<I> n); // freestanding |
| 240 | + constexpr I uninitialized_value_construct_n(I first, // freestanding |
| 241 | + iter_difference_t<I> n); |
241 | 242 | }
|
242 | 243 |
|
243 | 244 | template<class InputIterator, class NoThrowForwardIterator>
|
244 |
| - NoThrowForwardIterator uninitialized_copy(InputIterator first, // freestanding |
245 |
| - InputIterator last, |
246 |
| - NoThrowForwardIterator result); |
| 245 | + constexpr NoThrowForwardIterator uninitialized_copy(InputIterator first, // freestanding |
| 246 | + InputIterator last, |
| 247 | + NoThrowForwardIterator result); |
247 | 248 | template<class ExecutionPolicy, class ForwardIterator, class NoThrowForwardIterator>
|
248 | 249 | NoThrowForwardIterator uninitialized_copy(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
|
249 | 250 | ForwardIterator first, ForwardIterator last,
|
250 | 251 | NoThrowForwardIterator result);
|
251 | 252 | template<class InputIterator, class Size, class NoThrowForwardIterator>
|
252 |
| - NoThrowForwardIterator uninitialized_copy_n(InputIterator first, Size n, // freestanding |
253 |
| - NoThrowForwardIterator result); |
| 253 | + constexpr NoThrowForwardIterator uninitialized_copy_n(InputIterator first, // freestanding |
| 254 | + Size n, |
| 255 | + NoThrowForwardIterator result); |
254 | 256 | template<class ExecutionPolicy, class ForwardIterator, class Size,
|
255 | 257 | class NoThrowForwardIterator>
|
256 | 258 | NoThrowForwardIterator uninitialized_copy_n(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
|
|
263 | 265 | template<@\libconcept{input_iterator}@ I, @\libconcept{sentinel_for}@<I> S1,
|
264 | 266 | @\exposconcept{nothrow-forward-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@<O> S2>
|
265 | 267 | requires @\libconcept{constructible_from}@<iter_value_t<O>, iter_reference_t<I>>
|
266 |
| - uninitialized_copy_result<I, O> |
| 268 | + constexpr uninitialized_copy_result<I, O> |
267 | 269 | uninitialized_copy(I ifirst, S1 ilast, O ofirst, S2 olast); // freestanding
|
268 | 270 | template<@\libconcept{input_range}@ IR, @\exposconcept{nothrow-forward-range}@ OR>
|
269 | 271 | requires @\libconcept{constructible_from}@<range_value_t<OR>, range_reference_t<IR>>
|
270 |
| - uninitialized_copy_result<borrowed_iterator_t<IR>, borrowed_iterator_t<OR>> |
| 272 | + constexpr uninitialized_copy_result<borrowed_iterator_t<IR>, borrowed_iterator_t<OR>> |
271 | 273 | uninitialized_copy(IR&& in_range, OR&& out_range); // freestanding
|
272 | 274 |
|
273 | 275 | template<class I, class O>
|
274 | 276 | using uninitialized_copy_n_result = in_out_result<I, O>; // freestanding
|
275 | 277 | template<@\libconcept{input_iterator}@ I, @\exposconcept{nothrow-forward-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@<O> S>
|
276 | 278 | requires @\libconcept{constructible_from}@<iter_value_t<O>, iter_reference_t<I>>
|
277 |
| - uninitialized_copy_n_result<I, O> |
| 279 | + constexpr uninitialized_copy_n_result<I, O> |
278 | 280 | uninitialized_copy_n(I ifirst, iter_difference_t<I> n, // freestanding
|
279 | 281 | O ofirst, S olast);
|
280 | 282 | }
|
281 | 283 |
|
282 | 284 | template<class InputIterator, class NoThrowForwardIterator>
|
283 |
| - NoThrowForwardIterator uninitialized_move(InputIterator first, // freestanding |
| 285 | + constexpr NoThrowForwardIterator uninitialized_move(InputIterator first, // freestanding |
284 | 286 | InputIterator last,
|
285 | 287 | NoThrowForwardIterator result);
|
286 | 288 | template<class ExecutionPolicy, class ForwardIterator, class NoThrowForwardIterator>
|
287 | 289 | NoThrowForwardIterator uninitialized_move(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
|
288 | 290 | ForwardIterator first, ForwardIterator last,
|
289 | 291 | NoThrowForwardIterator result);
|
290 | 292 | template<class InputIterator, class Size, class NoThrowForwardIterator>
|
291 |
| - pair<InputIterator, NoThrowForwardIterator> |
| 293 | + constexpr pair<InputIterator, NoThrowForwardIterator> |
292 | 294 | uninitialized_move_n(InputIterator first, Size n, // freestanding
|
293 | 295 | NoThrowForwardIterator result);
|
294 | 296 | template<class ExecutionPolicy, class ForwardIterator, class Size,
|
|
303 | 305 | template<@\libconcept{input_iterator}@ I, @\libconcept{sentinel_for}@<I> S1,
|
304 | 306 | @\exposconcept{nothrow-forward-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@<O> S2>
|
305 | 307 | requires @\libconcept{constructible_from}@<iter_value_t<O>, iter_rvalue_reference_t<I>>
|
306 |
| - uninitialized_move_result<I, O> |
| 308 | + constexpr uninitialized_move_result<I, O> |
307 | 309 | uninitialized_move(I ifirst, S1 ilast, O ofirst, S2 olast); // freestanding
|
308 | 310 | template<@\libconcept{input_range}@ IR, @\exposconcept{nothrow-forward-range}@ OR>
|
309 | 311 | requires @\libconcept{constructible_from}@<range_value_t<OR>, range_rvalue_reference_t<IR>>
|
310 |
| - uninitialized_move_result<borrowed_iterator_t<IR>, borrowed_iterator_t<OR>> |
| 312 | + constexpr uninitialized_move_result<borrowed_iterator_t<IR>, borrowed_iterator_t<OR>> |
311 | 313 | uninitialized_move(IR&& in_range, OR&& out_range); // freestanding
|
312 | 314 |
|
313 | 315 | template<class I, class O>
|
314 | 316 | using uninitialized_move_n_result = in_out_result<I, O>; // freestanding
|
315 | 317 | template<@\libconcept{input_iterator}@ I,
|
316 | 318 | @\exposconcept{nothrow-forward-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@<O> S>
|
317 | 319 | requires @\libconcept{constructible_from}@<iter_value_t<O>, iter_rvalue_reference_t<I>>
|
318 |
| - uninitialized_move_n_result<I, O> |
| 320 | + constexpr uninitialized_move_n_result<I, O> |
319 | 321 | uninitialized_move_n(I ifirst, iter_difference_t<I> n, // freestanding
|
320 | 322 | O ofirst, S olast);
|
321 | 323 | }
|
322 | 324 |
|
323 | 325 | template<class NoThrowForwardIterator, class T>
|
324 |
| - void uninitialized_fill(NoThrowForwardIterator first, // freestanding |
| 326 | + constexpr void uninitialized_fill(NoThrowForwardIterator first, // freestanding |
325 | 327 | NoThrowForwardIterator last, const T& x);
|
326 | 328 | template<class ExecutionPolicy, class NoThrowForwardIterator, class T>
|
327 | 329 | void uninitialized_fill(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
|
328 | 330 | NoThrowForwardIterator first, NoThrowForwardIterator last,
|
329 | 331 | const T& x);
|
330 | 332 | template<class NoThrowForwardIterator, class Size, class T>
|
331 |
| - NoThrowForwardIterator |
| 333 | + constexpr NoThrowForwardIterator |
332 | 334 | uninitialized_fill_n(NoThrowForwardIterator first, Size n, const T& x); // freestanding
|
333 | 335 | template<class ExecutionPolicy, class NoThrowForwardIterator, class Size, class T>
|
334 | 336 | NoThrowForwardIterator
|
|
338 | 340 | namespace ranges {
|
339 | 341 | template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S, class T>
|
340 | 342 | requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
|
341 |
| - I uninitialized_fill(I first, S last, const T& x); // freestanding |
| 343 | + constexpr I uninitialized_fill(I first, S last, const T& x); // freestanding |
342 | 344 | template<@\exposconcept{nothrow-forward-range}@ R, class T>
|
343 | 345 | requires @\libconcept{constructible_from}@<range_value_t<R>, const T&>
|
344 |
| - borrowed_iterator_t<R> uninitialized_fill(R&& r, const T& x); // freestanding |
| 346 | + constexpr borrowed_iterator_t<R> uninitialized_fill(R&& r, const T& x); // freestanding |
345 | 347 |
|
346 | 348 | template<@\exposconcept{nothrow-forward-iterator}@ I, class T>
|
347 | 349 | requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
|
348 |
| - I uninitialized_fill_n(I first, iter_difference_t<I> n, const T& x); // freestanding |
| 350 | + constexpr I uninitialized_fill_n(I first, // freestanding |
| 351 | + iter_difference_t<I> n, const T& x); |
349 | 352 | }
|
350 | 353 |
|
351 | 354 | // \ref{specialized.construct}, \tcode{construct_at}
|
|
0 commit comments