std::back_insert_iterator
From cppreference.com
Template:cpp/iterator/back insert iterator/sidebar Template:ddcl list begin
Defined in header
<iterator>
template< class Container >
class back_insert_iterator : public std::iterator< std::output_iterator_tag,
void,void,void,void >
Template:ddcl list end
std::back_insert_iterator is an output iterator that appends to a container for which it was constructed, using the container's push_back() member function whenever the iterator (whether dereferenced or not) is assigned to. Incrementing the std::back_insert_iterator is a no-op.
Member types
Template:tdcl list hitemTemplate:tdcl list itemMember objects
Template:tdcl list hitemTemplate:tdcl list itemMember functions
| constructs a new back_insert_iterator (public member function) | |
| appends an object to the associated container (public member function) | |
| no-op (public member function) | |
| no-op (public member function) |
Member types
| Member type | Definition | ||||
iterator_category
|
std::output_iterator_tag
| ||||
value_type
|
void
| ||||
difference_type
|
| ||||
pointer
|
void
| ||||
reference
|
void
|
|
Member types |
(until C++17) |
Example
Run this code
#include <iostream>
#include <iterator>
#include <algorithm>
#include <cstdlib>
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