Standard C++ Library Class Reference

Click on the banner to return to the Class Reference home page.
©Copyright 1996 Rogue Wave Software
fill, fill_n
Algorithm
Summary
Initializes a range with a given value.
Contents
Synopsis●
Description●
Complexity●
Example●
Warnings●
Synopsis
#include <algorithm>
template <class ForwardIterator, class T>
void fill(ForwardIterator first, ForwardIterator last,
const T& value);
template <class OutputIterator, class Size, class T>
void fill_n(OutputIterator first, Size n, const T& value);
Description
The fill and fill_n algorithms are used to assign a value to the elements in a sequence. fill
assigns the value to all the elements designated by iterators in the range [first, last).
The fill_n algorithm assigns the value to all the elements designated by iterators in the range
[first, first + n). fill_n assumes that there are at least n elements following first, unless first is an