Namespaces
Variants
Views
Actions

std::ranges::uninitialized_move_n, std::ranges::uninitialized_move_n_result

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)
(C++23)
Allocators
Memory resources
Uninitialized storage
Uninitialized memory algorithms
Constrained uninitialized memory algorithms
Garbage collection support
(C++11)(until C++23)
(C++11)(until C++23)
(C++11)(until C++23)
(C++11)(until C++23)
(C++11)(until C++23)
(C++11)(until C++23)
Miscellaneous
(C++20)
(C++11)
(C++11)
C Library
Low level memory management
 
Defined in header <memory>
Call signature
template <std::input_iterator I, no-throw-forward-iterator O,

         no-throw-sentinel-for<O> S>
requires std::constructible_from<std::iter_value_t<O>,
         std::iter_rvalue_reference_t<I>>
uninitialized_move_n_result<I, O>

uninitialized_move_n( I ifirst, std::iter_difference_t<I> n, O ofirst, S olast );
(1) (since C++20)
Helper types
template<class I, class O>
using uninitialized_move_n_result = ranges::in_out_result<I, O>;
(2) (since C++20)

Moves N elements from the input range beginning at ifirst to the uninitialized storage designated by the range [ofirst, olast), where N is min(n, ranges::distance(ofirst, olast)).

The effect is equivalent to:

for (; n-- > 0 && ofirst != olast; ++ifirst, ++ofirst)
    ::new (const_cast<void*>(static_cast<const volatile void*>(std::addressof(*first))))
        std::remove_reference_t<std::iter_reference_t<O>>(ranges::iter_move(ifirst));

If an exception is thrown during the initialization then the objects that already constructed in [ofirst, olast) are destroyed in an unspecified order. Also, the objects in the input range beginning at ifirst, that were already moved, are left in a valid but unspecified state.

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

ifirst - the beginning of the input range of elements to move from
ofirst, olast - the output range
n - the number of elements to move.

[edit] Return value

An object equal to {ifirst + N, ofirst + N}.

[edit] Complexity

Linear in the N.

[edit] Notes

An implementation may improve the efficiency of the ranges::uninitialized_move_n by using ranges::copy_n if the value type of the output range is TrivialType.

[edit] Possible implementation

struct uninitialized_move_n_fn {
    template <std::input_iterator I, no-throw-forward-iterator O,
             no-throw-sentinel-for<O> S>
    requires std::constructible_from<std::iter_value_t<O>,
             std::iter_rvalue_reference_t<I>>
    ranges::uninitialized_move_n_result<I, O>
    operator()( I ifirst, std::iter_difference_t<I> n, O ofirst, S olast ) const {
        O current {ofirst};
        try {
            for (; n-- > 0 && current != olast; ++ifirst, ++current)
                ::new (const_cast<void*>(static_cast<const volatile void*>
                    (std::addressof(*current)))) std::remove_reference_t<
                        std::iter_reference_t<O>>(ranges::iter_move(ifirst));
            return {std::move(ifirst), std::move(current)};
        } catch (...) { // rollback: destroy constructed elements
            for (; ofirst != current; ++ofirst)
                ranges::destroy_at(std::addressof(*ofirst));
            throw;
        }
    }
};
 
inline constexpr uninitialized_move_n_fn uninitialized_move_n{};

[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[] { "No", "Diagnostic", "Required", };
    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::ranges::uninitialized_move_n(std::begin(in), sz, first, last);
 
            print("after move, in: ", std::begin(in), std::end(in));
            print("after move, out: ", first, last);
 
            std::ranges::destroy(first, last);
        }
        catch (...) {
            std::cout << "Exception!\n";
        }
        std::free(out);
    }
}

Possible output:

initially, in: "No" "Diagnostic" "Required"
after move, in: "" "" ""
after move, out: "No" "Diagnostic" "Required"

[edit] See also

moves a range of objects to an uninitialized area of memory
(niebloid) [edit]
moves a number of objects to an uninitialized area of memory
(function template) [edit]