mirror of
https://github.com/boostorg/range.git
synced 2025-07-12 12:16:38 +02:00
cee9ffc1a8
Put the extended algorithms into boost::range in a similar manner to the standard algorithms. Added iota as an extended algorithm. Fixed defects in the extended algorithms brought to light by the new unit tests. [SVN r61042]
29 lines
631 B
Plaintext
29 lines
631 B
Plaintext
[section:for_each for_each]
|
|
|
|
[heading Prototype]
|
|
|
|
``
|
|
template<class SinglePassRange, class Value>
|
|
iota(SinglePassRange& rng, Value x);
|
|
``
|
|
|
|
[heading Description]
|
|
|
|
`iota` traverses forward through `rng`, each element `y` in `rng` is assigned a value equivalent
|
|
to `x + boost::distance(boost::begin(rng), it)`
|
|
|
|
[heading Definition]
|
|
|
|
Defined in the header file `boost/range/algorithm_ext/iota.hpp`
|
|
|
|
[heading Requirements]
|
|
|
|
# `SinglePassRange` is a model of the __single_pass_range__ Concept.
|
|
# `Value` is a model of the `Incrementable` Concept.
|
|
|
|
[heading Complexity]
|
|
|
|
Linear. Exactly `distance(rng)` assignments into `rng`.
|
|
|
|
[endsect]
|