Namespaces
Variants
Views
Actions

std::front_insert_iterator

From cppreference.com
< cpp‎ | iterator
Revision as of 15:15, 2 November 2012 by P12bot (Talk | contribs)

Template:ddcl list begin <tr class="t-dsc-header">

<td>
Defined in header <iterator>
</td>

<td></td> <td></td> <tr class="t-dcl ">

<td class="t-dcl-nopad">
template< class Container >

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

                                                   void,void,void,void >
</td>

<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

std::front_insert_iterator is an output iterator that prepends elements to a container for which it was constructed, using the container's push_front() member function whenever the iterator (whether dereferenced or not) is assigned to. Incrementing the std::front_insert_iterator is a no-op.

Contents

Member types

Member type Definition
container_type Container

Member functions

Template:cpp/iterator/inserter/dcl list constructorTemplate:cpp/iterator/inserter/dcl list operator=Template:cpp/iterator/inserter/dcl list operator*Template:cpp/iterator/inserter/dcl list operator++

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

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

Template:cpp/iterator/dcl list front inserterTemplate:cpp/iterator/dcl list back insert iteratorTemplate:cpp/iterator/dcl list insert iterator