.. Algorithms/Inserters//back_inserter back_inserter ============= Synopsis -------- .. parsed-literal:: template< typename Seq > struct back_inserter { // |unspecified| // |...| }; Description ----------- Inserts elements at the end of the sequence. Header ------ .. parsed-literal:: #include Model of -------- |Inserter| Parameters ---------- +---------------+-------------------------------+---------------------------------------+ | Parameter | Requirement | Description | +===============+===============================+=======================================+ | ``Seq`` | |Back Extensible Sequence| | A sequence to bind the inserter to. | +---------------+-------------------------------+---------------------------------------+ Expression semantics -------------------- |Semantics disclaimer...| |Inserter|. For any |Back Extensible Sequence| ``s``: +---------------------------+-------------------------------------------------------+ | Expression | Semantics | +===========================+=======================================================+ | ``back_inserter`` | An |Inserter| ``in``, equivalent to | | | | | | .. parsed-literal:: | | | | | | struct in : inserter > {}; | +---------------------------+-------------------------------------------------------+ Complexity ---------- Amortized constant time. Example ------- .. parsed-literal:: typedef copy< range_c , back_inserter< vector_c > >::type range; BOOST_MPL_ASSERT(( equal< range, range_c > )); See also -------- |Algorithms|, |Inserter|, |Reversible Algorithm|, |inserter|, |front_inserter|, |push_back|