std::ranges::generate_n
Min standard notice:
Header: <algorithm>
Assigns the result of successive invocations of the function object gen to each element in the range [first,first + n), if 0 < n. Does nothing otherwise.
# Declarations
Call signature
template< std::input_or_output_iterator O, std::copy_constructible F >
requires std::invocable<F&> && std::indirectly_writable<O, std::invoke_result_t<F&>>
constexpr O
generate_n( O first, std::iter_difference_t<O> n, F gen );
(since C++20)
# Parameters
first: the beginning of the range of elements to modifyn: number of elements to modifygen: the generator function object.
# Return value
Iterator one past the last element assigned if 0 < count, first otherwise.
# Example
#include <algorithm>
#include <array>
#include <iostream>
#include <random>
#include <string_view>
auto dice()
{
static std::uniform_int_distribution<int> distr {1, 6};
static std::random_device engine;
static std::mt19937 noise {engine()};
return distr(noise);
}
void print(const auto& v, std::string_view comment)
{
for (int i : v)
std::cout << i << ' ';
std::cout << '(' << comment << ")\n";
}
int main()
{
std::array<int, 8> v;
std::ranges::generate_n(v.begin(), v.size(), dice);
print(v, "dice");
std::ranges::generate_n(v.begin(), v.size(), [n {0}] mutable { return n++; });
// same effect as std::iota(v.begin(), v.end(), 0);
print(v, "iota");
}