prior

Description

=======

prior

Description

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

Returns the type of the previous iterator in a sequence.

<<<<<<< .working

Synopsis

=======

Synopsis

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

template<
    typename I
    >
struct prior
{
    typedef unspecified type;
};

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

Table 1.14. Parameters

=======

Table 1.14. Parameters

=======

Table 1.15. Parameters

=======

Table 1.15. Parameters

=======

Table 1.15. Parameters

=======

Table 1.15. Parameters

=======

Table 1.15. 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

result_of::prior<I>::type

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

Semantics: Returns an iterator to the previous element in the sequence before I.

<<<<<<< .working

Header

=======

Header

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

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

<<<<<<< .working

Example

typedef vector<int,double> vec;
typedef result_of::next<result_of::begin<vec>::type>::type second;
=======


          Example
        
typedef vector<int,double> vec;
typedef result_of::next<result_of::begin<vec>::type>::type second;
>>>>>>> .merge-right.r57125

BOOST_MPL_ASSERT((boost::is_same<result_of::value_of<second>::type, double>));

typedef result_of::prior<second>::type first;
BOOST_MPL_ASSERT((boost::is_same<result_of::value_of<first>::type, int>));