std::ranges::uninitialized_value_construct_n
Min standard notice:
Header: <memory>
Constructs objects of type std::iter_value_t in the uninitialized memory area first+[0,count) by value-initialization, as if by return ranges::uninitialized_value_construct(std::counted_iterator(first, count),std::default_sentinel).base();
# Declarations
Call signature
template< no-throw-forward-iterator I >
requires std::default_initializable<std::iter_value_t<I>>
I uninitialized_value_construct_n( I first,
std::iter_difference_t<I> count );
(since C++20) (constexpr since C++26)
# Parameters
first: the beginning of the range of elements to initializecount: the number of elements to construct
# Return value
As described above.
# Notes
An implementation may improve the efficiency of the ranges::uninitialized_value_construct_n, e.g. by using ranges::fill_n, if the value type of the range is a CopyAssignable TrivialType.
# Example
#include <iostream>
#include <memory>
#include <string>
int main()
{
struct S { std::string m{"█▓▒░ █▓▒░ █▓▒░ "}; };
constexpr int n{4};
alignas(alignof(S)) char out[n * sizeof(S)];
try
{
auto first{reinterpret_cast<S*>(out)};
auto last = std::ranges::uninitialized_value_construct_n(first, n);
auto count{1};
for (auto it{first}; it != last; ++it)
std::cout << count++ << ' ' << it->m << '\n';
std::ranges::destroy(first, last);
}
catch (...)
{
std::cout << "Exception!\n";
}
// For scalar types, uninitialized_value_construct_n
// zero-initializes the given uninitialized memory area.
int v[]{1, 2, 3, 4, 5, 6, 7, 8};
std::cout << ' ';
for (const int i : v)
std::cout << i << ' ';
std::cout << "\n ";
std::ranges::uninitialized_value_construct_n(std::begin(v), std::size(v));
for (const int i : v)
std::cout << i << ' ';
std::cout << '\n';
}
# Defect reports
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 3870 | C++20 | this algorithm might create objects on a const storage | kept disallowed |