prior

Description

=======

prior

Description

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

Moves an iterator 1 position backwards.

<<<<<<< .working

Synopsis

=======

Synopsis

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

template<
    typename I
    >
typename result_of::prior<I>::type prior(I const& i);

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

Table 1.4. Parameters

=======

Table 1.4. Parameters

=======

Table 1.4. Parameters

=======

Table 1.4. Parameters

=======

Table 1.4. Parameters

=======

Table 1.4. Parameters

=======

Table 1.4. 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 Bidirectional Iterator	Operation's argument

<<<<<<< .working

Expression =======

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

prior(i);

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

Semantics: Returns an iterator to the element prior to i.

<<<<<<< .working

Header

=======

Header

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

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

<<<<<<< .working

Example

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


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

vec v(1,2);
assert(deref(next(begin(v))) == 2);
assert(deref(prior(next(begin(v)))) == 1);