Namespaces
Variants
Views
Actions

std::front_inserter

From cppreference.com
< cpp‎ | iterator
Revision as of 17:23, 12 November 2013 by SuperBoi45 (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Defined in header <iterator>
template< class Container >
std::front_insert_iterator<Container> front_inserter( Container& c );

front_inserter is a convenience function template that constructs a std::front_insert_iterator for the container c with the type deduced from the type of the argument.

Contents

[edit] Parameters

c - container that supports a push_front operation

[edit] Return value

A std::front_insert_iterator which can be used to add elements to the beginning of the container c

[edit] Possible implementation

template< class Container >
std::front_insert_iterator<Container> front_inserter( Container& c )
{
    return std::front_insert_iterator<Container>(c);
}

[edit] Example

#include <iostream>
#include <deque>
#include <algorithm>
#include <iterator>
 
int main()
{
    std::deque<int> v{1,2,3,4,5,6,7,8,9,10};
    std::fill_n(std::front_inserter(v), 3, -1);
    for (int n : v)
        std::cout << n << ' ';
}

Output:

-1 -1 -1 1 2 3 4 5 6 7 8 9 10

[edit] See also

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