24.4.1 Initialization Algorithms - fill
- Two algorithms to fill a container:
- Given a range and a value:
vector a(10);
fill(a.begin(), a.end(), 1);
- Given a start, a count, and a value:
fill_n(a.begin(), 5, 2);
- These reassign existing elements in a container
prev
|top
|next