Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/iterator/front inserter"

From cppreference.com
< cpp‎ | iterator
m (Text replace - "{{example cpp" to "{{example")
m (Text replace - "{{cpp|" to "{{c|")
Line 9: Line 9:
 
{{ddcl list end}}
 
{{ddcl list end}}
  
{{tt|front_inserter}} is a convenience function template that constructs a {{cpp|std::front_insert_iterator}} for the container {{tt|c}} with the type deduced from the type of the argument.
+
{{tt|front_inserter}} is a convenience function template that constructs a {{c|std::front_insert_iterator}} for the container {{tt|c}} with the type deduced from the type of the argument.
  
 
===Parameters===
 
===Parameters===
Line 17: Line 17:
  
 
===Return value===
 
===Return value===
A {{cpp|std::front_insert_iterator}} which can be used to add elements to the beginning of the container {{tt|c}}
+
A {{c|std::front_insert_iterator}} which can be used to add elements to the beginning of the container {{tt|c}}
  
 
===Possible implementation===
 
===Possible implementation===

Revision as of 19:37, 19 April 2012

Template:cpp/iterator/sidebar Template:ddcl list begin <tr class="t-dsc-header">

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

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

<td class="t-dcl-nopad">
template< class Container >
std::front_insert_iterator<Container> front_inserter( Container& c);
</td>

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

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

Parameters

c - container that supports a push_front operation

Return value

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

Possible implementation

Template:eq fun cpp

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

See also

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