std::back_insert_iterator

From cppreference.com
< cpp‎ | iterator
Defined in header <iterator>
template< class Container >

class back_insert_iterator : public std::iterator< std::output_iterator_tag,

                                                   void, void, void, void >

std::back_insert_iterator is an OutputIterator that appends to a container for which it was constructed. The container's push_back() member function is called whenever the iterator (whether dereferenced or not) is assigned to. Incrementing the std::back_insert_iterator is a no-op.

Contents

[edit] Member types

Member type Definition
container_type Container

[edit] Member functions

constructs a new back_insert_iterator
(public member function)
inserts an object into the associated container
(public member function)
no-op
(public member function)
no-op
(public member function)

[edit] Member objects

Member name Definition
container (protected) a pointer of type Container*

Inherited from std::iterator

Member types

Member type Definition
value_type void
difference_type void
pointer void
reference void
iterator_category std::output_iterator_tag

[edit] Example

#include <iostream>
#include <iterator>
#include <algorithm>
#include <cstdlib>
#include <vector>
 
int main()
{
    std::vector<int> v;
    std::generate_n(std::back_insert_iterator<std::vector<int>>(v), // can be simplified
                    10, [](){ return std::rand() % 10; });        // with std::back_inserter
    for (int n : v)
        std::cout << n << ' ';
    std::cout << '\n';
}

Output:

3 6 7 5 3 5 6 2 9 1

[edit] See also

creates a std::back_insert_iterator of type inferred from the argument
(function template)
iterator adaptor for insertion at the front of a container
(class template)
iterator adaptor for insertion into a container
(class template)