Export (0) Print
Expand All

inserter

A helper template function that lets you use inserter(_Cont,_Where) instead of insert_iterator<Container>(_Cont,_Where).

template<class Container>
    insert_iterator<Container> inserter(
        Container& _Cont,
        typename Container::iterator _Where
    );

_Cont

The container to which new elements are to be added.

_Where

An iterator locating the point of insertion.

The template function returns insert_iterator::insert_iterator<Container>(_Cont, _Where).

// iterator_inserter.cpp
// compile with: /EHsc
#include <iterator>
#include <list>
#include <iostream>

int main( )
{
   using namespace std;
   int i;
   list <int>::iterator L_Iter;

   list<int> L;
   for (i = 2 ; i < 5 ; ++i )  
   {
      L.push_back ( 10 * i );
   }

   cout << "The list L is:\n ( ";
   for ( L_Iter = L.begin( ) ; L_Iter != L.end( ); L_Iter++ )
      cout << *L_Iter << " ";
   cout << ")." << endl;

   // Using the template version to insert an element
   insert_iterator<list <int> > Iter( L, L.begin ( ) );
   *Iter = 1;

   // Alternatively, using the member function to insert an element
   inserter ( L, L.end ( ) ) = 500;

   cout << "After the insertions, the list L is:\n ( ";
   for ( L_Iter = L.begin( ) ; L_Iter != L.end( ); L_Iter++)
      cout << *L_Iter << " ";
   cout << ")." << endl;
}
The list L is:
 ( 20 30 40 ).
After the insertions, the list L is:
 ( 1 20 30 40 500 ).

Header: <iterator>

Namespace: std

Show:
© 2015 Microsoft