Namespaces
Variants
Views
Actions

std::fill

From cppreference.com
< cpp‎ | algorithm
Revision as of 22:17, 12 April 2013 by Dieram3 (Talk | contribs)

 
 
 

Template:ddcl list begin <tr class="t-dsc-header">

<td>
Defined in header <algorithm>
</td>

<td></td> <td></td> <tr class="t-dcl ">

<td class="t-dcl-nopad">
template< class ForwardIt, class T >
void fill( ForwardIt first, ForwardIt last, const T& value );
</td>

<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

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

Contents

Parameters

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

Return value

(none)

Complexity

Exactly last - first assignments.

Possible implementation

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

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()
{
    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 (std::vector<int>::iterator it = v1.begin(); it != v1.end(); ++it) {
        std::cout << *it << " ";
    }
    std::cout << "\n";
}

Output:

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

See also

Template:cpp/algorithm/dcl list fill nTemplate:cpp/algorithm/dcl list generateTemplate:cpp/algorithm/dcl list transform