##### cppreference.com

##### Search

Create account

##### Namespaces

- Page
- Discussion

##### Variants

##### Views

- View
- Edit
- History

##### Actions

# std::fill

From cppreference.com
< 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

(none)

### [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:

Run this code

    #include <algorithm>
    #include <vector>
    #include <iostream>

    int main()
    {
        int data[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
        std::vector<int> v1(data, data+10);

        std::fill(v1.begin(), v1.end(), -1);

        for (auto elem : v1) {
            std::cout << elem << " ";
        }
        std::cout << "\n";
    }

Output:

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

### [edit] See also

fill_n | assigns a value to a number of elements (function template) [edit]
generate | saves the result of a function in a range (function template) [edit]
transform | applies a function to a range of elements (function template) [edit]

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/algorithm/fill&oldid=66805"