stlab.adobe.com Adobe Systems Incorporated

for_each_position
[Non-Mutating Algorithms]

Functions

template<class InputIterator , class UnaryFunction >
void for_each_position (InputIterator first, InputIterator last, UnaryFunction f)
template<class InputRange , class UnaryFunction >
void for_each_position (const InputRange &range, UnaryFunction f)
template<class InputRange , class UnaryFunction >
void for_each_position (InputRange &range, UnaryFunction f)

Detailed Description

for_each_position applies the function f to each iterator, as opposed to element, in the range [first, last); f's return value, if any, is ignored. Applications are performed in forward order, i.e. from first to last.

Complexity Guarantees:
Linear. Exactly last - first applications of f.

Function Documentation

void adobe::for_each_position ( InputIterator  first,
InputIterator  last,
UnaryFunction  f 
)

for_each_position implementation

Definition at line 63 of file for_each_position.hpp.

void adobe::for_each_position ( const InputRange &  range,
UnaryFunction  f 
)

for_each_position implementation

Definition at line 85 of file for_each_position.hpp.

void adobe::for_each_position ( InputRange &  range,
UnaryFunction  f 
)

for_each_position implementation

Definition at line 74 of file for_each_position.hpp.

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google