std::uninitialized_move_n
| Defined in header <memory>
|
||
| template< class InputIt, class Size, class NoThrowForwardIt > std::pair<InputIt, NoThrowForwardIt> |
(1) | (since C++17) |
| template< class ExecutionPolicy, class ForwardIt, class Size, class NoThrowForwardIt > std::pair<ForwardIt, NoThrowForwardIt> |
(2) | (since C++17) |
count elements from a range beginning at first to an uninitialized memory area beginning at d_first as if by
for ( ; n > 0; ++d_first, (void) ++first, --n) ::new (/*VOIDIFY*/(*d_first)) typename std::iterator_traits<NoThrowForwardIt>::value_type(std::move(*first));
where /*VOIDIFY*/(e) is:
|
(until C++20) |
|
(since C++20) |
policy. This overload does not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> (until C++20) std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> (since C++20) is true.Contents |
[edit] Parameters
| first | - | the beginning of the range of the elements to move |
| d_first | - | the beginning of the destination range |
| count | - | the number of elements to move |
| policy | - | the execution policy to use. See execution policy for details. |
| Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
-ForwardIt must meet the requirements of LegacyForwardIterator.
| ||
-NoThrowForwardIt must meet the requirements of LegacyForwardIterator.
| ||
-No increment, assignment, comparison, or indirection through valid instances of NoThrowForwardIt may throw exceptions.
| ||
[edit] Return value
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.
[edit] Complexity
Linear in count.
[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
ExecutionPolicyis 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] Possible implementation
template<class InputIt, class Size, class NoThrowForwardIt> std::pair<InputIt, NoThrowForwardIt> uninitialized_move_n(InputIt first, Size count, NoThrowForwardIt d_first) { using Value = typename std::iterator_traits<NoThrowForwardIt>::value_type; NoThrowForwardIt current = d_first; try { for (; count > 0; ++first, (void) ++current, --count) { ::new (const_cast<void*>(static_cast<const volatile void*>( std::addressof(*current)))) Value(std::move(*first)); } } catch (...) { std::destroy(d_first, current); throw; } return {first, current}; } |
[edit] Example
#include <cstdlib> #include <iomanip> #include <iostream> #include <memory> #include <string> void print(auto rem, auto first, auto last) { for (std::cout << rem; first != last; ++first) std::cout << std::quoted(*first) << ' '; std::cout << '\n'; } int main() { std::string in[] { "One", "Definition", "Rule" }; print("initially, in: ", std::begin(in), std::end(in)); if ( constexpr auto sz = std::size(in); void* out = std::aligned_alloc(alignof(std::string), sizeof(std::string) * sz) ) { try { auto first {static_cast<std::string*>(out)}; auto last {first + sz}; std::uninitialized_move_n(std::begin(in), sz, first); print("after move, in: ", std::begin(in), std::end(in)); print("after move, out: ", first, last); std::destroy(first, last); } catch (...) { std::cout << "Exception!\n"; } std::free(out); } }
Possible output:
initially, in: "One" "Definition" "Rule" after move, in: "" "" "" after move, out: "One" "Definition" "Rule"
[edit] See also
| (C++17) |
moves a range of objects to an uninitialized area of memory (function template) |
| (C++11) |
copies a number of objects to an uninitialized area of memory (function template) |
| (C++20) |
moves a number of objects to an uninitialized area of memory (niebloid) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
