For both overloads, if the iterator type is mutable,f may modify the elements of the range through the dereferenced iterator. Iff returns a result, the result is ignored.

Unlike the rest of the algorithms, for_each is not allowed to make copies of the elements in the sequence even if they are trivially copyable.

Unlikestd::for_each (which requires onlyMoveConstructible), these functions requireFun to modelCopyConstructible.

Notwithstanding the declarations depicted above, the actual number and order of template parameters for algorithm declarations is unspecified. Thus, if explicit template arguments are used when calling an algorithm, the program is probably non-portable.

[edit]Parameters

[edit]Return value

Atagged_pair object containing the following two members:

• The first member, with the tagtag::in, is the past-the-end iterator of the source range (that is, an iterator of typeI that compares equal to the sentinellast).
• The second member, with the tagtag::fun, is initialized fromstd::move(f) (after all applications of the function object).

[edit]Complexity

Exactlylast -first applications off andproj.

[edit]Possible implementation

template<InputIterator I, Sentinel<I> S,class Proj=ranges::identity,         IndirectUnaryInvocable<ranges::projected<I, Proj>> Fun>auto for_each(I first, S last, Fun f, Proj proj= Proj{})->ranges::tagged_pair<tag::in(I),tag::fun(Fun)>{for(; first!= last;++first)ranges::invoke(f,ranges::invoke(proj,*first));return{std::move(first), std::move(f)};}

[edit]Example

[edit]See also

• In other languages

• 日本語
• 中文