std::uninitialized_value_construct - cppreference.com (original) (raw)
If an exception is thrown during the initialization, the objects already constructed are destroyed in an unspecified order.
- Same as (1), but executed according to policy.
This overload participates in overload resolution only if all following conditions are satisfied:
Contents
- 1 Parameters
- 2 Complexity
- 3 Exceptions
- 4 Notes
- 5 Possible implementation
- 6 Example
- 7 Defect reports
- 8 See also
[edit] Parameters
first, last | - | the pair of iterators defining the range of elements to initialize |
---|---|---|
policy | - | the execution policy to use |
Type requirements | ||
-NoThrowForwardIt must meet the requirements of LegacyForwardIterator. | ||
-No increment, assignment, comparison, or indirection through valid instances of NoThrowForwardIt may throw exceptions. |
[edit] Complexity
Linear in the distance between first and last.
[edit] Exceptions
The overload with a template parameter named ExecutionPolicy
reports errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicy
is one of the standard policies, std::terminate is called. For any otherExecutionPolicy
, the behavior is implementation-defined. - If the algorithm fails to allocate memory, std::bad_alloc is thrown.
[edit] Notes
Feature-test macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_raw_memory_algorithms | 202411L | (C++26) | constexpr for specialized memory algorithms, (1) |
[edit] Possible implementation
template constexpr void uninitialized_value_construct(NoThrowForwardIt first, NoThrowForwardIt last) { using Value = typename std::iterator_traits::value_type; NoThrowForwardIt current = first; try { for (; current != last; ++current) { ::new (static_cast<void*>(std::addressof(*current))) Value(); } } catch (...) { std::destroy(first, current); throw; } }
[edit] Example
#include #include #include int main() { struct S { std::string m{"Default value"}; }; constexpr int n{3}; alignas(alignof(S)) unsigned char mem[n * sizeof(S)]; try { auto first{reinterpret_cast<S*>(mem)}; auto last{first + n}; std::uninitialized_value_construct(first, last); for (auto it{first}; it != last; ++it) std::cout << it->m << '\n'; std::destroy(first, last); } catch (...) { std::cout << "Exception!\n"; } // For scalar types, uninitialized_value_construct // zero-fills the given uninitialized memory area. int v[]{1, 2, 3, 4}; for (const int i : v) std::cout << i << ' '; std::cout << '\n'; std::uninitialized_value_construct(std::begin(v), std::end(v)); for (const int i : v) std::cout << i << ' '; std::cout << '\n'; }
Output:
Default value Default value Default value 1 2 3 4 0 0 0 0
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 3870 | C++20 | this algorithm might create objects on a const storage | kept disallowed |