Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | iterator
m (+newline)
m (Synopsis: {{mark constexpr since c++23}})
Line 1: Line 1:
 
{{cpp/title|back_inserter}}
 
{{cpp/title|back_inserter}}
 
{{cpp/iterator/navbar}}
 
{{cpp/iterator/navbar}}
{{dcl begin}}
+
{{ddcl|header=iterator|notes={{mark constexpr since c++20}}|
{{dcl header|iterator}}
+
{{dcl rev multi|dcl1=
+
 
template< class Container >
 
template< class Container >
 
std::back_insert_iterator<Container> back_inserter( Container& c );
 
std::back_insert_iterator<Container> back_inserter( Container& c );
|since2=c++20|dcl2=
 
template< class Container >
 
constexpr std::back_insert_iterator<Container> back_inserter( Container& c );
 
 
}}
 
}}
{{dcl end}}
 
  
 
{{tt|back_inserter}} is a convenient function template that constructs a {{lc|std::back_insert_iterator}} for the container {{c|c}} with the type deduced from the type of the argument.
 
{{tt|back_inserter}} is a convenient function template that constructs a {{lc|std::back_insert_iterator}} for the container {{c|c}} with the type deduced from the type of the argument.

Revision as of 08:23, 18 September 2023

 
 
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)
 
Defined in header <iterator>
template< class Container >
std::back_insert_iterator<Container> back_inserter( Container& c );
(constexpr since C++20)

back_inserter is a convenient 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 <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
 
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 << ' ';
    std::cout << '\n';
}

Output:

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

See also

iterator adaptor for insertion at the end of a container
(class template) [edit]
creates a std::front_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]