A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://cplusplus.com/reference/algorithm/fill/ below:

function template

<algorithm>

std::fill 
template <class ForwardIterator, class T>  void fill (ForwardIterator first, ForwardIterator last, const T& val);

Fill range with value

Assigns val to all the elements in the range [first,last).

The behavior of this function template is equivalent to:


1
2
3
4
5
6
7
8
template <class ForwardIterator, class T>
  void fill (ForwardIterator first, ForwardIterator last, const T& val)
{
  while (first != last) {
    *first = val;
    ++first;
  }
}

Parameters
first, last
Forward iterators to the initial and final positions in a sequence of elements that support being assigned a value of type T. The range filled 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.
val
Value to assign to the elements in the filled range.

Return value none

Example 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
// fill algorithm example
#include <iostream>     // std::cout
#include <algorithm>    // std::fill
#include <vector>       // std::vector

int main () {
  std::vector<int> myvector (8);                       // myvector: 0 0 0 0 0 0 0 0

  std::fill (myvector.begin(),myvector.begin()+4,5);   // myvector: 5 5 5 5 0 0 0 0
  std::fill (myvector.begin()+3,myvector.end()-2,8);   // myvector: 5 5 5 8 8 8 0 0

  std::cout << "myvector contains:";
  for (std::vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}

Output: 
myvector contains: 5 5 5 8 8 8 0 0


Complexity Linear in the distance between first and last: Assigns a value to each element.

Data races The objects in the range [first,last) are modified (each object is accessed exactly once).

Exceptions Throws if either an element assignment or an operation on an iterator throws.
Note that invalid arguments cause undefined behavior.

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 (function template)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4