std::uninitialized_move_n (3) - Linux Man Pages
Defined in header <memory>
template< class InputIt, class Size, class ForwardIt >
std::pair<InputIt, ForwardIt> uninitialized_move_n( InputIt first, Size count, (1) (since C++17)
ForwardIt d_first );
template< class ExecutionPolicy, class InputIt, class Size, class ForwardIt >
std::pair<InputIt, ForwardIt> uninitialized_move_n( ExecutionPolicy&& policy, (2) (since C++17)
InputIt first, Size count,
ForwardIt d_first );
1) Moves count elements from a range beginning at first to an uninitialized memory area beginning at d_first as if by
If an exception is thrown during the initialization, some objects in the source range are left in a valid but unspecified state, and the objects already constructed are destroyed in an unspecified order.
2) Same as (1), but executed according to policy. This overload does not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true
InputIt must meet the requirements of LegacyInputIterator.
ForwardIt must meet the requirements of LegacyForwardIterator.
No increment, assignment, comparison, or indirection through valid instances of ForwardIt may throw exceptions.
A pair whose first element is an iterator to the element past the last element moved in the source range, and whose second element is an iterator to the element past the last element moved in the destination range.
Linear in count.
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 other ExecutionPolicy, the behavior is implementation-defined.
* If the algorithm fails to allocate memory, std::bad_alloc is thrown.
This section is incomplete
Reason: no example
uninitialized_move moves a range of objects to an uninitialized area of memory
uninitialized_copy_n copies a number of objects to an uninitialized area of memory