1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
hi(generate) hi(generate_n)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototype:
itemization(
itt(void generate([ExecPol,] ForwardIterator first,
ForwardIterator last, Generator generator);)
itt(void generate_n([ExecPol,] ForwardIterator first, Size n,
Generator generator);)
)
it() Description:
itemization(
it() The first prototype: all elements reached from the iterator
range rangett(first, last) are initialized by the return value of
tt(generator), which can be a function or function
object. tt(Generator::operator()) does not receive any arguments. The example
uses a well-known fact from algebra: in order to obtain the square of tt(n +
1), add tt(1 + 2 * n) to tt(n * n).
it() The second prototype: tt(n) elements starting at the element
pointed to by iterator tt(first) are initialized by the return value of
tt(generator).
)
it() Example:
verbinclude(-a examples/generate.cc)
)
|
