Difference between revisions of "cpp/iterator/back inserter"
From cppreference.com
m (Text replace - "/sidebar" to "/navbar") |
m (Text replace - "{{eq fun cpp" to "{{eq fun") |
||
| Line 20: | Line 20: | ||
===Possible implementation=== | ===Possible implementation=== | ||
| − | {{eq fun | + | {{eq fun | 1= |
template< class Container > | template< class Container > | ||
std::back_insert_iterator<Container> back_inserter( Container& c) | std::back_insert_iterator<Container> back_inserter( Container& c) | ||
Revision as of 04:35, 3 July 2012
Template:ddcl list begin <tr class="t-dsc-header">
<td>Defined in header
</td>
<iterator>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td class="t-dcl-nopad">template< class Container >
std::back_insert_iterator<Container> back_inserter( Container& c);
</td>
std::back_insert_iterator<Container> back_inserter( Container& c);
<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
back_inserter is a convenience function template that constructs a std::back_insert_iterator for the container c with the type deduced from the type of the argument.
Contents |
Parameters
| c | - | container that supports a push_back operation |
Return value
A std::back_insert_iterator which can be used to add elements to the end of the container c
Possible implementation
template< class Container > std::back_insert_iterator<Container> back_inserter( Container& c) { return std::back_insert_iterator<Container>(c); } |
Example
Run this code
#include <iostream> #include <vector> #include <algorithm> #include <iterator> int main() { std::vector<int> v{1,2,3,4,5,6,7,8,9,10}; std::fill_n(std::back_inserter(v), 3, -1); for(int n : v) std::cout << n << ' '; }
Output:
1 2 3 4 5 6 7 8 9 10 -1 -1 -1
