|
|
Defined in header <memory> | ||
template<class NoThrowForwardIt,class T> void uninitialized_fill( NoThrowForwardIt first, | (1) | (constexpr since C++26) |
template<class ExecutionPolicy,class NoThrowForwardIt,class T> void uninitialized_fill( ExecutionPolicy&& policy, | (2) | (since C++17) |
[
first,
last)
as if byfor(; first!= last;++first)
::new(voidify
(*first))
typenamestd::iterator_traits<NoThrowForwardIt>::value_type(value);
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, last | - | the pair of iterators defining therange of elements to initialize |
value | - | the value to construct the elements with |
policy | - | theexecution policy to use |
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) |
Linear in the distance betweenfirst andlast.
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 T>constexprvoid uninitialized_fill(NoThrowForwardIt first, NoThrowForwardIt last,const T& value){using V=typenamestd::iterator_traits<NoThrowForwardIt>::value_type; NoThrowForwardIt current= first;try{for(; current!= last;++current)::new(static_cast<void*>(std::addressof(*current))) V(value);}catch(...){for(; first!= current;++first) first->~V();throw;}} |
#include <algorithm>#include <iostream>#include <memory>#include <string> int main(){conststd::size_t sz=4;std::allocator<std::string> alloc;std::string* p= alloc.allocate(sz); std::uninitialized_fill(p, p+ sz,"Example"); for(std::string* i= p; i!= p+ sz;++i){std::cout<<*i<<'\n'; i->~basic_string<char>();} alloc.deallocate(p, sz);}
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 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 start and a count (function template)[edit] | |
(C++20) | copies an object to an uninitialized area of memory, defined by a range (algorithm function object)[edit] |