A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/language/../memory/uninitialized_move_n.html below:

std::uninitialized_move_n - cppreference.com

template< class InputIt, class Size, class NoThrowForwardIt >

std::pair<InputIt, NoThrowForwardIt>
    uninitialized_move_n( InputIt first, Size count,

                          NoThrowForwardIt d_first );
(1) (since C++17)
(constexpr since C++26) template< class ExecutionPolicy,

          class ForwardIt, class Size, class NoThrowForwardIt >
std::pair<ForwardIt, NoThrowForwardIt>
    uninitialized_move_n( ExecutionPolicy&& policy, ForwardIt first,

                          Size count, NoThrowForwardIt d_first );
(2) (since C++17) 1)

Copies the elements from

first + [​0​count)

(using move semantics if supported) to an uninitialized memory area beginning at

d_first

as if by

for (; count > 0; ++d_first, (void) ++first, --count)
    ::new (voidify(*d_first))
        typename std::iterator_traits<NoThrowForwardIt>::value_type(/* value */);
return {first, d_first};

where /* value */ is std::move(*first) if *first is of an lvalue reference type, or *first otherwise.

If an exception is thrown during the initialization, some objects in first + [​0​count) 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 participates in overload resolution only if all following conditions are satisfied:

If d_first + [​0​count) overlaps with first + [​0​count), the behavior is undefined.

(since C++20) [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 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

As described above.

[edit] Complexity

Linear in count.

[edit] Exceptions

The overload with a template parameter named ExecutionPolicy reports errors as follows:

[edit] Notes

When the input iterator deferences to an rvalue, the behavior of std::uninitialized_move_n is same as std::uninitialized_copy_n.

[edit] Possible implementation
template<class InputIt, class Size, class NoThrowForwardIt>
constexpr std::pair<InputIt, NoThrowForwardIt>
    uninitialized_move_n(InputIt first, Size count, NoThrowForwardIt d_first)
{
    using ValueType = typename std::iterator_traits<NoThrowForwardIt>::value_type;
    NoThrowForwardIt current = d_first;
    try
    {
        for (; count > 0; ++first, (void) ++current, --count) {
            auto addr = static_cast<void*>(std::addressof(*current));
            if constexpr (std::is_lvalue_reference_v<decltype(*first)>)
                ::new (addr) ValueType(std::move(*first));
            else
                ::new (addr) ValueType(*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] 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 LWG 3918 C++17 additional temporary materialization was required
when the input iterator deferences to a prvalue copies the element in this case [edit] See also

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4