GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
std::fill(3) C++ Standard Libary std::fill(3)

std::fill - std::fill


Defined in header <algorithm>
template< class ForwardIt, class T > (until C++20)
void fill( ForwardIt first, ForwardIt last, const T& value );
template< class ForwardIt, class T >
constexpr void fill( ForwardIt first, ForwardIt last, const T& (1) (since C++20)
value );
template< class ExecutionPolicy, class ForwardIt, class T >
void fill( ExecutionPolicy&& policy, ForwardIt first, (2) (since C++17)
ForwardIt last, const T& value );


1) Assigns the given value to the elements in the range [first, last).
2) Same as (1), but executed according to policy. This overload does not participate
in overload resolution unless
std::is_execution_policy_v<std::decay_t<ExecutionPolicy>>
(until C++20)
std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>
(since C++20) is true.


first, last - the range of elements to modify
value - the value to be assigned
policy - the execution policy to use. See execution policy for details.


-
ForwardIt must meet the requirements of LegacyForwardIterator.


(none)


Exactly last - first assignments.


The overload with a template parameter named ExecutionPolicy reports errors as
follows:


* If execution of a function invoked as part of the algorithm throws an exception
and ExecutionPolicy is one of the standard policies, std::terminate is called.
For any other ExecutionPolicy, the behavior is implementation-defined.
* If the algorithm fails to allocate memory, std::bad_alloc is thrown.


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


The following code uses fill() to set all of the elements of a vector of ints to -1:

// Run this code


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


int main()
{
std::vector<int> v{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};


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


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


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


fill_n copy-assigns the given value to N elements in a range
(function template)
copy copies a range of elements to a new location
copy_if (function template)
(C++11)
assigns the results of successive function calls to every element in a
generate range
(function template)
applies a function to a range of elements, storing results in a
transform destination range
(function template)
ranges::fill assigns a range of elements a certain value
(C++20) (niebloid)

2022.07.31 http://cppreference.com

Search for    or go to Top of page |  Section 3 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.