A.2.4. Algorithms That Write Container Elements
Many algorithms write new values to the elements in the given sequence. These algorithms can be distinguished from one another both by the kinds of iterators they use to denote their input sequence and by whether they write elements in the input range or write to a given destination.
Algorithms That Write but Do Not Read Elements
These algorithms require an output iterator that denotes a destination. The _n versions take a second argument that specifies a count and write the given number of elements to the destination.
fill(beg, end, val)fill_n(dest, cnt, val)generate(beg, end, Gen)generate_n(dest, cnt, Gen)
Assigns a new value to each element in the input sequence. fill assigns the value val; ...
Get C++ Primer, Fifth Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
