|
|
Defined in header <memory> | ||
template<class NoThrowForwardIt,class Size,class T> NoThrowForwardIt uninitialized_fill_n( NoThrowForwardIt first, | (1) | (constexpr since C++26) |
template<class ExecutionPolicy, class NoThrowForwardIt,class Size,class T> | (2) | (since C++17) |
+
[
0,
count)
as if byfor(; count--;++first)
::new(voidify
(*first))
typenamestd::iterator_traits<NoThrowForwardIt>::value_type(value);
return first;
std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> istrue. | (until C++20) |
std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> istrue. | (since C++20) |
Contents |
first | - | the beginning of the range of the elements to initialize |
count | - | number of elements to construct |
value | - | the value to construct the elements with |
Type requirements | ||
-NoThrowForwardIt must meet the requirements ofLegacyForwardIterator. | ||
-No increment, assignment, comparison, or indirection through valid instances ofNoThrowForwardIt may throw exceptions. Applying&* to aNoThrowForwardIt value must yield a pointer to its value type.(until C++11) |
As described above.
Linear incount.
The overload with a template parameter namedExecutionPolicy
reports errors as follows:
ExecutionPolicy
is one of thestandard policies,std::terminate is called. For any otherExecutionPolicy
, the behavior is implementation-defined.Feature-test macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_raw_memory_algorithms | 202411L | (C++26) | constexpr forspecialized memory algorithms,(1) |
template<class NoThrowForwardIt,class Size,class T>constexpr NoThrowForwardIt uninitialized_fill_n(NoThrowForwardIt first, Size count,const T& value){using V=typenamestd::iterator_traits<NoThrowForwardIt>::value_type; NoThrowForwardIt current= first;try{for(; count>0;++current,(void)--count)::new(static_cast<void*>(std::addressof(*current))) V(value);return current;}catch(...){for(; first!= current;++first) first->~V();throw;}return current;} |
#include <algorithm>#include <iostream>#include <memory>#include <string>#include <tuple> int main(){std::string* p;std::size_t sz;std::tie(p, sz)=std::get_temporary_buffer<std::string>(4); std::uninitialized_fill_n(p, sz,"Example"); for(std::string* i= p; i!= p+ sz;++i){std::cout<<*i<<'\n'; i->~basic_string<char>();}std::return_temporary_buffer(p);}
Output:
ExampleExampleExampleExample
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 866 | C++98 | givenT as the value type ofNoThrowForwardIt , ifT::operator new exists, the program might be ill-formed | uses global placementnew instead |
LWG 1339 | C++98 | the location of the first element following the filling range was not returned | returned |
LWG 2433 | C++11 | this algorithm might be hijacked by overloadedoperator& | usesstd::addressof |
LWG 3870 | C++20 | this algorithm might create objects on aconst storage | kept disallowed |
copies an object to an uninitialized area of memory, defined by a range (function template)[edit] | |
(C++20) | copies an object to an uninitialized area of memory, defined by a start and a count (algorithm function object)[edit] |