std::generate

 

C++

语言

概念

实用工具库

字符串库

集装箱库

算法库

迭代器库

Numerics库

输入/输出库

本地化库

正则表达式库 （C++11）

原子操作库 （C++11）

线程的支持库 （C++11）

 

算法库

功能 Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
修改序列操作 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of （C++11） （C++11） （C++11） for_each count count_if mismatch equal	find find_if find_if_not （C++11） find_end find_first_of adjacent_find search search_n
修改序列操作 Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if （C++11） copy_n （C++11） copy_backward move （C++11） move_backward （C++11） fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   （C++11） unique unique_copy
分区操作 Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned （C++11） partition partition_copy （C++11）	stable_partition partition_point （C++11）
排序操作（排序的区间） Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted （C++11） is_sorted_until （C++11） sort	partial_sort partial_sort_copy stable_sort nth_element
二进制搜索操作（排序的区间） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
设置操作（排序的区间） Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
堆的操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until （C++11） make_heap	push_heap pop_heap sort_heap
最小/最大操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax （C++11） minmax_element （C++11）	lexicographical_compare is_permutation （C++11） next_permutation prev_permutation
数字操作 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota （C++11） accumulate inner_product	adjacent_difference partial_sum
C库 Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template< class ForwardIt, class Generator > void generate( ForwardIt first, ForwardIt last, Generator g );

分配范围[first, last)生成的值给定的函数对象中的每个元素g

Original:

Assigns each element in range [first, last) a value generated by the given function object g.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

参数

first, last	-	的范围内的元素来生成 Original: the range of elements to generate The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
g	-	generator function object that will be called. The signature of the function should be equivalent to the following: Ret fun(); The type  Ret must be such that an object of type ForwardIt can be dereferenced and assigned a value of type  Ret. ​
Type requirements
- ForwardIt must meet the requirements of ForwardIterator.

返回值

（无）

Original:

(none)

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

复杂性

究竟std::distance(first, last)g()和任务的调用.

Original:

Exactly std::distance(first, last) invocations of g() and assignments.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

可能的实现

template<class ForwardIt, class Generator> void generate(ForwardIt first, ForwardIt last, Generator g) { while (first != last) { *first++ = g(); } }

为例

下面的代码使用填补了矢量随机数

Original:

The following code uses fills a vector with random numbers:

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

#include <algorithm>
#include <iostream>
#include <cstdlib>
 
int main()
{
    std::vector<int> v(5);
    std::generate(v.begin(), v.end(), std::rand); // Using the C function rand()
 
    std::cout << "v: ";
    for (auto iv: v) {
        std::cout << iv << " ";
    }
    std::cout << "\n";
}

Output:

v: 52894 15984720 41513563 41346135 51451456

另请参阅

fill	分配一个一定值范围内的元素 Original: assigns a range of elements a certain value The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板）
generate_n	保存N个应用程序的一个函数的结果 Original: saves the result of N applications of a function The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板）