NAME

       std::back_insert_iterator< _Container > -

SYNOPSIS

       Inherits std::iterator< output_iterator_tag, void, void, void, void >.

   Public Types
       typedef _Container container_type
       typedef void difference_type
       typedef output_iterator_tag iterator_category
       typedef void pointer
       typedef void reference
       typedef void value_type

   Public Member Functions
       back_insert_iterator (_Container &__x)
       back_insert_iterator & operator* ()
       back_insert_iterator & operator++ ()
       back_insert_iterator operator++ (int)
       back_insert_iterator & operator= (const typename _Container::value_type &__value)
       back_insert_iterator & operator= (typename _Container::value_type &&__value)

   Protected Attributes
       _Container * container

Detailed Description

   template<typename _Container>
       class std::back_insert_iterator< _Container >" Turns assignment into insertion.

       These are output iterators, constructed from a container-of-T. Assigning a T to the
       iterator appends it to the container using push_back.

       Tip: Using the back_inserter function to create these iterators can save typing.

       Definition at line 415 of file stl_iterator.h.

Member Typedef Documentation

   template<typename _Container > typedef _Container std::back_insert_iterator< _Container
       >::container_type
       A nested typedef for the type of whatever container you used.

       Definition at line 423 of file stl_iterator.h.

   typedef void  std::iterator< output_iterator_tag , void , void , void , void
       >::difference_type [inherited]
       Distance between iterators is represented as this type.

       Definition at line 125 of file stl_iterator_base_types.h.

   typedef output_iterator_tag  std::iterator< output_iterator_tag , void , void , void , void
       >::iterator_category [inherited]
       One of the tag types.

       Definition at line 121 of file stl_iterator_base_types.h.

   typedef void  std::iterator< output_iterator_tag , void , void , void , void  >::pointer
       [inherited]
       This type represents a pointer-to-value_type.

       Definition at line 127 of file stl_iterator_base_types.h.

   typedef void  std::iterator< output_iterator_tag , void , void , void , void  >::reference
       [inherited]
       This type represents a reference-to-value_type.

       Definition at line 129 of file stl_iterator_base_types.h.

   typedef void  std::iterator< output_iterator_tag , void , void , void , void  >::value_type
       [inherited]
       The type 'pointed to' by the iterator.

       Definition at line 123 of file stl_iterator_base_types.h.

Constructor & Destructor Documentation

   template<typename _Container > std::back_insert_iterator< _Container >::back_insert_iterator
       (_Container & __x) [inline],  [explicit]
       The only way to create this iterator is with a container.

       Definition at line 427 of file stl_iterator.h.

Member Function Documentation

   template<typename _Container > back_insert_iterator& std::back_insert_iterator< _Container
       >::operator* () [inline]
       Simply returns *this.

       Definition at line 465 of file stl_iterator.h.

   template<typename _Container > back_insert_iterator& std::back_insert_iterator< _Container
       >::operator++ () [inline]
       Simply returns *this. (This iterator does not move.)

       Definition at line 470 of file stl_iterator.h.

   template<typename _Container > back_insert_iterator std::back_insert_iterator< _Container
       >::operator++ (int) [inline]
       Simply returns *this. (This iterator does not move.)

       Definition at line 475 of file stl_iterator.h.

   template<typename _Container > back_insert_iterator& std::back_insert_iterator< _Container
       >::operator= (const typename _Container::value_type & __value) [inline]
       Parameters:
           __value An instance of whatever type container_type::const_reference is; presumably a
           reference-to-const T for container<T>.

       Returns:
           This iterator, for chained operations.

       This kind of iterator doesn't really have a position in the container (you can think of
       the position as being permanently at the end, if you like). Assigning a value to the
       iterator will always append the value to the end of the container.

       Definition at line 449 of file stl_iterator.h.

Author

       Generated automatically by Doxygen for libstdc++ from the source code.

libstdc++                                 Fri Oct 4 std::back_insert_iterator< _Container >(3cxx)