template <class ForwardIterator, class T> void fill(ForwardIterator first, ForwardIterator last, const T& value);
DescriptionFill assigns the value value to every element in the range [first, last). That is, for every iterator i in [first, last), it performs the assignment *i = value.
DefinitionDefined in the standard header algorithm, and in the nonstandard backward-compatibility header algo.h.
Requirements on types
ComplexityLinear. Fill performs exactly last - first assignments.
vector<double> V(4); fill(V.begin(), V.end(), 137); assert(V == 137 && V == 137 && V == 137 && V == 137);
 The reason that fill requires its argument to be a mutable forward iterator, rather than merely an output iterator, is that it uses a range [first, last) of iterators. There is no sensible way to describe a range of output iterators, because it is impossible to compare two output iterators for equality. The fill_n algorithm does have an interface that permits use of an output iterator.
See alsocopy, fill_n, generate, generate_n, iota
Copyright © 1999 Silicon Graphics, Inc. All Rights Reserved. TrademarkInformation