< cpp‎ | algorithm
Defined in header <algorithm>
template< class ForwardIt, class T >
void fill( ForwardIt first, ForwardIt last, const T& value );

Assigns the given value to the elements in the range [first, last).


[edit] Parameters

first, last - the range of elements to modify
value - the value to be assigned
Type requirements
ForwardIt must meet the requirements of ForwardIterator.

[edit] Return value


[edit] Complexity

Exactly last - first assignments.

[edit] Possible implementation

template< class ForwardIt, class T >
void fill(ForwardIt first, ForwardIt last, const T& value)
    for (; first != last; ++first) {
        *first = value;

[edit] Example

The following code uses fill() to set all of the elements of a vector of integers to -1:

#include <algorithm>
#include <vector>
#include <iostream>
int main()
    std::vector<int> v{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    std::fill(v.begin(), v.end(), -1);
    for (auto elem : v) {
        std::cout << elem << " ";
    std::cout << "\n";


-1 -1 -1 -1 -1 -1 -1 -1 -1 -1

[edit] See also

assigns a value to a number of elements
(function template) [edit]
copies a range of elements to a new location
(function template) [edit]
saves the result of a function in a range
(function template) [edit]
applies a function to a range of elements
(function template) [edit]
parallelized version of std::fill
(function template) [edit]