[edit]Parameters

[edit]Complexity

Exactlystd::distance(first, last) invocations ofg() and assignments.

[edit]Exceptions

The overload with a template parameter namedExecutionPolicy reports errors as follows:

• If execution of a function invoked as part of the algorithm throws an exception andExecutionPolicy is one of thestandard 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 ForwardIt,class Generator>constexpr//< since C++20void generate(ForwardIt first, ForwardIt last, Generator g){for(; first!= last;++first)*first= g();}

[edit]Example

#include <algorithm>#include <iostream>#include <vector> void println(std::string_view fmt,constauto& v){for(std::cout<< fmt;constauto& e: v)std::cout<< e<<' ';std::cout<<'\n';};  int f(){staticint i;return++i;} int main(){std::vector<int> v(5);     std::generate(v.begin(), v.end(), f);    println("v: ", v); // Initialize with default values 0,1,2,3,4 from a lambda function// Equivalent to std::iota(v.begin(), v.end(), 0);    std::generate(v.begin(), v.end(),[n=0]() mutable{return n++;});    println("v: ", v);}

v: 1 2 3 4 5v: 0 1 2 3 4

[edit]See also

• In other languages

• Deutsch
• Español
• Français
• Italiano
• 日本語
• Português
• Русский
• 中文