std::front_insert_iterator
Defined in header <iterator> | ||
---|---|---|
template< class Container >
class front_insert_iterator : public std::iterator< std::output_iterator_tag,
void,void,void,void >
| (until C++17) | |
template< class Container >
class front_insert_iterator;
| (since C++17) |
std::front_insert_iterator
is an LegacyOutputIterator that prepends elements to a container for which it was constructed. The container's push_front()
member function is called whenever the iterator (whether dereferenced or not) is assigned to. Incrementing the std::front_insert_iterator
is a no-op.
Member types
Member type | Definition |
---|---|
container_type | Container |
Member functions
constructs a new front_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) |
Member objects
Member name | Definition |
---|---|
container (protected) | a pointer of type Container* |
Member types
Member type | Definition |
---|---|
value_type | void |
difference_type | void |
pointer | void |
reference | void |
iterator_category | std::output_iterator_tag |
These member types are required to be obtained by inheriting from | (until C++17) |
Example
#include <vector>
#include <deque>
#include <iostream>
#include <iterator>
#include <algorithm>
int main()
{
std::vector<int> v{1,2,3,4,5};
std::deque<int> d;
std::copy(v.begin(), v.end(),
std::front_insert_iterator<std::deque<int>>(d)); // or std::front_inserter(d)
for(int n : d)
std::cout << n << ' ';
std::cout << '\n';
}
Output:
5 4 3 2 1
See also
creates a std::front_insert_iterator of type inferred from the argument (function template) |
|
iterator adaptor for insertion at the end of a container (class template) |
|
iterator adaptor for insertion into a container (class template) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/iterator/front_insert_iterator