Standard C++ Library Class Reference

Description
Insert iterators let you insert new elements into a collection rather than copy a new element's
value over the value of an existing element. The class back_insert_iterator is used to insert
items at the end of a collection. The function back_inserter creates an instance of a
back_insert_iterator for a particular collection type. A back_insert_iterator can be used with
vectors, deques, and lists, but not with maps or sets.
Interface
template <class Container>
class back_insert_iterator : public output_iterator {
protected:
Container& container;
public:
back_insert_iterator (Container&);
back_insert_iterator<Container>&
operator= (const Container::value_type&);
back_insert_iterator<Container>& operator* ();
back_insert_iterator<Container>& operator++ ();
back_insert_iterator<Container> operator++ (int);
};
template <class Container>
back_insert_iterator<Container> back_inserter (Container&);
Constructor
back_insert_iterator (Container& x);
Constructor. Creates an instance of a back_insert_iterator associated with container x.
Operators
back_insert_iterator<Container>&
operator= (const Container::value_type& value);
Inserts a copy of value on the end of the container, and returns *this.
back_insert_iterator<Container>&
operator* ();
Returns *this.
back_insert_iterator<Container>&
operator++ ();
back_insert_iterator<Container>
operator++ (int);