advance

advance_c

Description

=======

advance_c

Description

>>>>>>> .merge-right.r57125

Moves an iterator by a specified distance.

<<<<<<< .working

Synopsis

=======

Synopsis

>>>>>>> .merge-right.r57125

template<
    typename I,
    int N
    >
typename result_of::advance_c<I, N>::type advance_c(I const& i);

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working

Table 1.7. Parameters

=======

Table 1.7. Parameters

=======

Table 1.7. Parameters

=======

Table 1.7. Parameters

=======

Table 1.7. Parameters

=======

Table 1.7. Parameters

=======

Table 1.7. Parameters

>>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242

>>>>>>> .merge-right.r57125

Parameter	Requirement	Description
`i`	Model of Forward Iterator	Iterator to move relative to
`N`	Integer constant	Number of positions to move

<<<<<<< .working

Expression =======

Expression >>>>>>> .merge-right.r57125 Semantics

advance_c<N>(i);

Return type: A model of the same iterator concept as i.

Semantics: Returns an iterator to the element N positions from i. If i is a Bidirectional Iterator then N may be negative.

<<<<<<< .working

Header

=======

Header

>>>>>>> .merge-right.r57125

#include <boost/fusion/iterator/advance.hpp>
#include <boost/fusion/include/advance.hpp>

<<<<<<< .working

Example

typedef vector<int,int,int> vec;
=======


          Example
        
typedef vector<int,int,int> vec;
>>>>>>> .merge-right.r57125

vec v(1,2,3);
assert(deref(advance_c<2>(begin(v))) == 3);