back_insert_iterator, back_inserter

A back_insert_iterator is an iterator that always inserts at the end of its associated container.

Library

Standards<ToolKit>

Declaration


#include <iterator>

template< Container >
class back_insert_iterator : public output_iterator

Adaptor

back_insert_iterator< Container > back_inserter( Container& container );

Interface

Constructor
back_insert_iterator( Container& container )
Constructs an iterator associated with container .
=
back_insert_iterator< Container >& operator=( const value_type& value )
Inserts a copy of value at the end of the iterator's associated container.
*
back_insert_iterator< Container >& operator*()
Returns a reference to the iterator.
++
back_insert_iterator< Container >& operator++()
Returns a reference to the iterator.
++
back_insert_iterator< Container > operator++( int )
Returns a copy of the iterator.
Example <ospace/osstd/examples/binsert1.cpp>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>

char* array[] = { "laurie", "jennifer", "leisa" };

void
main()
  {
  vector< char* > names;
  copy
    (
    array,
    array + 3,
    back_insert_iterator< vector< char* > >( names )
    );
  vector< char* >::iterator i;
  for ( i = names.begin(); i != names.end(); ++i )
    cout << *i << "\n";
  }

laurie
jennifer
leisa
Example <ospace/osstd/examples/binsert2.cpp>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>

char* array [] = { "laurie", "jennifer", "leisa" };

void
main ()
  {
  vector<char*> names;

  copy (array, array + 3, back_inserter (names));

  vector<char*>::iterator i;
  for (i = names.begin (); i != names.end (); i++)
    cout << *i << endl;
  }

laurie
jennifer
leisa

Copyright©1994-2026 Recursion Software LLC
All Rights Reserved - For use by licensed users only.