insert

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working Description ======= ======= ======= ======= ======= ======= >>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242 Description >>>>>>> .merge-right.r57125

Returns a new sequence with all the elements of the original, an a new element inserted the position described by a given iterator.

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working Synposis ======= ======= ======= ======= ======= ======= >>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242 Synposis >>>>>>> .merge-right.r57125

template<
    typename Sequence,
    typename Pos,
    typename T
    >
typename result_of::insert<Sequence const, Pos, T>::type insert(
    Sequence const& seq, Pos const& pos, T const& t);

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

Table 1.65. Parameters

=======

Table 1.65. Parameters

=======

Table 1.69. Parameters

=======

Table 1.69. Parameters

=======

Table 1.69. Parameters

=======

Table 1.69. Parameters

=======

Table 1.69. Parameters

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

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

Parameter	Requirement	Description
`seq`	A model of Forward Sequence	Operation's argument
`pos`	A model of Forward Iterator	The position to insert at
`t`	Any type	The value to insert

<<<<<<< .working

Expression =======

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

insert(seq, p, t);

<<<<<<< .working Return type: A model of Forward Sequence. ======= Return type: >>>>>>> .merge-right.r57242

A model of Forward Sequence.
A model of Associative Sequence if seq implements the Associative Sequence model.

Semantics: Returns a new sequence, containing all the elements of seq, in their original order, and a new element with the type and value of t inserted at iterator pos.

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working Complexity ======= ======= ======= ======= ======= ======= >>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242 Complexity >>>>>>> .merge-right.r57125

Constant. Returns a view which is lazily evaluated.

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working Header ======= ======= ======= ======= ======= ======= >>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242 Header >>>>>>> .merge-right.r57125

#include <boost/fusion/algorithm/transformation/insert.hpp>
#include <boost/fusion/include/insert.hpp>

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working Example ======= ======= ======= ======= ======= ======= >>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242 Example >>>>>>> .merge-right.r57125

const vector<int,int> vec(1,2);
assert(insert(vec, next(begin(vec)), 3) == make_vector(1,3,2));