template < class ForwardIterator, class T >
void fill ( ForwardIterator first, ForwardIterator last, const T& value ); |
<algorithm> |
Fill range with value
Sets value to all elements in the range [first,last).
The behavior of this function template is equivalent to:
template < class ForwardIterator, class T >
void fill ( ForwardIterator first, ForwardIterator last, const T& value )
{
while (first != last) *first++ = value;
}
|
Parameters
- first, last
- Forward iterators to the initial and final positions in a sequence. The range affected is [first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
- value
- Value to be used to fill the range.
Return value
none
Example
// fill algorithm example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main () {
vector<int> myvector (8); // myvector: 0 0 0 0 0 0 0 0
fill (myvector.begin(),myvector.begin()+4,5); // myvector: 5 5 5 5 0 0 0 0
fill (myvector.begin()+3,myvector.end()-2,8); // myvector: 5 5 5 8 8 8 0 0
cout << "myvector contains:";
for (vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)
cout << " " << *it;
cout << endl;
return 0;
}
|
Output:
myvector contains: 10 99 30 30 99 10 10 99
|
Complexity
Linear: Performs as many assignment operations as the number of elements in the range
[first,last).
See also
| fill_n | Fill sequence with value (function template) |
| generate | Generate values for range with function (function template) |
| replace | Replace value in range (function template) |
| for_each | Apply function to range (template function) |
