From cppreference.com
Defined in header
Call signature
template</*nothrow-forward-iterator*/I,/*nothrow-sentinel-for*/<I>S,classT>requiresstd::constructible_from<std::iter_value_t<I>,constT&>Iuninitialized_fill(Ifirst,Slast,constT&value); (1)(since C++20)
(constexpr since C++26)template</*nothrow-forward-range*/R,classT>requiresstd::constructible_from<ranges::range_value_t<R>,constT&>ranges::borrowed_iterator_t<R>uninitialized_fill(R&&r,constT&value); (2)(since C++20)
(constexpr since C++26)template</*execution-policy*/Ep,/*nothrow-random-access-iterator*/I,/*nothrow-sized-sentinel-for*/<I>S,classT=std::iter_value_t<I>>requiresconstructible_from<std::iter_value_t<I>,constT&>Iuninitialized_fill(Ep&&policy,Ifirst,Slast,constT&value); (3) (since C++26)template</*execution-policy*/Ep,/*nothrow-sized-random-access-range*/R,classT=ranges::range_value_t<R>>requiresstd::constructible_from<ranges::range_value_t<R>,constT&>ranges::borrowed_iterator_t<R>uninitialized_fill(Ep&&policy,R&&r,constT&value); (4) (since C++26)For the definition of /*execution-policy*/, see
; for the definition of other exposition-only concepts, see
.
1) Constructs elements in the destination range [first, last) with the given value value as if by
for(;first!=last;++first)
::new(
(*first))std::remove_reference_t<std::iter_reference_t<I>>(value);
returnfirst;
If an exception is thrown during the initialization, the objects already constructed are destroyed in an unspecified order.
2) Same as (1), but uses r as the destination range.
3,4) Same as (1,2), but executed according to policy.
The function-like entities described on this page are
(informally known as niebloids), that is:
Explicit template argument lists cannot be specified when calling any of them.
None of them are visible to
.
When any of them are found by
as the name to the left of the function-call operator,
is inhibited.
Parameters
first, last - the iterator-sentinel pair defining the
of elements to initialize r - the
of the elements to initialize value - the value to construct the elements with policy - the
to use Return value
As described above.
Exceptions
Any exception thrown on construction of the elements in the destination range.
3,4) During the execution process:
If the temporary memory resources required for parallelization are not available,
is thrown.
If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for
,
is invoked).
Notes
An implementation may improve the efficiency of the ranges::uninitialized_fill (by using e.g.
) if the value type of the output range is
.
macro ValueStdFeature
(C++26)Parallel range algorithms
__cpp_lib_raw_memory_algorithms
(C++26)constexpr for
specialized <memory> algorithms
, (
)Possible implementation
structuninitialized_fill_fn{template</*nothrow-forward-iterator*/I,/*nothrow-sentinel-for*/<I>S,classT>requiresstd::constructible_from<std::iter_value_t<I>,constT&>constexprIoperator()(Ifirst,Slast,constT&value)const{Irollback{first};try{for(;!(first==last);++first)ranges::construct_at(std::addressof(*first),value);returnfirst;}catch(...){// rollback: destroy constructed elementsfor(;rollback!=first;++rollback)ranges::destroy_at(std::addressof(*rollback));throw;}}template</*nothrow-forward-range*/R,classT>requiresstd::constructible_from<ranges::range_value_t<R>,constT&>constexprranges::borrowed_iterator_t<R>operator()(R&&r,constT&value)const{return(*this)(ranges::begin(r),ranges::next(ranges::begin(r),ranges::end(r)),value);}};inlineconstexpruninitialized_fill_fnuninitialized_fill{};Example
Run this code
#include<iostream>#include<memory>#include<string>intmain(){constexprintn{4};alignas(alignof(std::string))charout[n*sizeof(std::string)];try{autofirst{reinterpret_cast<std::string*>(out)};autolast{first+n};std::ranges::uninitialized_fill(first,last,"▄▀▄▀▄▀▄▀");intcount{1};for(autoit{first};it!=last;++it)std::cout<<count++<<' '<<*it<<'\n';std::ranges::destroy(first,last);}catch(...){std::cout<<"Exception!\n";}}Output:
1 ▄▀▄▀▄▀▄▀ 2 ▄▀▄▀▄▀▄▀ 3 ▄▀▄▀▄▀▄▀ 4 ▄▀▄▀▄▀▄▀ See also