Namespaces
Variants
Views
Actions

std::ranges::uninitialized_value_construct_n

From cppreference.com
< cpp‎ | memory
 
 
Utilities library
General utilities
Relational operators (deprecated in C++20)
Integer comparison functions
(C++20)(C++20)(C++20)
(C++20)
Swap and type operations
(C++14)
(C++11)
(C++11)
(C++11)
(C++17)
Common vocabulary types
(C++11)
(C++17)
(C++17)
(C++17)
(C++11)
(C++17)

Elementary string conversions
(C++17)
(C++17)
Stacktrace
 
Dynamic memory management
Smart pointers
(C++11)
(C++11)
(C++11)
(until C++17)
(C++11)
Allocators
Memory resources
Uninitialized storage
Uninitialized memory algorithms
Constrained uninitialized memory algorithms
Garbage collection support
Miscellaneous
(C++20)
(C++11)
(C++11)
C Library
Low level memory management
 
Defined in header <memory>
Call signature
template <no-throw-forward-iterator I>

requires std::default_initializable<std::iter_value_t<I>>

I ranges::uninitialized_value_construct_n( I first, std::iter_difference_t<I> n );
(1) (since C++20)

Constructs n objects of type std::iter_value_t<I> in the uninitialized memory area starting at first by value-initialization, as if by

for (; n-- > 0; ++first)
  ::new (/*VOIDIFY*/(*first))
      std::remove_reference_t<std::iter_reference_t<I>>();

where /*VOIDIFY*/(e) is: const_cast<void*>(static_cast<const volatile void*>(std::addressof(e))).

If an exception is thrown during the initialization, the objects already constructed are destroyed in an unspecified order.

The function-like entities described on this page are niebloids, that is:

In practice, they may be implemented as function objects, or with special compiler extensions.

Contents

[edit] Parameters

first - the beginning of the range of elements to initialize
n - the number of elements to construct.

[edit] Return value

An iterator equal to ranges::next(first, n) that points to one past the last element of the range of constructed objects.

[edit] Complexity

Linear in n.

[edit] Notes

An implementation may improve the efficiency of the ranges::uninitialized_value_construct_n by using ranges::fill_n if the value type of the range is TrivialType and CopyAssignable.

[edit] Possible implementation

struct uninitialized_value_construct_n_fn {
    template <no-throw-forward-iterator I>
    requires std::default_initializable<std::iter_value_t<I>>
    I operator()( I first, std::iter_difference_t<I> n ) const {
        using T = std::remove_reference_t<std::iter_reference_t<I>>;
        if constexpr (std::is_trivial_v<T> && std::is_copy_assignable_v<T>)
            return ranges::fill_n(first, n, T());
        I rollback {first};
        try {
            for (; n-- > 0; ++first)
                ::new (const_cast<void*>(static_cast<const volatile void*>
                        (std::addressof(*first)))) T();
            return first;
        } catch (...) { // rollback: destroy constructed elements
            for (; rollback != first; ++rollback)
                ranges::destroy_at(std::addressof(*rollback));
            throw;
        }
    }
};
 
inline constexpr uninitialized_value_construct_n_fn uninitialized_value_construct_n{};

[edit] 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";
    }
 
    // Notice that for "trivial types" the 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';
}

Output:

1 █▓▒░ █▓▒░ █▓▒░ 
2 █▓▒░ █▓▒░ █▓▒░ 
3 █▓▒░ █▓▒░ █▓▒░ 
4 █▓▒░ █▓▒░ █▓▒░
1 2 3 4 5 6 7 8
0 0 0 0 0 0 0 0

[edit] See also

constructs objects by value-initialization in an uninitialized area of memory, defined by a range
(niebloid) [edit]
constructs objects by default-initialization in an uninitialized area of memory, defined by a range
(niebloid) [edit]
constructs objects by default-initialization in an uninitialized area of memory, defined by a start and count
(niebloid) [edit]
constructs objects by value-initialization in an uninitialized area of memory, defined by a start and a count
(function template) [edit]