GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Python Technologies
  • Databases
  • Computer Programming
  • Web Development
  • Java Technologies
  • Computer Science
  • Mobile Development
  • Big Data & Analytics
  • Microsoft Technologies
  • DevOps
  • Latest Technologies
  • Machine Learning
  • Digital Marketing
  • Software Quality

This view

  • Original page
  • New address

GeezerVison is showing www.tutorialspoint.com — C++ Algorithm Library - fill() Function

The C++ Standard Library
  • The C Standard Library
  • C++ Library - Home
  • C++ Library - <fstream>
  • C++ Library - <iomanip>
  • C++ Library - <ios>
  • C++ Library - <iosfwd>
  • C++ Library - <iostream>
  • C++ Library - <istream>
  • C++ Library - <ostream>
  • C++ Library - <sstream>
  • C++ Library - <streambuf>
  • C++ Library - <atomic>
  • C++ Library - <complex>
  • C++ Library - <exception>
  • C++ Library - <functional>
  • C++ Library - <limits>
  • C++ Library - <locale>
  • C++ Library - <memory>
  • C++ Library - <new>
  • C++ Library - <numeric>
  • C++ Library - <regex>
  • C++ Library - <stdexcept>
  • C++ Library - <string>
  • C++ Library - <thread>
  • C++ Library - <tuple>
  • C++ Library - <typeinfo>
  • C++ Library - <utility>
  • C++ Library - <valarray>
  • The C++ STL Library
  • C++ Library - <array>
  • C++ Library - <bitset>
  • C++ Library - <deque>
  • C++ Library - <forward_list>
  • C++ Library - <list>
  • C++ Library - <map>
  • C++ Library - <multimap>
  • C++ Library - <queue>
  • C++ Library - <priority_queue>
  • C++ Library - <set>
  • C++ Library - <multiset >
  • C++ Library - <stack>
  • C++ Library - <unordered_map>
  • C++ Library - <unordered_set>
  • C++ Library - <unordered_multiset>
  • C++ Library - <vector>
  • C++ Library - <algorithm>
  • C++ Library - <iterator>
  • The C++ Advanced Library
  • C++ Library - <any>
  • C++ Library - <barrier>
  • C++ Library - <bit>
  • C++ Library - <chrono>
  • C++ Library - <cinttypes>
  • C++ Library - <clocale>
  • C++ Library - <condition_variable>
  • C++ Library - <coroutine>
  • C++ Library - <cstdlib>
  • C++ Library - <cstring>
  • C++ Library - <cuchar>
  • C++ Library - <charconv>
  • C++ Library - <cfenv>
  • C++ Library - <cmath>
  • C++ Library - <ccomplex>
  • C++ Library - <expected>
  • C++ Library - <format>
  • C++ Library - <future>
  • C++ Library - <flat_set>
  • C++ Library - <flat_map>
  • C++ Library - <filesystem>
  • C++ Library - <generator>
  • C++ Library - <initializer_list>
  • C++ Library - <latch>
  • C++ Library - <memory_resource>
  • C++ Library - <mutex>
  • C++ Library - <mdspan>
  • C++ Library - <optional>
  • C++ Library - <print>
  • C++ Library - <ratio>
  • C++ Library - <scoped_allocator>
  • C++ Library - <semaphore>
  • C++ Library - <source_location>
  • C++ Library - <span>
  • C++ Library - <spanstream>
  • C++ Library - <stacktrace>
  • C++ Library - <stop_token>
  • C++ Library - <syncstream>
  • C++ Library - <system_error>
  • C++ Library - <string_view>
  • C++ Library - <stdatomic>
  • C++ Library - <variant>
  • C++ STL Library Cheat Sheet
  • C++ STL - Cheat Sheet
  • C++ Programming Resources
  • C++ Programming Tutorial
  • C++ Useful Resources
  • C++ Discussion
Selected Reading
  • UPSC IAS Exams Notes
  • Developer's Best Practices
  • Questions and Answers
  • Online Resume Builder
  • HR Interview Questions
  • Computer Glossary
  • Who is Who

C++ Algorithm Library - fill() Function



Previous
Quiz
Next

Description

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

Declaration

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

C++98

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

Parameters

  • first − Forward iterators to the initial positions.

  • last − Forward iterators to the final positions.

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

Return value

None

Exceptions

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

Please note that invalid parameters cause undefined behavior.

Time complexity

Linear in the distance between first to last.

Example

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
Tutorix - AI Tutor
Previous Quiz Next
Advertisements
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.