std::ranges::uninitialized_move_n, std::ranges::uninitialized_move_n_result
Min standard notice:
Header: <memory>
Let (\scriptsize N)N be ranges::min(count, ranges::distance(ofirst, olast)).
# Declarations
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> count,
O ofirst, S olast );
(since C++20) (constexpr since C++26)
Helper types
template< class I, class O >
using uninitialized_move_n_result = ranges::in_out_result<I, O>;
(since C++20)
# Parameters
ifirst: the beginning of the input range of elements to move fromofirst, olast: iterator-sentinel pair denoting the output range of elements to initializen: the number of elements to move
# Return value
As described above.
# Notes
An implementation may improve the efficiency of the ranges::uninitialized_move_n, e.g. by using ranges::copy_n, if the value type of the output range is TrivialType.
# 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);
}
}
# Defect reports
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 3870 | C++20 | this algorithm might create objects on a const storage | kept disallowed |