Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | iterator
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, ru, zh)
m
Line 36: Line 36:
 
#include <algorithm>
 
#include <algorithm>
 
#include <iterator>
 
#include <iterator>
 +
 
int main()
 
int main()
 
{
 
{
     std::vector<int> v{1,2,3,4,5,6,7,8,9,10};
+
     std::vector<int> v{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
 
     std::fill_n(std::back_inserter(v), 3, -1);
 
     std::fill_n(std::back_inserter(v), 3, -1);
     for(int n : v)
+
     for (int n : v)
 
         std::cout << n << ' ';
 
         std::cout << n << ' ';
 
}
 
}

Revision as of 14:28, 30 December 2012

 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
(C++20)
(C++20)
(C++20)
Utilities
(C++20)
Iterator adaptors
Range access
(C++11)(C++14)
(C++14)(C++14)  
(C++11)(C++14)
(C++14)(C++14)  
(C++17)(C++20)
(C++17)
(C++17)
 

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::back_insert_iterator<Container> back_inserter( Container& c);
</td>

<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

#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

See also

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