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

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_algorithm_fill.htm below:

C++ fill Algorithm

The C++ function std::algorithm::fill() assigns certain value to a range of elements.

Following is the declaration for std::algorithm::fill() function form std::algorithm header.

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

• first − Forward iterators to the initial positions.

• last − Forward iterators to the final positions.

• val − Value to be used to fill the range.

None

Throws an exception if either element assignment or an operation on an iterator throws exception.

Please note that invalid parameters cause undefined behavior.

Linear in the distance between first to last.

The following example shows the usage of std::algorithm::fill() function.

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

using namespace std;

int main(void) {
   vector<int> v(5);

   fill(v.begin(), v.end(), 1);

   cout << "Vector contains following elements" << endl;

   for (auto it = v.begin(); it != v.end(); ++it)
      cout << *it << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

Vector contains following elements
1
1
1
1
1

algorithm.htm

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